Rule formats for non interference

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2618, Issue , 2003, Pages 129-143

  Tini, Simone ^a  

^a UNIVERSITY OF INSUBRIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

SEMANTICS;

NON INTERFERENCE; PROCESS ALGEBRAS; RULE FORMATS; TRANSITION RULE;

SYSTEMS ENGINEERING;

EID: 21144445349     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36575-3_10     Document Type: Article

References (18)

1. L. Aceto and W.J. Fokkink, editors, Special issue on process algebra, Information Processing Letters, 80, 2001.
2. L. Aceto, W.J. Fokkink, and C. Verhoef, Structural operational semantics, in J.A. Bergstra, A. Ponse, and S.A. Smolka, editors, Handbook of Process Algebra, Elsevier, Amsterdam, 2001, 197-292.
3. P.G. Allen, A comparison of non interference and non deducibility using CSP, Proc. IEEE Computer Security Foundation Workshop, IEEE Computer Society Press, 1991, 43-54.
4. D. Bell and L.J. La Padula, Secure computer systems: Unified exposition and multics interpretation, Technical report ESD-TR-75-301, MITRE MTR-2997, 1976.
5. B. Bloom, Structural operational semantics for weak bisimulation, Theoretical Computer Science, 146, 1995, 25-68.
6. R. Focardi and R. Gorrieri, A classification of security properties for process algebras, Journal of Computer Security, 3, 1995, 5-33.
7. R. Focardi and R. Gorrieri, The compositional security checker: A tool for the verification of information flow security properties, IEEE Transactions on Software Engineering, 23, 1997, 550-571.
8. R. Focardi and R. Gorrieri, Classification of security properties (Part I: Information flow), Foundations of Security Analysis and Design, Tutorial Lectures, Lecture Notes in Computer Science, 2171, Springer, Berlin, 2001, 331-396.
9. R. Focardi and S. Rossi, Information flow security in dynamic contexts, Proc. IEEE Computer Security Foundation Workshop, IEEE Computer Society Press, 2002, 307-319.
10. W.J. Fokkink, Rooted branching bisimulation as a congruence, Journal of Computer and System Sciences, 60, 2000, 13-37.
11. J.A. Goguen and J. Meseguer, Security policy and security models, Proc. IEEE Symposium on Security and Privacy, IEEE Computer Society Press, 1982, 11-20.
12. F. Martinelli, Partial model checking and theorem proving for ensuring security properties, Proc. IEEE Computer Security Foundation Workshop, IEEE Computer Society Press, 1998, 44-52.
13. R. Milner, Communication and concurrency, Prentice-Hall, London, 1989.
14. G. Plotkin, A structural approach to operational semantics, Technical report DAIMI FN-19, University of Aarhus, Denmark, 1981.
15. A.W. Roscoe, J.C.P. Woodcock, and L. Wulf, Non interference through determinism, Proc. European Symposium on Research in Computer Security, Lecture Notes in Computer Science, 875, Springer, Berlin, 1994, 33-53.
16. P.Y.A. Ryan, A CSP formulation of non-interference, Proc. IEEE Computer Security Foundation Workshop, IEEE Computer Society Press, 1990.
17. R. De Simone, Higher level synchronization devices in SCCS-Meije, Theoretical Computer Science, 37, 1985, 245-267.
18. I. Ulidowski and I. Phillips, Formats of ordered SOS rules with silent actions, Proc. Theory and Practice of Software Development, Lecture Notes in Computer Science, 1214, Springer, Berlin, 1997, 297-308.