DocumentCode
3312716
Title
Some laws of non-interference [CSP algebra]
Author
Graham-Cumming, John
Author_Institution
Oxford Univ. Comput. Lab., Oxford, UK
fYear
1992
fDate
16-18 Jun 1992
Firstpage
22
Lastpage
33
Abstract
The author defines non-interference in the algebra of CSP; that definition leads to simple proof rules for non-interference concerning, amongst other things, composition of systems exhibiting non-interference. The author works through a case study of a multi-level secure system to illustrate those laws
Keywords
communicating sequential processes; security of data; theorem proving; algebra of CSP; communicating sequential process; composition of systems; multi-level secure system; noninterference laws; proof rules; Algebra; Computational modeling; Design methodology; Interference; Laboratories; Multilevel systems; Security;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Security Foundations Workshop V, 1992. Proceedings.
Conference_Location
Franconia, NH
Print_ISBN
0-8186-2850-2
Type
conf
DOI
10.1109/CSFW.1992.236790
Filename
236790
Link To Document