Abstract interpretation of reactive systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Modal Transition Systems: A Foundation for Three-Valued Program Analysis
ESOP '01 Proceedings of the 10th European Symposium on Programming Languages and Systems
The Expressive Power of Implicit Specifications
ICALP '91 Proceedings of the 18th International Colloquium on Automata, Languages and Programming
On the Expressiveness of 3-Valued Models
VMCAI 2003 Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation
Generalized Model Checking: Reasoning about Partial State Spaces
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Semantic Minimization of 3-Valued Propositional Formulae
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Multi-valued symbolic model-checking
ACM Transactions on Software Engineering and Methodology (TOSEM)
Three-Valued Abstractions of Games: Uncertainty, but with Precision
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Model Checking Vs. Generalized Model Checking: Semantic Minimizations for Temporal Logics
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
3-Valued Abstraction: More Precision at Less Cost
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
FMCAD '06 Proceedings of the Formal Methods in Computer Aided Design
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
Systematic construction of abstractions for model-checking
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
How thorough is thorough enough?
CHARME'05 Proceedings of the 13 IFIP WG 10.5 international conference on Correct Hardware Design and Verification Methods
Why waste a perfectly good abstraction?
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Checking Thorough Refinement on Modal Transition Systems Is EXPTIME-Complete
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
On the consistency, expressiveness, and precision of partial modeling formalisms
Information and Computation
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Weak Alphabet Merging of Partial Behavior Models
ACM Transactions on Software Engineering and Methodology (TOSEM)
Moving from specifications to contracts in component-based design
FASE'12 Proceedings of the 15th international conference on Fundamental Approaches to Software Engineering
EXPTIME-completeness of thorough refinement on modal transition systems
Information and Computation
Hi-index | 0.00 |
Partial models support abstract model-checking of complex temporal properties by combining both over- and under-approximating abstractions into a single model. Over the years, three families of such modeling formalisms have emerged, represented by Kripke Modal Transition Systems (KMTSs), with restrictions on necessary and possible behaviors, Mixed Transition Systems (MixTSs), with relaxation on these restrictions, and Generalized Kripke MTSs (GKMTSs), with hyper-transitions, respectively. In this paper, we compare the three families w.r.t. their expressive power (i.e., what can be modeled, what abstraction can be captured), and the cost and precision of model-checking. We show that these families have the same expressive power (but do differ in succinctness), whereas GKMTSs are more precise (i.e, can establish more properties) for model-checking than the other two families. However, the use of GKMTSs in practice has been hampered by the difficulty of encoding them symbolically. We address this problem by developing a new semantics for temporal logic of partial models that makes the MixTS family as precise for model-checking as the GKMTS family. The outcome is a symbolic model-checking algorithm that combines the efficient symbolic encoding of MixTSs with the model-checking precision of GKMTSs. Our preliminary experiments indicate that the new algorithm is a good match for predicate-abstraction-based model-checkers.