Sequent calculi for process verification: Hennessy-Milner logic for an arbitrary GSOS

Journal of Logic and Algebraic Programming

Volumn 60-61, Issue SUPPL., 2004, Pages 287-322

  Simpson, Alex ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

Compositionality; Formal verification; Process algebra; Sequent calculus; Structural operational semantics

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER SOFTWARE; SEMANTICS; THEOREM PROVING;

FORMAL VERIFICATION; PROCESS ALGEBRA; PROCESS VERIFICATION; SEQUENT CALCULUS;

CONCURRENT ENGINEERING;

EID: 2942604383     PISSN: 15678326     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jlap.2004.03.004     Document Type: Article

References (30)

1. Aceto L., Bloom B., Vaandrager F. Turning SOS rules into equations. Inform. Comput. 111:1994;1-52.
2. H.R. Anderson, C.P. Stirling, G. Winskel, A compositional proof system for the modal μ -calculus, in: Proceedings of 9th IEEE Symposium on Logic in Computer Science, 1994, pp. 144-153.
3. G. Barthe, D. Gurov, M. Huisman, Compositional verification of secure Applet interactions, in: Proceedings of FASE'02, Springer LNCS 2306, 2002, pp. 15-32.
4. J. Beattie, A Sequent Calculus for Proving Properties of Processes, M.Sc. dissertation, Division of Informatics, University of Edinburgh, 1997.
5. Bloom B., Istrail S., Meyer A.R. Bisimulation can't be traced. J. Assoc. Comput. Mach. 42:1995;232-268.
6. L. Caires, L. Cardelli, A spatial logic for concurrency (part II), in: CONCUR 2002, Proceedings of 13th International Conference on Concurrency Theory, Springer LNCS 2421, 2002, pp. 209-225.
7. M. Dam, Compositional proof systems for model checking infinite state processes, in: International Conference on Concurrency Theory, 1995, pp. 12-26.
8. Dam M. Proving properties of dynamic process networks. Inform. Comput. 140:1998;95-114.
9. M. Dam, Proof systems for π -calculus logics, in: R. de Queiroz (Ed.), Logic for Concurrency and Synchronisation OUP, 2001.
10. Dam M., Fredlund L., Gurov D. Toward parametric verification of open distributed systems. Pnueli A., Langmaack H., de Roever W.-P. Compositionality: the Significant Difference. 1998;Springer.
11. Dam M., Gurov D. μ-calculus with explicit points and approximations J. Logic Comput. 12:2002;255-269.
12. Esparza J. Decidability of model-checking for infinite-state concurrent systems. Acta Inform. 34:1997;85-107.
13. L. Fredlund, A framework for reasoning about Erlang code, Ph.D. Thesis, Swedish Institute of Computer Science, 2001.
14. Gentzen G. Investigations into logical deduction. Szabo M.E. The Collected Papers of Gerhard Gentzen. 1969;68-128 North Holland Publishing Company. Originally published in German, 1935.
15. Graf S., Sifakis J. A modal characterization of observational congruence on finite terms of CCS. Inform. Control. 68:1986;125-145.
16. Hennessy M., Milner R. Algebraic laws for nondeterminism and concurrency. J. Assoc. Comput. Mach. 32:1985;137-161.
17. Kozen D. Results on the propositional mu-calculus. Theoret. Comput. Sci. 27:1983;333-354.
18. R. Milner, Communication and Concurrency, Prentice Hall international series in computer science, Prentice Hall, 1989.
19. A. Pnueli, The temporal logic of programs, in: Proceedings of 19th IEEE Symposium on Foundations of Computer Science, 1977, pp. 46-57.
20. U. Schöpp, Formal verification of processes, M.Sc. Dissertation, Division of Informatics, University of Edinburgh, 2001.
21. U. Schöpp, A.K. Simpson, Verifying temporal properties using explicit approximants: completeness for context-free processes, In Proceedings of FOSSACS 2002, Springer LNCS 2303, 2002, pages 372-386.
22. U. Schöpp, A.K. Simpson, Verifying temporal properties using explicit approximants: completeness for pushdown processes, in preparation.
23. A.K. Simpson, Compositionality via cut-elimination: Hennessy-Milner logic for an arbitrary GSOS, in: Proceedings of 10th IEEE Symposium on Logic in Computer Science, 1995, pp. 420-430.
24. C. Sprenger, M. Dam, A note on global induction mechanisms in a μ -calculus with explicit approximations, in: Proceedings of FICS'02, 2002.
25. Stirling C.P. Modal logics for communicating systems. Theoret. Comput. Sci. 49:1987;311-347.
26. Stirling C.P., Walker D. Local model checking in the modal mu-calculus. Theoret. Comput. Sci. 89:1991;161-177.
27. D. Turi, Functorial Operational Semantics and its Denotational Dual, Ph.D. thesis, Free University, Amsterdam, 1996.
28. D. Turi, G.D. Plotkin, Towards a mathematical operational semantics, in: Proceedings of 12th IEEE Symposium on Logic in Computer Science, 1997, pp. 280-291.
29. Walukiewicz I. Completeness of Kozen's axiomatisation of the propositional. μ -calculus Inform. Comput. 157:2000;142-182.
30. Winskel G. A complete proof system for SCCS with modal assertions. Fundam. Inform. IX:1986;401-420.