A classification of security properties for process algebras1

Journal of Computer Security

Volumn 3, Issue 1, 1995, Pages 5-33

  Focardi, Riccardo ^a   Gomeri, Roberto ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84974776068     PISSN: 0926227X     EISSN: None     Source Type: Journal    
DOI: 10.3233/JCS-1994/1995-3103     Document Type: Article

References (32)

1. P. G. Allen. “A Comparison of Non-Interference and Non-Deducibility using CSP”. In Proceeding of the Fourth Workshop on the Foundations of Computer Security, pages 43-54, Franconia, New Hampshire, June 1991.
2. J. C. M. Baeten and W.P. Weijland. Process Algebra. Cambrige University Press, 1985. Cambrige Tracts in Theoretical Computer Science 18.
3. P. Bieber and F. Cuppens. “A Logical View of Secure Dependencies”. Journal of Computer Security, 1 (1):99-129, 1992.
4. G. Boudol, I. Castellani, M. Hennessy, and A. Kiehn. “A Theory of Processes with Localities”. In Proceedings Concur 92, pages 108-122. Springer-Verlag LNCS 630, 1992.
5. R. Cleaveland, J. Parrow, and B. Steffen. “The Concurrency Workbench: A Semantics Based Tool for the Verification of Concurrent Systems”. ACM Transactions on Programming Languages and Systems, Vol. 15 No, 1:36-72, January 1993.
6. P. Darondeau and P. Degano. “Causal trees: Interleaving + causality”. In Proceedings LITP Spring School on Semantic of Systems of Concurrent Processes, pages 239-255. Lecture Notes in Computer Science, Vol. 469, Springer, Berlin, 1990.
7. R. Focardi and R. Gorrieri. “An Information Flow Security Property for CCS”. In Proceeding of the Second North American Process Algebra Workshop (NAPAW’93), 93-1369, Cornell (Ithaca), August 1993.
8. R. Focardi, R. Gorrieri, and V. Panini. “The Security Checker: A Semantics Based Tool for the Verification of Security Properties”. Forthcoming.
9. S. N. Foley. “Understanding Information Flow in Systems”. Unpublished manuscript, December 1989.
10. J. A. Goguen and J. Meseguer. “Security Policy and Security Models”. In Proceedings of the 1982 Symposium on Security and Privacy, pages 11-20. IEEE Computer Society Press, April 1982.
11. R. Gorrieri, M. Roccetti, and E. Stancampiano. “A Theory of Processes with Durational Actions”. Theoretical Computer Science, 140, April 1995.
12. J. Graham-Cumming. “Laws of Non-Interference in CSP”. Journal of Computer Security, 2:37-52, 1993.
13. J. Guttman and M. Nadel. “What Needs Securing. In Proc. Computer Security Foundations Workshop, pages 34-57, Franconia, New Hampshire, June 1988.
14. M. Hennessy. Algebraic Theory of Processes. The MIT Press, 1988
15. C. A. R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985.
16. J. W. Gray HI. “Toward a Mathematical Foundation for Information Flow Security”. Journal of Computer 5ec«rtfy, 1:255-294, 1992.
17. D. M. Johnson and F. J. Thayer. “Security and the Composition of Machines”. In Proceedings of the Computer Security Foundations Workshop, pages 72-89, June 1988.
18. R. Keller. “Formal Verification of Parallel Programs”. Communications of the ACM, 19 (7):561-572, 1976.
19. L. G. Marcus. “Proving Varieties of Information Flow Security”. Technical Report ATR-90 (5778)-3, The Aerospace Corporation, El Segundo, California, 1990.
20. D. McCullough. “Covert Channels and Degrees of Insecurity”. In Proceedings of the First Computer Security Foundations Workshop, pages 1-33, June 1988.
21. D. McCullough. “Noninterference and the Composability of Security Properties”. In Proceedings, 1988 IEEE Symposium on -Security and Privacy, pages 177-186. IEEE Computer Society Press, April 1988.
22. D. McCullough. “A Hookup Theorem for Multilevel Security”. IEEE Transactions on Software Engineering, pages 563-568, June 1990.
23. J. McLean. “Security Models”, in the Encyclopedia of Software Engineering, Wiley, in press.
24. J. McLean. “A General Theory of Composition for Trace Sets Closed Under Selective Interleaving Functions”, In Proceeding of the 1994 IEEE Symposium on Research in Security and Privacy. IEEE Computer Society Press, 1994.
25. J. K. Millen. “Hookup Security for Synchronous Machines”. In Proceedings of the Third Computer Security Foundation Workshop III. IEEE Computer Society Press, 1990.
26. R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
27. I. S. Moskowitz and O. L. Costich. “A Classical Automata Approach to Noninterference Type Problems”. In Proceedings of the Fifth Workshop on the Foundations of Computer Security, pages 2-8, Franconia, New Hampshire, June 1992.
28. Department of Defense. “Integrity in Automated Information Systems”. Technical Report C 79-91, National Computer Security Center, September 1991.
29. C. O’Halloran. “A Calculus of Information Flow”. In Proceedings ESORICS, 1990.
30. J. Rushby. “Design and Verification of Secure Systems”. In Proceedings of the Eighth Symposium on Operating Systems Principles. ACM, 1981.
31. D. Sutherland. “A Model of Information”. In Proceedings of the 9th National Computer Security Conference, pages 175-183. National Bureau of Standards and National Computer Security Center, September 1986.
32. J. T. Wittbold and D. M. Johnson. “Information Flow in Nondeterministic Systems”. In Proceedings of the 1990 IEEE Symposium on Research in Security and Privacy, pages 144-161. IEEE Computer Society Press, 1990.