Parameterized verification of π-calculus systems

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

Volumn 3920 LNCS, Issue , 2006, Pages 42-47

  Yang, Ping ^a   Basu, Samik ^b   Ramakrishnan, C R ^a  

^a Stony Brook University   (United States)

^b Iowa State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; FORMAL LOGIC; MATHEMATICAL OPERATORS; OPTIMIZATION; PARAMETER ESTIMATION;

DEADLOCKED PROCESS; N-PROCESS SYSTEM; PARAMETERIZED VERIFICATION; PROPERTY LANGUAGE;

COMPUTER SYSTEMS;

EID: 33745803228     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11691372_3     Document Type: Conference Paper

References (38)

1. R. Alur and T. Henzinger. Reactive modules. In LICS, 1996.
2. R. Alur, P. Madhusudan, and W. Nam. Symbolic compositional verification by learning assumptions. In CAV, pages 548-562, 2005.
3. H.R. Andersen. Partial model checking (extended abstract). In LICS, 1995.
4. H.R. Andersen, C. Stirling, and G. Winskel. A compositional proof system for the modal mu-calculus. In LICS, 1994.
5. T. Arons, A. Pnueli, S. Ruah, J. Xu, and L. Zuck. Parameterized verification with automatically computed inductive assertions. In Computer Aided Verification, 2001.
6. S. Basu and C. R. Ramakrishnan. Compositional analysis for verification of parameterized systems. In Proceedings of TACAS, pages 315-330, 2003.
7. S. Berezin and D. Gurov. A compositional proof system for the modal mu-calculus and CCS. Technical Report CMU-CS-97-105, CMU, 1997.
8. J. Bradfield and C. Stirling. Modal logics and mu-calculi: an introduction (In the Handbook of Process Algebra), pages 293-330. Elsevier, 2001.
9. S. Chaki, S.K.Rajamani, and J. Rehof. Types as models: model checking message-passing programs. In Proceedings of POPL, pages 45 - 57, 2002.
10. E. M. Clarke, O. Grumberg, and S. Jha. Verifying parameterized networks. ACM Transactions on Programming Languages and Systems, 1997.
11. M. Dam. Proof systems for pi-calculus logics. Logic for Concurrency and Synchronisation, 2001.
12. G. Delzanno. Automatic verification of parameterized cache coherence protocols. In Computer Aided Verification, 2000.
13. E.A. Emerson and K.S. Namjoshi. Reasoning about rings. In POPL, 1995.
14. E.A. Emerson and K.S. Namjoshi. Automated verification of parameterized synchronous systems. In Computer Aided Verification. Lecture Notes in Computer Science, 1996.
15. E.A. Emerson and K.S. Namjoshi. On model checking for non-deterministic infinite state systems. In LICS, 1998.
16. J. Esparza, A. Finkel, and R. Mayr. On the verification of broadcast protocols. In LICS, 1999.
17. R. Cleaveland G. Bhat. Efficient model checking via the equational μ-calculus. In LICS, pages 304-312, 1996.
18. O. Grumberg and D.E. Long. Model checking and modular verification. ACM Transactions on Programming Languages and Systems, 1994.
19. T. Henzinger, S. Qadeer, and S.K. Rajamani. You assume, we guarantee. In CAV, 1998.
20. G. J. Holzmann. The model checker SPIN. IEEE Transactions on Software Engineering, 23(5):279-295, May 1997.
21. A. Igarashi and N. Kobayashi. A generic type system for the pi-calculus. Theoretical Computer Science, 311(1-3):121-163, 2004.
22. C.N. Ip and D.L. Dill. Verifying systems with replicated components in murphi. Formal Methods in System Design, 1999.
23. Y. Kesten and A. Pnueli. Control and data abstraction:the cornerstones of pratical formal verification. International Journal on Software tools for Technology, 2000.
24. D. Kozen. Results on the propositional μ-calculus. Theoretical Computer Science, 1983.
25. H. Lin. Symbolic bisimulation and proof systems for the π-calculus. Technical report, School of Cognitive and Computer Science, U. of Sussex, UK, 1994.
26. K.L. McMillan. Compositional rule for hardware design refinement. In CAV, 1997.
27. R. Milner. Communication and Concurrency. Prentice Hall, 1989.
28. R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, Parts I and II. Information and Computation, 100(1):1-77, 1992.
29. F. Orava and J. Parrow. An algebraic verification of a mobile network. Journal of Formal Aspects of Computing, 4:497-543, 1992.
30. A. Pnueli, S. Ruah, and L. Zuck. Automatic deductive verification with invisible invariants. In Tools and Algoritlms for the Construction and Analysis of Systems, 2001.
31. A. Pnueli and E. Shahar. Liveness and acceleration in parameterized verification. In Computer Aided Verification, 2000.
32. H. Song and K. J. Compton. Verifying pi-calculus processes by Promela translation. Technical Report CSE-TR-472-03, Univ. of Michigan, 2003.
33. B. Victor. The Mobility Workbench user's guide. Technical report, Department of Computer Systems, Uppsala University, Sweden, 1995.
34. P. Yang, S. Basu, and C. R. Ramakrishnan. Parameterized verification of π-calculus systems, 2006. Available at http://www.lmc.cs.sunysb.edu/~pyang/ ptech.pdf.
35. P. Yang, C. R. Ramakrishnan, and S. A. Smolka. A logical encoding of the π-calculus: Model checking mobile processes using tabled resolution. In Proceedings of VMCAI, 2003.
36. Extended version in Software Tools for Technology Transfer, 6(1):38-66,2004.
37. P. Yang, C. R. Ramakrishnan, and S. A. Smolka. A provably correct compiler for efficient model checking of mobile processes. In Proceedings of PADL, 2005.
38. L. Zuck and A. Pnueli. Model checking and abstraction to the aid of parameterized systems (a survey). Computer Languages, Systems & Structures, 30(3-4):139-169, 2004.