mu-calculus with explicit points and approximations
2002 (English)In: Journal of logic and computation (Print), ISSN 0955-792X, E-ISSN 1465-363X, Vol. 12, no 2, 255-269 p.Article in journal (Refereed) Published
We present a Gentzen-style sequent calculus for program verification which accommodates both model checking-like verification based on global state space exploration, and compositional reasoning. To handle the complexities arising from the presence of fixed-point formulas, programs with dynamically evolving architecture, and cut rules we use transition assertions, and introduce fixed-point approximants explicitly into the assertion language. We address, in a game-based manner, the semantical basis of this approach, as it applies to the entailment subproblem. Soundness and completeness results are obtained, and examples are shown illustrating some of the concepts.
Place, publisher, year, edition, pages
2002. Vol. 12, no 2, 255-269 p.
mu-calculus, sequent calculus, program verification, compositionality, model checking, verification, systems
IdentifiersURN: urn:nbn:se:kth:diva-21521ISI: 000175399900004OAI: oai:DiVA.org:kth-21521DiVA: diva2:340219
QC 201005252010-08-102010-08-10Bibliographically approved