A Congruence Format for Name-passing Calculi

Electronic Notes in Theoretical Computer Science

Volumn 156, Issue 1 SPEC. ISS., 2006, Pages 169-189

  Ziegler, Axelle ^a   Miller, Dale ^a   Palamidessi, Catuscia ^a  

^a INRIA   (France)

Author keywords

name binding; name mobility; open bisimulation; rule formats; Structural operational semantics

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; COMPUTER SCIENCE; COMPUTER SIMULATION; LOGIC PROGRAMMING; THEOREM PROVING;

NAME-BINDING; NAME-MOBILITY; OPEN BISIMULATION; RULE FORMATS; STRUCTURAL OPERATIONAL SEMANTICS;

SEMANTICS;

EID: 33646356452     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2005.09.032     Document Type: Article

References (33)

1. Abadi M., and Fournet C. Mobile values, new names, and secure communication. POPL '01: Proc. of the 28th Symposium on Principles of programming languages (2001), ACM Press 104-115
2. Boreale M., Buscemi M., and Montanari U. D-fusion: a distinctive fusion calculus. Proc. of APLAS04. LNCS volume 3302 (2004), Springer
3. Bernstein K.L. A congruence theorem for structured operational semantics of higher-order languages. In: Mitchell J. (Ed). Proceedings of LICS98 (June 1998), IEEE 153-163
4. Bloom B., Istrail S., and Meyer A.R. Bisimulation can't be traced. Journal of the ACM 42 1 (January 1995) 232-268 Preliminary version appeared in POPL 1988: 229-239
5. Church A. A formulation of the simple theory of types. Journal of Symbolic Logic 5 (1940) 56-68
6. Joëlle Despeyroux. A higher-order specification of the π-calculus. In Proc. of the IFIP International Conference on Theoretical Computer Science, Sendai, Japan, August 17-19, 2000., August 2000
7. Fiore M.P., Plotkin G.D., and Turi D. Abstract syntax and variable binding. 14th Annual Symposium on Logic in Computer Science (1999), IEEE Computer Society Press 193-202
8. Gabbay M.J., and Pitts A.M. A new approach to abstract syntax with variable binding. Formal Aspects of Computing 13 (2001) 341-363
9. Groote J.F., and Vaandrager F. Structured operational semantics and bisimulation as a congruence. Information and Computation 100 (1992) 202-260
10. Howe D.J. Proving congruence of bisimulation in functional programming languages. Information and Computation 124 2 (1996) 103-112
11. Mohammad Reza Mousavi, Murdoch J. Gabbay, and Michel A. Reniers. SOS for higher order precesses. In CONCUR'05: Concurrency Theory, 2005. To appear
12. Milner R. Communicating and Mobile Systems : The π-calculus (1999), Cambridge University Press
13. McDowell R., Miller D., and Palamidessi C. Encoding transition systems in sequent calculus. Theoretical Computer Science 294 3 (2003) 411-437
14. Dale Miller and Gopalan Nadathur. A logic programming approach to manipulating formulas and programs. In Seif Haridi, editor, IEEE Symposium on Logic Programming, pages 379-388, San Francisco, September 1987
15. Miller D., and Palamidessi C. Foundational aspects of syntax. In: Degano P., Gorrieri R., Marchetti-Spaccamela A., and Wegner P. (Eds). ACM Computing Surveys Symposium on Theoretical Computer Science: A Perspective, volume 31 (September 1999), ACM
16. Milner R., Parrow J., and Walker D. A calculus of mobile processes, Part I. Information and Computation 100 1 (September 1992) 1-40
17. Dale Miller and Alwen Tiu. A proof theory for generic judgments. ACM Trans. on Computational Logic, ed. Phokion Kolaitis. To appear., November 2003
18. Miller D., and Tiu A. A proof theory for generic judgments: An extended abstract. Proc. 18th IEEE Symposium on Logic in Computer Science (LICS 2003) (June 2003), IEEE 118-127
19. Momigliano A., and Tiu A. Induction and co-induction in sequent calculus. In: Berardi M.C.S., and Damiani F. (Eds). Post-proceedings of TYPES 2003. LNCS number 3085 (January 2003) 293-308
20. Parrow J. In: Bergstra, Ponse, and Smolka (Eds). Handbook of Process Algebra (2001), Elsevier 479-543
21. Pfenning F., and Elliott C. Higher-order abstract syntax. Proc. of the Conference on Programming Language Design and Implementation (June 1988), ACM Press 199-208
22. G. Plotkin. A structural approach to operational semantics. DAIMI FN-19, Aarhus University, Aarhus, Denmark, September 1981
23. Parrow J., and Victor B. The fusion calculus: Expressiveness and symmetry in mobile processes. Logic in Computer Science (1998) 176-185
24. Statman R. Logical relations and the typed λ-calculus. Information and Control 65 (1985) 85-97
25. Sangiorgi D., and Walker D. π-Calculus: A Theory of Mobile Processes (2001), Cambridge University Press
26. Thomsen B. Plain chocs: A second generation calculus for higher order processes. Acta Inf. 30 1 (1993) 1-59
27. Alwen Tiu. A Logical Framework for Reasoning about Logical Specifications. PhD thesis, Pennsylvania State University, May 2004
28. Alwen Tiu. Model checking for π-calculus using proof search. In CONCUR'05: Concurrency Theory, 2005. To appear
29. Alwen Tiu and Dale Miller. A proof search specification of the π-calculus. In 3rd Workshop on the Foundations of Global Ubiquitous Computing, September 2004
30. Alwen Tiu, Gopalan Nadathur, and Dale Miller. Mixing finite success and finite failure in an automated prover. Submitted, May 2005
31. Verhoef C. A congruence theorem for structured operational semantics with predicates and negative premises. Nordic J. of Computing 2 2 (1995) 274-302
32. Axelle Ziegler. Un format pour que la bisimulation soit une congruence dans les langages de processus avec mobilité. Technical report, ENS, 2004. Master Thesis
33. Axelle Ziegler, Dale Miller, and Catuscia Palamidessi. A congruence format for name-passing calculi. Technical report, LIX, Ecole Polytechnique, 2005. Available at http://www.lix.polytechnique.fr/parsifal/ziegler05report.pdf