LTL Generalized Model Checking Revisited
VMCAI '09 Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation
Mixed Transition Systems Revisited
VMCAI '09 Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation
On the Complexity of Semantic Self-minimization
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)
Modal and mixed specifications: Key decision problems and their complexities
Mathematical Structures in Computer Science
More precise partition abstractions
VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
On the consistency, expressiveness, and precision of partial modeling formalisms
Information and Computation
Policy auditing over incomplete logs: theory, implementation and applications
Proceedings of the 18th ACM conference on Computer and communications security
Understanding and protecting privacy: formal semantics and principled audit mechanisms
ICISS'11 Proceedings of the 7th international conference on Information Systems Security
| Hi-index | 0.01 |
Three-valued models, in which properties of a system are either true, false or unknown, have recently been advocated as a better representation for reactive program abstractions generated by automatic techniques such as predicate abstraction. Indeed, for the same cost, model checking three-valued abstractions can be used to both prove and disprove any temporal-logic property, whereas traditional conservative abstractions can only prove universal properties. Also, verification results can be more precise with generalized model checking, which checks whether there exists a concretization of an abstraction satisfying a temporal-logic formula. Since generalized model checking includes satis- fiability as a special case (when everything in the model is unknown), it is in general more expensive than traditional model checking. In this paper, we study how to reduce generalized model checking to model checking by a temporallogic formula transformation, which generalizes a transformation for propositional logic known as semantic minimization in the literature. We show that many temporallogic formulas of practical interest are self-minimizing, i.e., are their own semantic minimizations, and hence that model checking for these formulas has the same precision as generalized model checking.