Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Constructing automata from temporal logic formulas: a tutorial
Lectures on formal methods and performance analysis
Simple on-the-fly automatic verification of linear temporal logic
Proceedings of the Fifteenth IFIP WG6.1 International Symposium on Protocol Specification, Testing and Verification XV
A Fixpoint Based Encoding for Bounded Model Checking
FMCAD '02 Proceedings of the 4th International Conference on Formal Methods in Computer-Aided Design
Improving the Encoding of LTL Model Checking into SAT
VMCAI '02 Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation
Lazy Theorem Proving for Bounded Model Checking over Infinite Domains
CADE-18 Proceedings of the 18th International Conference on Automated Deduction
A resolution method for temporal logic
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
A Compact Linear Translation for Bounded Model Checking
Electronic Notes in Theoretical Computer Science (ENTCS)
Bounded model checking for weak alternating büchi automata
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
SAT: Based bounded strong satisfiability checking of reactive system specifications
ICT-EurAsia'13 Proceedings of the 2013 international conference on Information and Communication Technology
| Hi-index | 0.00 |
Model checking of LTL formulaeis traditionally carried out by a conversion to Buchi automata, and there is therefore a large body of research in this area including some recent studies on the use of alternating automata as an intermediate representation. Bounded model checking has until recently been apart from this, typically using a direct conversion from LTL to propositional logic. In this paper we give a new bounded model checking encoding using alternating automata and focus on the relationship between alternating automata and SNF. We also explore the differences in the way SNF, alternating, and Buchi automata are used from both a theoretical and an experimental perspective.