A decision procedure for combinations of propositional temporal logic and other specialized theories
Journal of Automated Reasoning
Concerning the semantic consequence relation in first-order temporal logic
Theoretical Computer Science
Incompleteness of first-order temporal logic with until
Theoretical Computer Science
Theoretical Computer Science
On the interpretability of arithmetic in temporal logic
Theoretical Computer Science
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
Model checking
Simplification by Cooperating Decision Procedures
ACM Transactions on Programming Languages and Systems (TOPLAS)
Unions of non-disjoint theories and combinations of satisfiability procedures
Theoretical Computer Science
Construction of Abstract State Graphs with PVS
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
CAV '00 Proceedings of the 12th 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
NuSMV 2: An OpenSource Tool for Symbolic Model Checking
CAV '02 Proceedings of the 14th 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
General decidability theorems for infinite-state systems
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Model-Theoretic Methods in Combined Constraint Satisfiability
Journal of Automated Reasoning
A comprehensive combination framework
ACM Transactions on Computational Logic (TOCL)
Combination Methods for Satisfiability and Model-Checking of Infinite-State Systems
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Noetherianity and Combination Problems
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
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
Applications of craig interpolants in model checking
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Towards a model-checker for counter systems
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
| Hi-index | 0.00 |
We present a decidability result for the model checking of a certain class of properties that can be conveniently expressed as ground formulae of a first-order temporal fragment. The decidability result is obtained by importing into the context of model-checking problems some techniques developed for the combination of decision procedures for the satisfiability of constraints. The general decidability result is then specialized for checking properties of particular interest, such as liveness and safety, and, for the latter case, a more optimized algorithm has been proposed.