Control flow analysis for the π-calculus

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

Volumn 1466, Issue , 1998, Pages 84-98

  Bodei, Chiara ^a   Degano, Pierpaolo ^a   Nielson, Flemming ^b   Nielson, Hanne Riis ^b  

^a UNIVERSITY OF PISA   (Italy)

^b AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

BINDERS;

CONTROL FLOW ANALYSIS; PI CALCULUS; RUNTIMES; SECURITY PROPERTIES; STATIC TECHNIQUES;

CALCULATIONS;

EID: 84945976575     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0055617     Document Type: Conference Paper

References (20)

1. M. Abadi. Secrecy by typing in security protocols. In Proceedings of Theoretical Aspects of Computer Software, Third International Symposiuoum, LNCS 1281, pages 611-638. Springer-Verlag, 1997.
2. R.M. Amadio. An asynchronous model of locality, failure, and process mobility. In Proceedings of COORDINATION’97, LNCS 1282. Springer-Verlag, 1997.
3. D.E. Bell and L.J. La Padula. Secure computer systems: Unified exposition and multics interpretation. Technical Report ESD-TR-75-306, Mitre C., 1976.
4. M. Dam. Proving trust in systems of second-order processes: Preliminary results. Technical Report LOMAPS-SICS 19, SICS, Sweden, 1997.
5. R. De Nicola, G. Ferrari, and R. Pugliese. Coordinating mobile agents via blackboards and access rights. In Proceedings of COORDINATION’97, LNCS 1282. Springer-Verlag, 1997.
6. th IEEE Computer Science Security Foundation W/S, pages 116-122, 1996.
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. To appear.
8. C. Fournet, C. Laneve, L. Maranget, and D. Remy. Implicit typing à la ML for the join calculus. In Proceedings of CONCUR’97, LNCS. Springer-Verlag, 1997.
9. K.L.S. Gasser, F. Nielson, and H.R. Nielson. Systematic realisation of control flow analysis for CML. In Proceedings of ICFP’97, pages 38-51. ACM Press, 1997.
10. J.A. Goguen and J. Meseguer. Security policy and security models. In Proceedings of the 1982 IEEE Symposioum on Security and Privacy, pages 11-20, 1982.
11. T.J. Marlowe and B.J. Ryder. Properties of data flow frameworks-a unified model. Acta Informatica, 28(2):121-163, 1990.
12. R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes (I and II). Information and Computation, 100(1):1-77, 1992.
13. R. Milner, J. Parrow, and D. Walker. Modal logics for mobile processes. TCS, 114:149-171, 1993.
14. J. Palsberg and M.J. Schwartzbach. Object-Oriented Type Systems. Wiley, 1994.
15. B.C. Pierce and D. Sangiorgi. Typing and sub-typing for mobile processes. Mathematical Structures in Computer Science, 6(5):409-454, 1996.
16. J. Riely and M. Hennessy. A typed language for distributed mobile processes. In Proceedings of POPL '98. ACM Press, 1998.
17. P. Sewell. Global/local subtyping for a distributed π-calculus. Technical Report 435, Computer Laboratory, University of Cambridge, 1997.
18. O. Shivers. Control flow analysis in Scheme. In Proceedings of PLDI’88, volume 7(1). ACM SIGPLAN Notices, 1988.
19. A. Venet. Abstract interpretation of the π-calculus. In Analysis and Verification of Multiple-Agent Languages, LNCS, volume 1192. Springer-Verlag, 1997.
20. D. Volpano, G. Smith, and C. Irvine. A sound type system for secure flow analysis. Journal of Computer Security, 4:4-21, 1996.