Abstract
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.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
B. Bloom, S. Istrail, and A. R. Meyer. Bisimulation can’t be traced. J. Assoc. Comput. Mach., 42:232–268, 1995.
O. Burkart, D. Caucal, F. Moller, and B. Steffen. Verification over infinite states. In Handbook of Process Algebra, pages 545–623. Elsevier, 2001.
O. Burkart and B. Steffen. Model checking the full modal mu-calculus for infinite sequential processes. Theoretical Computer Science, 221(1–2):251–270, 1999.
M. Dam. Compositional proof systems for model checking infinite state processes. In International Conference on Concurrency Theory, pages 12–26, 1995.
M. Dam. Proving properties of dynamic process networks. Information and Computation, 140(2):95–114, 1998.
M. Dam. Proof systems for π-calculus logics. In R. de Queiroz, editor, Logic for Concurrency and Synchronisation. OUP, 2001.
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.
M. Dam and D. Gurov. Compositional verification of CCS processes. In Proceedings of PSI’99. Springer LNCS 1755, 1999.
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.
J. Esparza and J. Knoop. An automata-theoretic approach to interprocedural data flow analysis. In Proceedings of FOSSACS’99. Springer LNCS 1578, 1999.
L. Fredlund. A framework for reasoning about Erlang code. PhD Thesis, Swedish Institute of Computer Science, 2001.
M. Hennessy and R. Milner. Algebraic laws for nondeterminism and concurrency. J. Assoc. Comput. Mach., 32:137–161, 1985.
H. Hungar and B. Steffen. Local model checking for context-free processes. Nordic Journal of Computing, 1(3):364–385, Fall 1994.
D. Kozen. Results on the propositional μ-calculus. Theoretical Computer Science, 27:333–354, 1983.
D. E. Muller and P. E. Schupp. The theory of ends, pushdown automata, and secondorder logic. Theoretical Computer Science, 37:51–75, 1985.
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.
A. K. Simpson. Compositionality via cut-elimination: Hennessy-Milner logic for an arbitrary GSOS. In Logic in Computer Science, pages 420–430, 1995.
C. P. Stirling. Modal logics for communicating systems. Theoretical Computer Science, 49:311–347, 1987.
C. P. Stirling. Modal and temporal properties of processes. Texts in Computer Science. Springer, 2001.
I. Walukiewicz. Pushdown processes: games and model-checking. Information and Computation, 164(2):234–263, January 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schöpp, U., Simpson, A. (2002). Verifying Temporal Properties Using Explicit Approximants: Completeness for Context-free Processes. In: Nielsen, M., Engberg, U. (eds) Foundations of Software Science and Computation Structures. FoSSaCS 2002. Lecture Notes in Computer Science, vol 2303. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45931-6_26
Download citation
DOI: https://doi.org/10.1007/3-540-45931-6_26
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43366-8
Online ISBN: 978-3-540-45931-6
eBook Packages: Springer Book Archive