The complexity of propositional linear temporal logics
Journal of the ACM (JACM)
Can message buffers be axiomatized in linear temporal logic?
Information and Control
The complementation problem for Bu¨chi automata with applications to temporal logic
Theoretical Computer Science
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Symbolic model checking: 1020 states and beyond
Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
Reasoning about infinite computations
Information and Computation
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
A really abstract concurrent model and its temporal logic
POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A Concatenation Game and the Dot-Depth Hierarchy
Computation Theory and Logic, In Memory of Dieter Rödding
The ForSpec Temporal Logic: A New Temporal Property-Specification Language
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Weak automata for the linear time µ-calculus
VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
Encodings of Bounded LTL Model Checking in Effectively Propositional Logic
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
An Automata-Theoretic Dynamic Completeness Criterion for Bounded Model-Checking
VMCAI '09 Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation
A new approach to bounded model checking for branching time logics
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Solving parity games by a reduction to SAT
Journal of Computer and System Sciences
Symbolic implementation of alternating automata
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Bounded model checking for weak alternating büchi automata
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
| Hi-index | 0.00 |
The technique of bounded model checking is extended to the linear time @m-calculus, a temporal logic that can express all monadic second-order properties of @w-words, in other words, all @w-regular languages. Experimental evidence is presented showing that the method can be successfully employed for properties that are hard or impossible to express in the weaker logic LTL that is traditionally used in bounded model checking.