A model-checking verification environment for mobile processes

ACM Transactions on Software Engineering and Methodology

Volumn 12, Issue 4, 2003, Pages 440-473

  Ferrari, Gian Luigi ^a   Gnesi, Stefania ^b   Montanari, Ugo ^a   Pistore, Marco ^c  

^a UNIVERSITY OF PISA   (Italy)

^b ISTI CNR   (Italy)

^c UNIVERSITY OF TRENTO   (Italy)

Author keywords

Mobile processes; Modal logics; Name passing process calculi; Security; Transition systems

Indexed keywords

COMPUTER PROGRAMMING; COMPUTER SIMULATION; FORMAL LOGIC; SECURITY SYSTEMS; SEMANTICS; THEOREM PROVING;

MOBILE PROCESSES; MODAL LOGICS; NAME-PASSING PROCESS CALCULI; SECURITY; TRANSITION SYSTEMS;

FINITE AUTOMATA;

EID: 2542474345     PISSN: 1049331X     EISSN: None     Source Type: Journal    
DOI: 10.1145/990010.990013     Document Type: Article

References (44)

1. ABADI, M. AND GORDON, A. 1999. A calculus for cryptographic protocols: The spi calculus. Inf. Comput. 148, 1, pp. 1-70.
2. BOUALI, A. AND DE SIMONE, R. 1992. Symbolic bisimulation minimization. In Computer Aided Verification (CAV). Lecture Notes in Computer Science, Vol. 663. Springer, pp. 96-108.
3. BOUALI, A., GNESI, S., AND LAROSA, S. 1994. The integration project for the jack environment. In Bulletin of EATCS, Vol. 54. Centrum voor Wiskunde en Informatica (CWI), pp. 207-223.
4. BOUALI, A., RESSOUCHE, A., ROY, V., AND DE SIMONE, R. 1996. The fc2 tools set. In Computer Aided Verification (CAV). Lecture Notes in Computer Science, Vol. 1102. Springer, pp. 441-445.
5. BURROW, M., ABADI, M., AND NEEDHAM, R. 1989. A logic of authentication. Vol. 246. Proceedings of the Royal Society of London, pp. 233-271.
6. CAHDELLI, L. AND CAIRES, L. 2002. A spatial logic for concurrency (part ii). In CONCUR'02. Lecture Notes in Computer Science, Vol. 2421. Springer, pp. 209-225.
7. CARDELLI, L. AND CAIRES, L. 2003. A spatial logic for concurrency (part i). Inf. Comput. 186, 2, pp. 194-235.
8. CHAKI, S., RAJAMANI, S., AND REHOF, J. 2002. Types as models: Model checking message-passing programs. In the 29th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POP'02). ACM Press, pp. 45-57.
9. CLARKE, E., JHA, S., AND MARRERO, W. 1998. Using state space exploration and a natural deduction style message derivation engine to verify security protocols. In the IFIP Working Conference on Programming Concepts and Methods (PROCOMET).
10. CLARKE, B. AND WING, J. 1996. Formal methods: State of the art and future directions. ACMCS 28, 4, pp. 626-643.
11. DAM, M. 1996. Model checking mobile processes. Inf. Computa. 129, 1, pp. 35-51.
12. DAM, M. 2003. Proof systems for π-calculus logics. Trends in Logic, Ed. R. de Queiroz. Kluwer, pp. 407-419.
13. DE NICOLA, R., FANTECHI, A., GNESI, S., AND RISTORI, G. 1993. An action-based framework for verifying logical and behavioral properties of concurrent systems. Comput. Netw. ISDN Syst. 25, 7, pp. 761-778.
14. DE NICOLA, R. AND VAANDRAGEH, F. 1990. Action versus state-based logics for transition systems. In Ecole de Printemps on Semantics of Concurrency. Lecture Notes in Computer Science, Vol. 469. Springer.
15. EMERSON, E. AND HALPERN, J. 1986. Sometimes and not never revisited: on branching time versus linear time temporal logic. J. ACM 33, 1, pp. 151-178.
16. FERNANDEZ, J. AND MOUNIER, L. 1991. On the fly verification of behavioral equivalences and preorders. In Computer Aided Verification. Lecture Notes in Computer Science, Vol. 575. Springer, pp. 181-191.
17. FERRARI, G., MONTANARI, U., AND PISTORE, M. 2002. Minimizing transition systems for name-passing calculi: A co-algebraic formulation. In FOSSACS'02. Lecture Notes in Computer Science, Vol. 2303. Springer, pp. 129-143.
18. FERRO, G. 1994. Amc: Actl model checker, reference manual. Tech. Rep. B4-47, IEI-CNR Internal Report, Pisa Italy.
19. FIORE, M., PLOTKIN, G., AND TURI, D. 1999. Abstract syntax and variable binding. In the 14th Logics in Computer Science (LICS). IEEE Computer Science Press, pp. 193-202.
20. FOCARDI, R. AND GORRIERI, R. 1997. The compositional security checker: A tool for the verification of information flow security properties. IEEE Trans. Softw. Eng. 23, 9, pp. 550-571.
21. GABBAY, M. AND PITTS, A. 1999. A new approach to abstract syntax involving binders. In the 14th Annual Symposium on Logic in Computer Science. IEEE Computer Society Press, pp. 214-224.
22. GNESI, S. AND RISTORI, G. 2000. A Model Checking Algorithm for π-calculus Agents. Applied Logic Series, Vol. 16. Kluwer, pp. 339-358.
23. GORDON, A. 2001. Notes on nominal calculi for security and mobility. In FOSAD Summer School. Lecture Notes in Computer Science, Vol. 2171. Springer, pp. 262-330.
24. HENNESSY, M. AND MILNER, R. 1985. Algebraic laws for nondeterminism and concurrency. J. ACM 32, 1, pp. 137-161.
25. HONDA, K. 2000. Elementary structures for process theory (1): Sets with renaming. Math. Struct. Comp. Sci. 10, pp. 617-633.
26. KOZEN, D. 1983. Results on the prepositional μ-calculus. Theoret. Comp. Sci. 27, pp. 333-354.
27. LOWE, M. 1996. Breaking and fixing the needham-schroeder public-key protocol using fdr. In TACAS'96. Lecture Notes in Computer Science, Vol. 1055. Springer, pp. 147-166.
28. MADELAINE, E. AND VERGAMINI, D. 1990. AUTO: A verification Tool for Distributed Systems Using Reduction of Finite Automata Networks. Formal Description Techniques (II). North Holland.
29. MILNER, R. 1989. Communication and Concurrency. Prentice Hall.
30. MILNER, R., PARROW, J., AND WALKER, D. 1992. A calculus of mobile processes. Inf. Comput. 100, pp. 1-77.
31. MILNER, R., PARROW, J., AND WALKER, D. 1993. Modal logics for mobile processes. Theoret. Comp. Sci. 114, pp. 149-171.
32. MONTANARI, U. AND PISTORE, M. 1995. Checking bisimilarity for finitary π-calculus. In CONCUR'95. Lecture Notes in Computer Science, Vol. 962. Springer, pp. 42-56.
33. MONTANARI, U. AND PISTORE, M. 2000. π-calculus, structured coalgebras and minimal hd-automata. In MFCS'2000. Lecture Notes in Computer Science, Vol. 1893. Springer, pp. 669-578.
34. MONTANARI, U. AND PISTORE, M. 2003. Structured coalgebras and minimal hd-automata for the π-calculus. Theoret. Comp. Sci. (to appear).
35. NEEDHAN, R. 1989. Names. (Mullender Ed.) Addison-Wesley.
36. ORAVA, F. AND PARROW, J. 1992. An algebraic verification of a mobile network. Form. Asp. Comp. 4, pp. 497-543.
37. PARK, D. 1981. Concurrency and automata on infinite sequences. In 5 GI-Conference. Lecture Notes in Computer Science, Vol. 104. Springer, pp. 167-183.
38. PISTORE, M. 1999. History dependent automata. Ph.D. Thesis, Dipartimento di Informatica, Univ. Pisa, TD-5/99.
39. PITTS, A. AND GABBAY, M. 2000. A metalanguage for programming with bound names modulo renaming. In Mathematics of Program Construction (MPC'00). Lecture Notes in Computer Science, Vol. 1837. Springer, pp. 230-255.
40. ROY, V. AND DE SIMONE, R. 1990. AUTO and autograph. In CAV'90. Lecture Notes in Computer Science, Vol. 531. Springer, pp. 65-75.
41. SANGIORGI, D. 1993. A theory of bisimulation for the π-calculus. In CONCUR'93. Lecture Notes in Computer Science, Vol. 715. Springer, pp. 127-142.
42. SANGIORGI, D. AND WALKER, D. 2002. The π-calculus: a Theory of Mobile Processes. Cambridge University Press.
43. SEWELL, P. 2000. Applied pi - a brief tutorial. Technical Report 498, Computer Laboratory, University of Cambridge (UK).
44. VICTOR, B. AND MOLLER, F. 1994. The mobility workbench - a tool for the π-calculus. In CAV'94. Lecture Notes in Computer Science, Vol. 818. Springer, pp. 428-440.