A decision procedure for combinations of propositional temporal logic and other specialized theories
Journal of Automated Reasoning
Temporal verification of reactive systems: safety
Temporal verification of reactive systems: safety
Formal Methods in System Design - Special issue on The First Federated Logic Conference (FLOC'96), part II
Simplification by Cooperating Decision Procedures
ACM Transactions on Programming Languages and Systems (TOPLAS)
Automatic Deductive Verification with Invisible Invariants
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Construction of Abstract State Graphs with PVS
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
A Unifying Model Checking Approach for Safety Properties of Parameterized Systems
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Lazy Theorem Proving for Bounded Model Checking over Infinite Domains
CADE-18 Proceedings of the 18th International Conference on Automated Deduction
Model-Theoretic Methods in Combined Constraint Satisfiability
Journal of Automated Reasoning
Interpolation in local theory extensions
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Decidability and undecidability results for nelson-oppen and rewrite-based decision procedures
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Towards a model-checker for counter systems
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Hierarchical and Modular Reasoning in Complex Theories: The Case of Local Theory Extensions
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
Noetherianity and Combination Problems
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
Formalizing requirements with object models and temporal constraints
Software and Systems Modeling (SoSyM)
A Decidability Result for the Model Checking of Infinite-State Systems
Journal of Automated Reasoning
Hierarchical reasoning for the verification of parametric systems
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
SMT-based scenario verification for hybrid systems
Formal Methods in System Design
Hi-index | 0.00 |
Manna and Pnueli have extensively shown how a mixture of first-order logic (FOL) and discrete Linear time Temporal Logic (LTL) is sufficient to precisely state verification problems for the class of reactive systems. Theories in FOL model the (possibly infinite) data structures used by a reactive system while LTL specifies its (dynamic) behavior. In this paper, we derive undecidability and decidability results for both the satisfiability of (quantifier-free) formulae and the model-checking of safety properties by lifting combination methods for (non-disjoint) theories in FOL. The proofs of our decidability results suggest how decision procedures for the constraint satisfiability problem of theories in FOL and algorithms for checking the satisfiability of propositional LTL formulae can be integrated. This paves the way to employ efficient Satisfiability Modulo Theories solvers in the model-checking of infinite state systems. We illustrate our techniques on two examples.