Abstract interpretation of the π-Calculus

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

Volumn 1192 LNCS, Issue , 1997, Pages 51-75

  Venet, Arnaud ^a  

^a ÉCOLE POLYTECHNIQUE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACT DOMAINS; ABSTRACT INTERPRETATIONS; AUTOMATIC INFERENCE; COMMUNICATION TOPOLOGIES; MOBILE PROCESS; NON-UNIFORM DISTRIBUTION; WIDENING OPERATORS;

CALCULATIONS;

ABSTRACTING;

EID: 84878643881     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-62503-8_3     Document Type: Conference Paper

References (27)

1. G. Berry and G. Boudol. The chemical abstract machine. Theoretical Computer Science, 96:217-248, 1992.
2. G. Boudol, I. Castellani, M. Hennessy, and A Kiehn. A theory of processes with localities. Formal Aspects of Computing, 6(2): 165-200, 1994.
3. M. Barr and C. Wells. Category Theory for Computing Science. Prentice Hall, 1990.
4. nd International Symposium on Programming, pages 106-130, Paris, 1976. Dunod.
5. th ACM Symposium on Principles of Programming Languages, pages 238-252, Los Angeles, California, U.S.A., 1977.
6. P. Cousot and R. Cousot. Abstract interpretation frameworks. Journal of logic and computation, 2(4):511-547, August 1992.
7. P. Cousot and R. Cousot. Compositional and inductive semantic definitions in fixpoint, equational, constraint, closure-condition, rule-based and game theoretic form. In Conference on Computer-Aided Verification, 7th International Conference, CAV'95, volume 939 of Lecture Notes in Computer Science, pages 293-308. Springer-Verlag, 1995. Invited paper.
8. th POPL. ACM Press, 1978.
9. C. Colby. Analyzing the communication topology of concurrent programs. In Symposium on Partial Evaluation and Program Manipulation, 1995.
10. C. Colby. Determining storage properties of sequential and concurrent programs with assignment and structured data. In Proceedings of the Second International Static Analysis Symposium, volume 983 of Lecture Notes in Computer Science, pages 64-81. Springer-Verlag, 1995.
11. A. Deutsch. Operational models of programming languages and representations of relations on regular languages with application to the static determination of dynamic aliasing properties of data. PhD thesis, University Paris VI (Prance), 1992.
12. A. Deutsch. A storeless model of aliasing and its abstraction using finite representations of right-regular equivalence relations. In Proceedings of the 1992 International Conference on Computer Languages, pages 2-13. IEEE Computer Society Press, Los Alamitos, California, U.S.A., 1992. (Pubitemid 23555955)
13. A. Deutsch. Interprocedural may-alias analysis for pointers: beyond It-limiting. In ACM SIGPLAN'94 Conference on Programming Language Design and Implementation. ACM Press, 1994.
14. P. Granger. Static analysis of arithmetical congruences. International Journal of Computer Mathematics, 30:165-190, 1989.
15. P. Granger. Static analysis of linear congruence equalities among variables of a program. In TAPSOFT'91, volume 493. Lecture Notes in Computer Science, 1991.
16. A. Habel. Hyperedge replacement: grammars and languages, volume 643 of Lecture Notes in Computer Science. Springer-Verlag, 1992.
17. N. Jones and S. Muchnick. Flow analysis and optimization of lisp-like structures. In Program Flow Analysis: Theory and Applications, pages 102-131. Prentice Hall, 1981.
18. H.B.M Jonkers. Abstract storage structures. In De Bakker and Van Vliet, editors, Algorithmic languages, pages 321-343. IFIP, 1981.
19. M. Karr. Affine relationships among variables of a program. Acta Infor-matica, pages 133-151, 1976.
20. R. Milner. The polyadic π-calculus: a tutorial. In Proceedings of the International Summer School on Logic and Algebra of Specification. Springer Verlag, 1991.
21. R. Milner. Functions as processes. Journal of Mathematical Structures in Computer Science, 2, 1992.
22. R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes. Information and Computation, 100:1 - 77, 1992.
23. st ACM Symposium on Principles of Programming Languages, 1994.
24. D. Sangiorgi. Expressing mobility in process algebras: first-order and higherorder paradigms. PhD thesis, University of Edinburgh, 1994.
25. D. Sangiorgi. Locality and true-concurrency in calculi for mobile processes. In International Symposium on Theoretical Aspects of Computer Software, Lecture Notes in Computer Science, 1994.
26. D. N. Turner. The Polymorphic Pi-Calculus: Theory and Implementation. PhD thesis, Edinburgh University, 1995.
27. A. Venet. Abstract cofibered domains: Application to the alias analysis of untyped programs. In Proc. of the Third International Static Analysis Symposium SAS'96, volume 1145 of Lecture Notes in Computer Science, pages 366-382. Springer-Verlag, 1996. (Pubitemid 126129178)