Stuttering Abstraction for Model Checkin
SEFM '05 Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods
On finite-state approximants for probabilistic computation tree logic
Theoretical Computer Science - Quantitative aspects of programming languages (QAPL 2004)
When not losing is better than winning: Abstraction and refinement for the full μ-calculus
Information and Computation
Compositional verification of sequential programs with procedures
Information and Computation
On model checking multiple hybrid views
Theoretical Computer Science
State Focusing: Lazy Abstraction for the Mu-Calculus
SPIN '08 Proceedings of the 15th international workshop on Model Checking Software
3-Valued abstraction: More precision at less cost
Information and Computation
Reducing Behavioural to Structural Properties of Programs with Procedures
VMCAI '09 Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation
Automata Games for Multiple-model Checking
Electronic Notes in Theoretical Computer Science (ENTCS)
Efficient Patterns for Model Checking Partial State Spaces in CTL ∩ LTL
Electronic Notes in Theoretical Computer Science (ENTCS)
Symmetry and completeness in the analysis of parameterized systems
VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
Local abstraction-refinement for the mu-calculus
Proceedings of the 14th international SPIN conference on Model checking software
FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
Model checking for action abstraction
VMCAI'08 Proceedings of the 9th international conference on Verification, model checking, and abstract interpretation
Three-valued abstractions of Markov chains: completeness for a sizeable fragment of PCTL
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
On the consistency, expressiveness, and precision of partial modeling formalisms
Information and Computation
Modal abstractions of concurrent behavior
ACM Transactions on Computational Logic (TOCL)
Abstraction and refinement in model checking
FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
Underapproximating predicate transformers
SAS'06 Proceedings of the 13th international conference on Static Analysis
On the expressiveness of refinement settings
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
YASM: a software model-checker for verification and refutation
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Concrete model checking with abstract matching and refinement
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Ranked predicate abstraction for branching time: complete, incremental, and precise
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Comparing completeness properties of static analyses and their logics
APLAS'06 Proceedings of the 4th Asian conference on Programming Languages and Systems
p-Automata: New foundations for discrete-time probabilistic verification
Performance Evaluation
ICTAC'12 Proceedings of the 9th international conference on Theoretical Aspects of Computing
Reducing behavioural to structural properties of programs with procedures
Theoretical Computer Science
Reasoning about nondeterminism in programs
Proceedings of the 34th ACM SIGPLAN conference on Programming language design and implementation
| Hi-index | 0.00 |
Abstraction is often essential to verify a program with model checking. Typically, a concrete source program with an infinite (or finite, but large) state space is reduced to a small, finite state, abstract program on which a correctness property can be checked. The fundamental question we investigate in this paper is whether such a reduction to finite state programs is always possible, for arbitrary branching time temporal properties. We begin by showing that existing abstraction frameworks are inherently incomplete for verifying purely existential or mixed universal-existential properties. We then propose a new, complete abstraction framework which is based on a class of focused transition systems (FTS's). The key new feature in FTS's is a way of "focusing" an abstract state to a set of more precise abstract states. While focus operators have been defined for specific contexts, this result shows their fundamental usefulness for proving non-universal properties. The constructive completeness proof provides linear size maximal models for properties expressed in logics such as CTL and the mu-calculus. This substantially improves upon known (worst-case) exponential size constructions for their universal fragments.