Information flow security and recursive systems

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

Volumn 2841, Issue , 2003, Pages 369-382

  Bossi, Annalisa ^a   Macedonio, Damiano ^a   Piazza, Carla ^a   Rossi, Sabina ^a  

^a CA' FOSCARI UNIVERSITY OF VENICE   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

COMPOSITIONALITY; DYNAMIC CONTEXTS; HIGH-LEVEL INFORMATION; INFORMATION FLOW SECURITY; MULTI-LEVEL SYSTEMS; PROOF SYSTEM;

SECURITY OF DATA;

EID: 0142218855     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45208-9_29     Document Type: Article

References (26)

1. M. Abadi and L. Lamport. Conjoining Specifications. ACM Transactions on Programming Languages and Systems (TOPLAS), 17(3):507-535, May 1995.
2. C. Bodei, P. Degano, F. Nielson, and H. Nielson. Static Analysis for the π-calculus with Applications to Security. Information and Computation, 168(1):68-92, 2001.
3. A. Bossi, R. Focardi, C. Piazza, and S. Rossi. Transforming Processes to Ensure and Check Information Flow Security. In H. Kirchner and C. Ringeissen, editors, Int. Conference on Algebraic Methodology and Software Technology (AMAST'02), volume 2422 of LNCS, pages 271-286. Springer-Verlag, 2002.
4. A. Bossi, R. Focardi, C. Piazza, and S. Rossi. A Proof System for Information Flow Security. In M. Leuschel, editor, Logic Based Program Development and Transformation, volume 2664 of LNCS. Springer-Verlag, 2003. To appear.
5. A. Bossi, D. Macedonio, C. Piazza, and S. Rossi. P-BNDC and Replication. Technical Report CS-2003-6, Dipartimento di Informatica, Università Ca' Foscari di Venezia, Italy, 2003. http://www.dsi.unive.it/ricerca/TR/index.htm.
6. C. Braghin, A. Cortesi, and R. Focardi. Control Flow Analysis of Mobile Ambients with Security Boundaries. In Proc. Int. Conference on Formal Methods for Open Object-Based Distributed Systems (IFIPM'02), pages 197-212. Kluwer, 2002.
7. N. Busi, M. Gabbrielli, and G. Zavattaro. Replication vs. Recursive Definitions in Channel Based Calculi. In Proc. of Int. Colloquium on Automata, Languages and Programming (ICALP'03). LNCS, 2003. To appear.
8. McCullough. D. A Hookup Theorem for Multilevel Security. IEEE Transactions on Software Engineering, 16(6):563-568, 1990.
9. R. Focardi and R. Gorrieri. Classification of Security Properties (Part I: Information Flow). In R. Focardi and R. Gorrieri, editors, Foundations of Security Analysis and Design, volume 2171 of LNCS. Springer-Verlag, 2001.
10. R. Focardi, R. Gorrieri, and F. Martinelli. Non Interference for the Analysis of Cryptographic Protocols. In U. Montanari, J. D. P. Rolim, and E. Welzl, editors, Proc. of Int. Colloquium on Automata, Languages and Programming (ICALP'00), volume 1853 of LNCS, pages 744-755. Springer-Verlag, 2000.
11. R. Focardi and S. Rossi. Information Flow Security in Dynamic Contexts. In Proc. of the IEEE Computer Security Foundations Workshop (CSFW'02), pages 307-319. IEEE Comp. Soc. Press, 2002.
12. S. N. Foley. A Universal Theory of Information Flow. In Proc. of the IEEE Symposium on Security and Privacy, pages 116-122. IEEE Comp. Soc. Press, 1987.
13. J. A. Goguen and J. Meseguer. Security Policies and Security Models. In Proc. of the IEEE Symposium on Security and Privacy, pages 11-20. IEEE Comp. Soc. Press, 1982.
14. M. Hennessy and J. Riely. Information Flow vs. Resource Access in the Asynchronous Pi-calculus. ACM Transactions on Programming Languages and Systems (TOPLAS), 24(5):566-591, 2002.
15. H. Mantel. On the Composition of Secure Systems. In Proc. of the IEEE Symposium on Security and Privacy, pages 88-101. IEEE Comp. Soc. Press, 2002.
16. F. Martinelli. Partial Model Checking and Theorem Proving for Ensuring Security Properties. In Proc. of the IEEE Computer Security Foundations Workshop (CSFW'98), pages 44-52. IEEE Comp. Soc. Press, 1998.
17. J. McLean. Security Models and Information Flow. In Proc. of the IEEE Symposium on Security and Privacy, pages 180-187. IEEE Comp. Soc. Press, 1990.
18. J. McLean. A General Theory of Composition for a Class of "Possibilistic" Security Properties. IEEE Transactions on Software Engineering, 22(1):53-67, 1996.
19. R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
20. R. Milner. The Polyadic Pi-calculus: a tutorial. In F. L. Bauer, W. Brauer, and H. Schwichtenberg, editors, Logic and Algebra of Specification, pages 203-246. Springer-Verlag, 1993.
21. P. Ryan and S. Schneider. Process Algebra and Non-interference. Journal of Computer Security, 9(1/2):75-103, 2001.
22. A. Sabelfeld and A. C. Myers. Language-Based Information-Flow Security. IEEE Journal on Selected Areas in Communication, 21(1):5-19, 2003.
23. A. Sabelfeld and D. Sands. Probabilistic Noninterference for Multi-threaded Programs. In Proc. of the IEEE Computer Security Foundations Workshop (CSFW'00), pages 200-215. IEEE Comp. Soc. Press, 2000.
24. D. Sangiorgi and D. Walker. The π-calculus. Cambridge University Press, 2001.
25. J. Widom, D. Gries, and F. B. Schneider. Trace-based Network Proof Systems: Expressiveness and Completeness. ACM Transactions on Programming Languages and Systems (TOPLAS), 14(3):396-416, 1992.
26. A. Zakinthinos and E. S. Lee. A General Theory of Security Properties. In Proc. of the IEEE Symposium on Security and Privacy, pages 74-102. IEEE Comp. Soc. Press, 1997.