Issue |
RAIRO-Theor. Inf. Appl.
Volume 43, Number 2, April-June 2009
|
|
---|---|---|
Page(s) | 249 - 268 | |
DOI | https://doi.org/10.1051/ita:2008026 | |
Published online | 02 October 2008 |
Thread algebra for noninterference
Sectie Software Engineering, University of Amsterdam, Kruislaan
403, 1098 SJ Amsterdam, The Netherlands;
tdvu@science.uva.nl
Received:
8
May
2007
Accepted:
11
September
2008
Thread algebra is a semantics for recent object-oriented programming languages [J.A. Bergstra and M.E. Loots, J. Logic Algebr. Program. 51 (2002) 125–156; J.A. Bergstra and C.A. Middelburg, Formal Aspects Comput. (2007)] such as C# and Java. This paper shows that thread algebra provides a process-algebraic framework for reasoning about and classifying various standard notions of noninterference, an important property in secure information flow. We will take the noninterference property given by Volpano et al. [D. Volpano, G. Smith and C. Irvine, J. Comput. Secur. 4 (1996) 167–187] on type systems as an example of our approach. We define a comparable notion of noninterference in the setting of thread algebra. Our approach gives a similar result to the approach of [G. Smith and D. Volpano, in POPL'98 29 (1998) 355–364] and can be applied to unstructured and multithreaded programming languages.
Mathematics Subject Classification: 68Q60
Key words: Noninterference / thread algebra / formal methods / security verification
© EDP Sciences, 2008
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.