Noninterference equations for nondeterministic systems

Proceedings of the Computer Security Foundations Workshop

Volumn , Issue , 2001, Pages 3-14

  Pinsky, Sylvan ^a   Zieglar, Edward ^a  

^a NATIONAL SECURITY AGENCY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; CONSTRAINT THEORY; INVARIANCE; MATHEMATICAL MODELS; SECURITY OF DATA; THEOREM PROVING;

BASIS SETS;

FINITE AUTOMATA;

EID: 0034822318     PISSN: 10636900     EISSN: None     Source Type: Journal    
DOI: 10.1109/CSFW.2001.930132     Document Type: Article

References (44)

1. A domain equation for bisimulation
2. Solving reflexive domain equations in a category of complete metric spaces
3. A practical alternative to hierarchical integrity policies
4. Processes and the denotational semantics of concurrency
5. Constructively using noninterference to analyze systems
6. Noninterference and the unwinding for LOCK
7. A classification of security policies for process algebras
8. Information flow analysis in a discrete-time process algebra
9. The security checker: A semanitics-based tool for the verification of security properties
10. Introduction to process algebra
11. Power simulation and its relation to failure refinement
12. Security policies and security models
13. Inference control and unwinding
14. Extending the noninterference version of MLS for SAT
15. Algebraic structure theory of sequential machines
16. Algebraic theory of process
17. Introduction to automata theory, languages, and computation
18. Security specifications
19. Security and the composition of machines
20. Security properties consistent with the testing semantics for communicating processes
21. Elements of the theory of computation
22. The foundations of program verification
23. Information flow control and applications - Bridging the gap
24. Specification for multilevel security and a hook-up property
25. Noninterference and the composability of security properties
26. A general theory of composition for trace sets closed under selective interleaving functions
27. A method for synthesizing sequential circuits
28. A classical approach to noninterference type problems
29. Foundations of Ulysses: The theory of security
30. Absorbing covers and intransitive non-interference
31. Finite automata and their decision problems
32. Model-checking CSP
33. CSP and determinism in security modeling
34. What is intransitive noninterference?
35. A CSP formulation of non-interference
36. Process algebra and non-interference
37. Information flow in nondeterministic systems
38. A state-based approach to noninterference
39. A general theory of security properties