Verifying Temporal Properties Using Explicit Approximants: Completeness for Context-free Processes
We present a sequent calculus for formally verifying modal μ-calculus properties of concurrent processes. Building on work by Dam and Gurov, the proof system contains rules for the explicit manipulation of fixed-point approximants. We develop a new syntax for approximants, incorporating, in particular, modalities for approximant modification. We make essential use of this feature to prove our main result: the sequent calculus is complete for establishing arbitrary μ-calculus properties of context-free processes.
KeywordsTemporal Property Proof System Sequent Calculus Derivation Tree Canonical Sequent
- 2.O. Burkart, D. Caucal, F. Moller, and B. Steffen. Verification over infinite states. In Handbook of Process Algebra, pages 545–623. Elsevier, 2001.Google Scholar
- 4.M. Dam. Compositional proof systems for model checking infinite state processes. In International Conference on Concurrency Theory, pages 12–26, 1995.Google Scholar
- 6.M. Dam. Proof systems for π-calculus logics. In R. de Queiroz, editor, Logic for Concurrency and Synchronisation. OUP, 2001.Google Scholar
- 7.M. Dam, L. Fredlund, and D. Gurov. Toward parametric verification of open distributed systems. In A. Pnueli H. Langmaack and W.-P. de Roever, editors, Compositionality: the Significant Difference. Springer, 1998.Google Scholar
- 8.M. Dam and D. Gurov. Compositional verification of CCS processes. In Proceedings of PSI’99. Springer LNCS 1755, 1999.Google Scholar
- 9.M. Dam and D. Gurov. μ-calculus with explicit points and approximations. Journal of Logic and Computation, to appear, 2001. Abstract in Proceedings of FICS 2000.Google Scholar
- 10.J. Esparza and J. Knoop. An automata-theoretic approach to interprocedural data flow analysis. In Proceedings of FOSSACS’99. Springer LNCS 1578, 1999.Google Scholar
- 11.L. Fredlund. A framework for reasoning about Erlang code. PhD Thesis, Swedish Institute of Computer Science, 2001.Google Scholar
- 16.U. Schöpp. Formal verification of processes. MSc Dissertation, University of Edinburgh, 2001. Available as http://www.dcs.ed.ac.uk/home/us/th.ps.gz.
- 17.A. K. Simpson. Compositionality via cut-elimination: Hennessy-Milner logic for an arbitrary GSOS. In Logic in Computer Science, pages 420–430, 1995.Google Scholar
- 19.C. P. Stirling. Modal and temporal properties of processes. Texts in Computer Science. Springer, 2001.Google Scholar