Communicating sequential processes
Communicating sequential processes
The timed failures-stability model for CSP
Theoretical Computer Science
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
Non-Interference Through Determinism
ESORICS '94 Proceedings of the Third European Symposium on Research in Computer Security
Composing and decomposing systems under security properties
CSFW '95 Proceedings of the 8th 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
CSP and determinism in security modelling
SP '95 Proceedings of the 1995 IEEE Symposium on Security and Privacy
Discrete analysis of continuous behaviour in real-time concurrent systems
Discrete analysis of continuous behaviour in real-time concurrent systems
A Classification of Security Properties
A Classification of Security Properties
Timed CSP = closed timed ε-automata
Nordic Journal of Computing
Real-time information flow analysis
IEEE Journal on Selected Areas in Communications
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Information flow in systems with schedulers, Part I: Definitions
Theoretical Computer Science
| Hi-index | 0.00 |
Most previous work on information flow in process algebras has been based on untimed models of concurrency. It is obvious, however, that an observer might well use time to gain information about what a high-level user of the system is doing. We use the priority tock view (a discrete timed model) to extend several traditional untimed noninterference properties to the timed world. These are the determinism-based conditions of [14], [15] and [17], and Forster's local noninterference properties [6], [7].