Model checking for nominal calculi

Lecture Notes in Computer Science

Volumn 3441, Issue , 2005, Pages 1-24

  Ferrari, Gian Luigi ^a   Montanari, Ugo ^a   Tuosto, Emilio ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTATION THEORY; MATHEMATICAL MODELS; SEMANTICS; SYNTACTICS;

NOMINAL CALCULI; SYMBOLIC SEMANTICS; WEB SERVICES;

DIFFERENTIATION (CALCULUS);

EID: 24644503267     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31982-5_1     Document Type: Conference Paper

References (84)

1. M. Abadi and A. Gordon. A Calculus for Cryptographic Protocols: The Spi Calculus. Inf. and Comp., 148(1): 1-70, January 1999.
2. G. Baldi, A. Bracciali, G. Ferrari, and E. Tuosto. A Coordination-based Methodology for Security Protocol Verification. In WISP, ENTCS, Bologna, Italy, June 2004. Elsevier. To appear.
3. T. Ball and S. Rajamani. The SLAM Toolkit. In G. Berry, H. Comon, and A. Finkel, editors, CAV, volume 2102 of LNCS, pages 260-264. Springer, 2001.
4. N. Benton, L. Cardelli, and C. Fournet. Modern Concurrency Abstractions for C#. TOPLAS, 26(5):269-304, Sept. 2004.
5. M. Boreale and M. Buscemi. A Framework for the Analysis of Security Protocols. In L. Brim, P. Jančar, M. Křetinský, and A. Kučera, editors, CONCUR, volume 2421 of LNCS, pages 483-498. Springer, Aug. 2002.
6. M. Boreale and R. De Nicola. A Symbolic Semantics for the π-calculus. Inf. and Comp., 126(1):34-52, April 1996.
7. A. Bouali, S. Gnesi, and S. Larosa. The Integration Project for the JACK Environment. In EATCS Bull., volume 54, pages 207-223. Centrum voor Wiskunde en Informatica (CWI), 1994.
8. A. Bouali, A. Ressouche, V. Roy, and R. de Simone. The FC2TOOLS Set. In R. Alur and T. Henzinger, editors, CAV, volume 1102 of LNCS, pages 441-445, New Brunswick, NJ, USA, 1996. Springer.
9. A. Bracciali, A. Brogi, G. Ferrari, and E. Tuosto. Security Issues in Component Based Design. In U. Montanari and V. Sassone, editors, ConCoord: International Workshop on Concurrency and Coordination, volume 54 of ENTCS, Lipari Island - Italy, July 2001. Elsevier.
10. G. Brat, K. Havelund, S. Park, and W. Visser. Model Checking Programs. Automated Software Engineering, 10(2):203-232, 2003.
11. R. Bruni, C. Laneve, and U. Montanari. Orchestrating Transactions in Join Calculus. In L. Brim, P. Jancar, M. Kretinsky, and A. Kucera, editors, CONCUR, volume 2421 of LNCS, pages 321-336. Springer, 2002.
12. R. Bruni, H. Melgratti, and U. Montanari. Theoretical Foundations for Compensations in Flow Composition Languages. In POPL, 2005. To appear.
13. R. Bruni, U. Montanari, and F. Rossi. An Interactive Semantics of Logic Programming. Theory and Practice of Logic Programming., 1(6):647-690, 2001.
14. M. Butler and C. Ferreira. An Operational Semantics for StAC, a Language for Modelling Long-Running Business Transactions. In R. De Nicola, G. Ferrari, and G. Meredith, editors, COORDINATION, volume 2949 of LNCS, pages 87-104. Springer, 2004.
15. L. Caires and L. Cardelli. A Spatial Logic for Concurrency (Part I). Inf. and Comp., 186, 2003.
16. L. Caires and L. Cardelli. A Spatial Logic for Concurrency II. TCS, 322(3):517-565, Sept. 2004.
17. G. Cattani and P. Sewell. Models for Name-Passing Processes: Interleaving and Causal (Extended Abstract). Inf. and Comp., 190(2): 136-178, May 2004.
18. E. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, 1999.
19. E. Clarke and J. Wing. Formal Methods: State of the Art and Future Directions. ACM Computing Surveys, 28(4):626-643, December 1996.
20. S. Clarke, Edmund M. Jha and W. Marrero. Using State Space Exploration and a Nautural Deduction Style Message Derivation Engine to Verify Security Protocols. In In Proc. IFIP Working Conference on Programming Concepts and Methods (PROCOMET), 1998.
21. R. Cleaveland, J. Parrow, and B. Steffen. The Concurrency Workbench: A Semantics-Based Tool for the Verification of Concurrent Systems. TOPLAS, 15(1):36-72, Jan. 1993.
22. S. Conchon and F. Le Fessant. Jocaml: Mobile Agents for Objective-Caml. In International Symposium on Agent Systems and Applications, pages 22-29, Palm Springs, California, Oct. 1999.
23. J. Corbett, M. Dwyer, J. Hatcliff, S. Laubach, S. Corina, Robby, and H. Zheng. Bandera: Extracting Finite-state Models from Java Source Code. In International Conference on Software Engineering, pages 439-448, Limerick, Ireland, June 2000.
24. F. Curbera, R. Khalaf, N. Mukhi, S. Tai, and S. Weerawarana. The Next Step in Web Services. CACM, 46(10):29-34, 2003.
25. M. Dam. Model Checking Mobile Processes. Inf. and Comp., 129(1):35-51, 1996.
26. M. Dam. Proof Systems for π-Calculus Logics. Logic for concurrency and synchronisation, pages 145-212, 2003.
27. G. Denker and J. Millen. CAPSL Integrated Protocol Environment. Technical report, Computer Science Laboratory, SRI International, Menlo Park, CA, 1999.
28. H. Ehrig and B. König. Deriving Bisimulation Congruences in the DPO Approach to Graph Rewriting. In I. Walukiewicz, editor, FoSSaCS, volume 2987, pages 151-166. LNCS, 2004.
29. J. Fernandez. An Implementation of an Efficient Algorithm for Bisimulation Equivalence. Science of Computer Programming, 13(2-3):219-236, May 1990.
30. J. Fernandez and L. Mounier. On-the-fly Verification of Behavioural Equivalences and Preorders. In K. Larsen and A. Skou, editors, CAV, volume 575 of LNCS, pages 181-191. Springer, July 1991.
31. G. Ferrari, G. Ferro, S. Gnesi, U. Montanari, M. Pistore, and G. Ristori. An Automata Based Verification Environment for Mobile Processes. In E. Brinksma, editor, TACAS, volume 1217 of LNCS, pages 275-289. Springer, April 1997.
32. G. Ferrari, S. Gnesi, U. Montanari, and M. Pistore. A Model Checking Verification Environment for Mobile Processes. TOPLAS, 12(4):1-34, 2004.
33. G. Ferrari, S. Gnesi, U. Montanari, R. Raggi, G. Trentanni, and E. Tuosto. Verification on the WEB. In J. Augusto and U. Ultes-Nitsche, editors, VVEIS, pages 72-74, Porto, Portugal, April 2004. INSTICC Press.
34. G. Ferrari, U. Montanari, and M. Pistore. Minimizing Transition Systems for Name Passing Calculi: A Co-algebraic Formulation. In M. Nielsen and U. Engberg, editors, FOSSACS 2002, volume 2303 of LNCS, pages 129-143. Springer, 2002.
35. G. Ferrari, U. Montanari, and E. Tuosto. From Co-algebraic Specifications to Implementation: The Mihda toolkit. In F. de Boer, M. Bonsangue, S. Graf, and W. de Roever, editors, FMCO, volume 2852 of LNCS, pages 319-338. Springer, November 2002.
36. G. Ferrari, U. Montanari, and E. Tuosto. Coalgebraic Minimisation of HD-automata for the π-Calculus in a Polymorphic λ-Calculus. TCS, 2004. To appear.
37. M. Fiore, G. Plotkin, and D. Turi. Abstract Syntax and Variable Binding (Extended Abstract). In LICS, pages 193-202, Trento, Italy, July 1999. IEEE.
38. P. Fiore and M. Abadi. Computing Symbolic Models for Verifying Cryptographic Protocols. In Computer Security Foundations Workshop, CSFW, pages 160-173, Cape Breton, Nova Scotia, Canada, June 2001. IEEE.
39. R. Focardi and R. Gorrieri. A Classification of Security Properties. J. of Computer Security, 3(1), 1995.
40. M. Gabbay and A. Pitts. A New Approach to Abstract Syntax Involving Binders. In G. Longo, editor, LICS, pages 214-224, Trento, Italy, July 1999. IEEE.
41. A. Gordon. Notes on Nominal Calculi for Security and Mobility. In R. Focardi and R. Gorrieri, editors, FOSAD, volume 2171 of LNCS, pages 262-330. Springer, September 2002.
42. M. Hennessy and H. Lin. Symbolic Bisimulations. TCS, 138(2):353-389, February 1995.
43. T. Henzinger, R. Jhala, R. Majumdar, and G. Sutre. Lazy Abstraction. In POPL, pages 58-70. ACM Press, 2002.
44. D. Hirschkoff. On the Benefits of Using the up-to Techniques for Bisimulation Verification. In W. Cleaveland, editor, TACAS, volume 1579 of LNCS, pages 285-299, Amsterdam, March 1999. Springer.
45. G. Holzmann. The Model Checker Spin. TSE, 23(5):279-295, May 1997.
46. G. Holzmann. The Spin Model Checker: Primer and Reference Manual. Addison-Wesley, Sept. 2003.
47. K. Honda. Elementary Structures in Process Theory (1): Sets with Renaming. MSCS, 10(5):617-663, 2000.
48. O. Jensen and R. Milner. Digraphs and Transitions. In POPL, pages 38-49. ACM Press, 2003.
49. P. Kanellakis and S. Smolka. CCS Expressions, Finite State Processes and Three Problem of Equivalence. Inf. and Comp., 86(1):272-302, 1990.
50. S. Lack and P. Sobociń ski. Adhesive Categories. In I. Walukiewicz, editor, FoSSaCS, volume 2987 of LNCS, pages 273-288, Barcelona, March 2004. Springer.
51. C. Laneve and G. Zavattaro. Foundations of Web Transactions. In FoSSaCS, LNCS, 2005. To appear.
52. J. Leifer. Operational Congruences for Reactive Systems. PhD thesis, Computer Laboratory, University of Cambridge, Cambridge, UK, 2001.
53. J. Leifer and R. Milner. Deriving Bisimulation Congruences for Reactive Systems. In C. Palamidessi, editor, CONCUR, volume 1877 of LNCS, pages 243-258, University Park, PA, USA, August 22-25 2000. Springer.
54. H. Lin. Complete Inference Systems for Weak Bisimulation Equivalences in the π-Calculus. Inf. and Comp., 180(1):1-29, January 2003.
55. G. Lowe. Towards a Completeness Result for Model Checking of Security Protocols. In CSFW. IEEE, 1998.
56. W. Marrero, E. Clarke, and S. Jha. Model Checking for Security Protocols. In Formal Verification of Security Protocols, 1997.
57. K. McMillan. Symbolic Model Checking. Kluwer Academic Publisher, 1993.
58. R. Milner. Communication and Concurrency. Prentice Hall, 1989.
59. R. Milner, J. Parrow, and D. Walker. A Calculus of Mobile Processes, I and II. Inf. and Comp., 100(1):1-40,41-77, September 1992.
60. J. Mitchell, M. Mitchell, and U. Ster. Automated analysis of cryptographic protocols using murø. In CSFW, pages 141-151. IEEE, 1997.
61. U. Montanari and M. Buscemi. A First Order Coalgebraic Model of π-Calculus Early Observational Equivalence. In L. Brim, P. Jančar, M. Křetinský, and A. Kučera, editors, CONCUR, volume 2421 of LNCS, pages 449-465. Springer, Aug. 2002.
62. U. Montanari and M. Pistore. Checking Bisimilarity for Finitary π-Calculus. In I. Lee and S. Smolka, editors, CONCUR, volume 962 of LNCS, pages 42-56, Philadelphia, PA, USA, Aug. 1995. Springer.
63. U. Montanari and M. Pistore. History Dependent Automata. Technical report, Computer Science Department, Università di Pisa, 1998. TR-11-98.
64. U. Montanari and M. Pistore. π-Calculus, Structured Coalgebras, and Minimal HD-Automata. In M. Nielsen and B. Roman, editors, MFCS, volume 1983 of LNCS. Springer, 2000. An extended version will be published on Theoretical Computer Science.
65. U. Montanari and V. Sassone. Dynamic Congruence vs. Progressing Bisimulation for CCS. Fundamenta Informaticae, 16:171-196, 1992.
66. R. Needham. Names. Addison-Wesley (Mullender Ed.), 1989.
67. R. Paige and R. Tarjan. Three Partition Refinement Algorithms. SIAM Journal on Computing, 16(6):973-989, December 1987.
68. M. Papazoglou. Service-Oriented Computing: Concepts, Characteristics and Directions. In Web Information Systems Engineering (WISE'03), LNCS, pages 3-12. Springer, 2003.
69. D. Park. Concurrency and Automata on Infinite Sequences. In Theoretical Computer Science, 5th GI-Conf., volume 104 of LNCS, pages 167-183. Springer, Karlsruhe, March 1981.
70. J. Parrow and B. Victor. The Fusion Calculus: Expressiveness and Symmetry in Mobile Processes. In LICS. IEEE, 1998.
71. M. Pistore. History Dependent Automata. PhD thesis, Computer Science Department, Università di Pisa, 1999.
72. M. Pistore and D. Sangiorgi. A Partition Refinement Algorithm for the π-Calculus. Inf. and Comp., 164(2):467-509, 2001.
73. D. Sangiorgi. On the Bisimulation Proof Method (Extended Abstract). In J. Wiedermann and P. Hájek, editors, MFCS, volume 969 of LNCS, pages 479-488, Prague, August-September 1995. Springer.
74. D. Sangiorgi. A Theory of Bisimulation for the π-Calculus. Acta Informatica, 33(1):69-97, 1996.
75. D. Sangiorgi and D. Walker. The π-Calculus: a Theory of Mobile Processes. Cambridge University Press, 2002.
76. V. Sassone and P. Sobociński. Deriving Bisimulation Congruences using 2-categories. Nordic J. of Computing, 10(2), 2003.
77. V. Sassone and P. Sobociński. Congruences for Contextual Graph-Rewriting. Technical Report RS-14, BRICS, June 2004.
78. V. Sassone and P. Sobociński. Locating Reaction with 2-Categories. TCS, 2004. To appear.
79. P. Sewell. From Rewrite Rules to Bisimulation Congruences. LNCS, 1466, 1998.
80. P. Sewell. Applied π - A Brief Tutorial. Technical Report 498, Computer Laboratory, University of Cambridge, Aug. 2000.
81. H. Smith and P. Fingar. Workflow is Just a Pi process. Available at http://www.bpm3.com/picalculus, 2003.
82. V. Vanackére. The TRUST protocol analyser. Automatic and Efficient Verification of Cryptographic Protocols. In VERIFY02, 2002.
83. B. Victor and F. Moller. The Mobility Workbench - A Tool for the π-Calculus. In D. Dill, editor, CAV, volume 818 of LNCS, pages 428-440. Springer, 1994.
84. P. Yang, C. Ramakrishnan, and S. Smolka. A Logical Encoding of the π-Calculus: Model Checking Mobile Processes Using Tabled Resolution. STTT, 6(1):38-66, July 2004.