Communicating sequential processes
Communicating sequential processes
The foundations of program verification (2nd ed.)
The foundations of program verification (2nd ed.)
Algebraic theory of processes
A classical mind
Temporal verification of reactive systems: safety
Temporal verification of reactive systems: safety
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
Introduction to Process Algebra
Introduction to Process Algebra
Information Flow Control and Applications - Bridging a Gap
FME '01 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods for Increasing Software Productivity
The security checker: a semantics-based tool for the verification of security properties
CSFW '95 Proceedings of the 8th IEEE workshop on Computer Security Foundations
Process Algebra and Non-interference
CSFW '99 Proceedings of the 12th IEEE workshop on Computer Security Foundations
What is Intransitive Noninterference?
CSFW '99 Proceedings of the 12th IEEE workshop on Computer Security Foundations
Information Flow Analysis in a Discrete-Time Process Algebra
CSFW '00 Proceedings of the 13th IEEE workshop on Computer Security Foundations
A General Theory of Composition for Trace Sets Closed under Selective Interleaving Functions
SP '94 Proceedings of the 1994 IEEE Symposium on Security and Privacy
CSP and determinism in security modelling
SP '95 Proceedings of the 1995 IEEE Symposium on Security and Privacy
Absorbing covers and intransitive non-interference
SP '95 Proceedings of the 1995 IEEE Symposium on Security and Privacy
A general theory of security properties
SP '97 Proceedings of the 1997 IEEE Symposium on Security and Privacy
Algebraic structure theory of sequential machines (Prentice-Hall international series in applied mathematics)
Sequential Machines: Selected Papers
Sequential Machines: Selected Papers
Finite automata and their decision problems
IBM Journal of Research and Development
A domain equation for bisimulation
Information and Computation
Mathematical Models of Computer Security
FOSAD '00 Revised versions of lectures given during the IFIP WG 1.7 International School on Foundations of Security Analysis and Design on Foundations of Security Analysis and Design: Tutorial Lectures
On intransitive non-interference in some models of concurrency
Foundations of security analysis and design VI
| Hi-index | 0.00 |
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.