loading...
Noninterference Equations for Nondeterministic Systems
Cape Breton, Novia Scotia, Canada June 11-June 13
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CSFW.2001.93013214th IEEE Computer Security Foundatio ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Sylvan Pinsky, National Security Agency
Edward Zieglar, National Security Agency
Abstract: This paper reduces the satisfiability of noninterference to the solution of a finite set of equations. We use the structure of labelled transition systems, which are the basis for state machines and process algebras, to explicitly model the relationship between states, actions, and outputs. The output constraint equations are developed by constructing a predicate for nondeterministic systems and expressing noninterference as an invariance property of the predicate. The finiteness of the equations comes from a closure property of the predicate and the use of finite state machines.
Citation:
Sylvan Pinsky, Edward Zieglar, "Noninterference Equations for Nondeterministic Systems," csfw, pp.0003, 14th IEEE Computer Security Foundations Workshop (CSFW'01), 2001
Usage of this product signifies your acceptance of the Terms of Use.


Suggestions