A logical encoding of the π-calculus: Model checking mobile processes using tabled resolution

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

Volumn 2575, Issue , 2003, Pages 116-131

  Yang, Ping ^a   Ramakrishnan, C R ^a   Smolka, Scott A ^a  

^a Stony Brook University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; COMPUTER PROGRAMMING; ENCODING (SYMBOLS); LOGIC PROGRAMMING; SEMANTICS; VIRTUAL ADDRESSES;

DYNAMIC GENERATION; EFFICIENT IMPLEMENTATION; EXTRUSION AND INTRUSION; LOGIC PROGRAMMING SYSTEMS; LOGICAL ENCODING; MOBILE SYSTEMS; PROCESS EXPRESSION; TABLED RESOLUTION;

MODEL CHECKING;

EID: 21144445192     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36384-x_12     Document Type: Article

References (32)

1. ∼lmc/mmc.
2. M. Abadi and B. Blanchet. Analyzing security protocols with secrecy types and logic programs. In Proceedings of POPL'02, pages 33-44, Jan. 2002.
3. M. Abadi and A. D. Gordon. A calculus for cryptographic protocols: The spi calculus. In Fourth ACM Conference on CCS, pages 36-47. ACM Press, 1997.
4. B. Aziz and G.W. Hamilton. A privacy analysis for the pi-calculus: The denotational approach. In Proceedings of the 2nd Workshop on the Specification, Analysis and Validation for Emerging Technologies, Copenhagen, Denmark, July 2002.
5. S. Basu, M. Mukund, C. R. Ramakrishnan, I. V. Ramakrishnan, and R. M. Verma. Local and symbolic bisimulation using tabled constraint logic programming. In International Conference on Logic Programming, pages 166-180, 2001.
6. F. B. Beste. The model prover - a sequent-calculus based modal μ-calculus model checker tool for finite control π-calculus agents. Technical report, Swedish Institute of Computer Science, 1998.
7. B. Blanchet. From secrecy to authenticity in security protocols. In 9th International Static Analysis Symposium, pages 242-259, September 2002.
8. M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Mart́i-Oliet, J. Meseguer, and J. Quesada. Maude: Specification and programming in rewriting logic. Theoretical Computer Science, 2001.
9. B. Cui and D. S. Warren. A system for tabled constraint logic programming. In First International Conference on Computational Logic, pages 478-492, 2000.
10. M. Dam. Proof systems for pi-calculus logics. Logic for Concurrency and Synchronisation, 2001.
11. G. Denker and J. Meseguer. Protocol specification and analysis in Maude. In Proc. of Workshop on Formal Methods and Security Protocols, June 1998.
12. Y. Dong and C.R. Ramakrishnan. An optimizing compiler for efficient model checking. In Proceedings of FORTE/PSTV '99, 1999.
13. F. Duran, S. Eker, P. Lincoln, and J. Meseguer. Principles of mobile maude. In Proc. ASA/MA, volume 1882, pages 73-85. Springer-Verlag, 2000.
14. T. Franzen. A theorem-proving approach to deciding properties of finite-control agents. Technical report, Swedish Institute of Computer Science, 1996.
15. A. Gordon and A.S.A. Jeffrey. Authenticity by typing for security protocols. In IEEE Computer Security Foundations Workshop, 2001.
16. H. Lin. Symbolic bisimulation and proof systems for the π-calculus. Technical report, School of Cognitive and Computer Science, U. of Sussex, UK, 1994.
17. G. Lowe. An attack on the Needham-Schroeder public-key authentication protocol. Information Processing Letters, pages 131-133, 1995.
18. G. Lowe. Breaking and fixing the Needham-Schroeder public-key protocol using FDR. Software Concepts and Tools, 17:93-102, 1996.
19. C. Meadows. The NRL protocol analyzer: an overview. Journal of Logic Programming, 26(2):113-131, 1996.
20. R. Milner. Communication and Concurrency. International Series in Computer Science. Prentice Hall, 1989.
21. R. Milner. The polyadic π-calculus: a tutorial. The Proceedings of the International Summer School on Logic and Algebra of Specification, 1991.
22. R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, Parts I and II. Information and Computation, 100(1):1-77, 1992.
23. R. Milner, J. Parrow, and D. Walker. Modal logics for mobile processes. Theoretical Computer Science, pages 149-171, 1993.
24. F. Orava and J. Parrow. An algebraic verification of a mobile network. Formal Aspects of Computing, 4:497-543, 1992.
25. J. Parrow. An introduction to the π-calculus. In Bergstra, Ponse, and Smolka, editors, Handbook of Process Algebra. Elsevier, 2001.
26. Y. S. Ramakrishna, C. R. Ramakrishnan, I. V. Ramakrishnan, S. A. Smolka, T. W. Swift, and D. S. Warren. Efficient model checking using tabled resolution. In Proceedings of CAV '97, Haifa, Israel, July 1997.
27. A. Roychoudhury, K. Narayan Kumar, C.R. Ramakrishnan, I.V. Ramakrishnan, and S.A. Smolka. Verification of parameterized systems using logic-program transformations. In Proceedings of TACAS 2000, 2000.
28. C. Stirling and D. Walker. Local model checking in the modal mu-calculus. Theoretical Computer Science, pages 161-177, 1991.
29. P. Thati, K. Sen, and N. Marti-oliet. An executable specification of asynchronous pi-calculus semantics and may testing in Maude 2.0. In Intl. Workshop on Rewriting Logic and its Applications, 2002.
30. B. Victor. The mobility workbench user's guide. Technical report, Department of Computer Systems, Uppsala University, Sweden, 1995.
31. B. Victor and F. Moller. The mobility workbench - a tool for the π-calculus. In D. Dill, editor, Proceedings of CAV'94. Springer-Verlag, 1994.
32. XSB. The XSB logic programming system v2.4, 2001. Available from http://xsb.sourceforge.net.