Model checking for π-calculus using proof search

Lecture Notes in Computer Science

Volumn 3653, Issue , 2005, Pages 36-50

  Tiu, Alwen ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EIGENVALUES AND EIGENFUNCTIONS; ENCODING (SYMBOLS); FORMAL LOGIC; LOGIC PROGRAMMING; MATHEMATICAL MODELS; MODAL ANALYSIS; STATE SPACE METHODS;

MODEL CHECKING; PROOF SEARCH; TRANSITION SYSTEMS; Π-CALCULUS;

COMPUTATION THEORY;

EID: 27244450497     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11539452_7     Document Type: Conference Paper

References (27)

1. M. Abadi and A. D. Gordon. A calculus for cryptographic protocols: The spi calculus. Information and Computation, 148(1):1-70, 99.
2. L. Caries. Behavioral and spatial observations in a logic for the pi-calculus. In I. Walukiewicz, editor, Proc. of FoSSaCs 2004, 2004.
3. M. Dam. Model checking mobile processes. Inf. Comput., 129(1):35-51, 1996.
4. M. Dam. Proof systems for pi-calculus logics. Logic for concurrency and synchronisation, pages 145-212, 2003.
5. L.-H. Eriksson. A finitary version of the calculus of partial inductive definitions. Vol. 596 of LNAI, pages 89-134. Springer-Verlag, 1991.
6. G.-L. Ferrari, S. Gnesi, U. Montanari, and M. Pistore. A model-checking verification environment for mobile processes. ACM Trans. Softw. Eng. Methodol., 12(4):440-473, 2003.
7. M. J. Gabbay and A. M. Pitts. A new approach to abstract syntax with variable binding. Formal Aspects of Computing, 13:341-363, 2001.
8. J.-Y. Girard. A fixpoint theorem in linear logic. Email to the linear@cs.stanford.edu mailing list, February 1992.
9. G. Huet. A unification algorithm for typed λ-calculus. Theoretical Computer Science, 1:27-57, 1975.
10. R. McDowell and D. Miller. Cut-elimination for a logic with definitions and induction. Theoretical Computer Science, 232:91-119, 2000.
11. R. McDowell, D. Miller, and C. Palamidessi. Encoding transition systems in sequent calculus. Theoretical Computer Science, 294(3):411-437, 2003.
12. D. Miller. A logic programming language with lambda-abstraction, function variables, and simple unification. Vol. 475 of LNAI, pp. 253-281. Springer, 1991.
13. D. Miller. Unification under a mixed prefix. J. of Symboluc Computation, 14(4):321-358, 1992.
14. D. Miller and C. Palamidessi. Foundational aspects of syntax. ACM Comp. Surveys Symp. on Theoretical Computer Science: A Perspective, vol. 31. ACM, 1999.
15. D. Miller and A. Tiu. A proof theory for generic judgments: An extended abstract. In Proc. of LICS 2003, pages 118-127. IEEE, June 2003.
16. R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, Part II. Information and Computation, pages 41-77, 1992.
17. R. Milner, J. Parrow, and D. Walker. Modal logics for mobile processes. Theoretical Computer Science, 114(1):149-171, 1993.
18. T. Nipkow. Functional unification of higher-order patterns. In M. Vardi, editor, Proc. of LICS'93, pages 64-74. IEEE, June 1993.
19. B. Pientka. Tabled Higher-Order Logic Programming. PhD thesis, Carnegie Mellon University, December 2003.
20. Y. S. Ramakrishna, C. R. Ramakrishnan, I. V. Ramakrishnan, S. A. Smolka, T. Swift, and D. S. Warren. Efficient model checking using tabled resolution. In Proc. of CAV97, vol. 1254 of LNCS, pages 143-154, 1997.
21. D. Sangiorgi and D. Walker. π-Calculus: A Theory of Mobile Processes. Cambridge University Press, 2001.
22. P. Schroeder-Heister. Rules of definitional reflection. In M. Vardi, editor, Proc. of LICS'93, pages 222-232. IEEE, June 1993.
23. R. F. Stärk. Cut-property and negation as failure. International Journal of Foundations of Computer Science, 5(2):129-164, 1994.
24. A. Tiu. Level 0/1 Prover: A tutorial, September 2004. Available online.
25. A. Tiu. A Logical Framework for Reasoning about Logical Specifications. PhD thesis, Pennsylvania State University, May 2004.
26. A. Tiu and D. Miller. A proof search specification of the π-calculus. In 3rd Workshop on the Foundations of Global Ubiquitous Computing, Sept. 2004.
27. P. Yang, C. Ramakrishnan, and S. Smolka. A logical encoding of the π-calculus: model checking mobile processes using tabled resolution. International Journal on Software Tools for Technology Transfer (STTT), 6(1):38-66, July 2004.