Haley, Charles B.; Moffett, Jonathan D.; Laney, Robin and Nuseibeh, Bashar
PDF (Not Set)
- Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
|Google Scholar:||Look up in Google Scholar|
This paper proposes using both formal and structured informal arguments to show that an eventual realized system can satisfy its security requirements. These arguments, called 'satisfaction arguments', consist of two parts: a formal argument based upon claims about domain properties, and a set of informal arguments that justify the claims. Building on our earlier work on trust assumptions and security requirements, we show how using satisfaction arguments assists in clarifying how a system satisfies its security requirements, in the process identifying those properties of domains that are critical to the requirements.
|Item Type:||Conference Item|
|Keywords:||argumentation; security requirements|
|Academic Unit/Department:||Mathematics, Computing and Technology > Computing & Communications
Mathematics, Computing and Technology
|Interdisciplinary Research Centre:||Centre for Research in Computing (CRC)|
|Depositing User:||Charles Haley|
|Date Deposited:||12 Jun 2006|
|Last Modified:||25 Feb 2016 13:45|
|Share this page:|
Download history for this item
These details should be considered as only a guide to the number of downloads performed manually. Algorithmic methods have been applied in an attempt to remove automated downloads from the displayed statistics but no guarantee can be made as to the accuracy of the figures.