Modal Transition Systems: A Foundation for Three-Valued Program Analysis
Michael Huth,Radha Jagadeesan,David A. Schmidt +2 more
- pp 155-169
TLDR
Two major applications, model checking partial state spaces and three-valued program shape analysis, are presented as evidence of the suitability of Kripke MTSs as a foundation for three- valued analyses.Abstract:
We present Kripke modal transition systems (Kripke MTSs), a generalization of modal transition systems [27, 26], as a foundation for three-valued program analysis. The semantics of Kripke MTSs are presented by means of a mixed power domain of states; soundness and consistency are proved. Two major applications, model checking partial state spaces and three-valued program shape analysis, are presented as evidence of the suitability of Kripke MTSs as a foundation for three-valued analyses.read more
Citations
More filters
Journal ArticleDOI
Boolean and Cartesian abstraction for model checking C programs
TL;DR: This work shows how to attack the problem of model checking a C program with recursive procedures using an abstraction that is formally defined as the composition of the Boolean and the Cartesian abstractions.
Book ChapterDOI
On modal refinement and consistency
TL;DR: The incompleteness of the standard modal refinement is demonstrated using a counterexmnple due to Huttel, and four forms of consistency are considered, each operationally, giving algorithms for deciding, and for synthesizing implementations, together with their complexities.
Book ChapterDOI
Boolean and Cartesian Abstraction for Model Checking C Programs
TL;DR: This work shows how to attack the problem of model checking a C program with recursive procedures using an abstraction that is formally defined as the composition of the Boolean and the Cartesian abstractions.
Book ChapterDOI
Abstraction-Based Model Checking Using Modal Transition Systems
TL;DR: A framework for automatic program abstraction that can be used for model checking any formula of the modal mu-calculus, which can both prove and disprove any formula including arbitrarily nested path quantifiers is presented.
Journal ArticleDOI
Multi-valued symbolic model-checking
TL;DR: The model-checker works for any member of a large class of multi-valued logics and is based on a generalization of Kripke structures, where both atomic propositions and transitions between states may take any of the truth values of a givenmulti-valued logic.
References
More filters
Book
Communication and Concurrency
TL;DR: This chapter discusses Bisimulation and Observation Equivalence as a Modelling Communication, a Programming Language, and its application to Equational laws.
Proceedings ArticleDOI
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints
Patrick Cousot,Radhia Cousot +1 more
TL;DR: In this paper, the abstract interpretation of programs is used to describe computations in another universe of abstract objects, so that the results of abstract execution give some information on the actual computations.
The unified modelling language reference manual
TL;DR: The Unified Modeling Language Reference Manual as discussed by the authors provides an excellent real-world guide to working with UML, from structured design methods of the '60s and '70s to the competing object-oriented design standards that were unified to create UML.
Book
The Z notation: a reference manual
TL;DR: Tutorial introduction background the Z language the mathematical tool-kit sequential systems syntax summary and how to use it to solve sequential systems problems.