Symbolic model checking: an approach to the state explosion problem
Symbolic model checking: an approach to the state explosion problem
Property specification patterns for finite-state verification
FMSP '98 Proceedings of the second workshop on Formal methods in software practice
Patterns in property specifications for finite-state verification
Proceedings of the 21st international conference on Software engineering
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Characterizing Correctness Properties of Parallel Programs Using Fixpoints
Proceedings of the 7th Colloquium on Automata, Languages and Programming
Symbolic Model Checking without BDDs
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
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
VIS: A System for Verification and Synthesis
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
The Declarative Past and Imperative Future: Executable Temporal Logic for Interactive Systems
Temporal Logic in Specification
A resolution method for CTL branching-time temporal logic
TIME '97 Proceedings of the 4th International Workshop on Temporal Representation and Reasoning (TIME '97)
A resolution method for temporal logic
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
A Compact Linear Translation for Bounded Model Checking
Electronic Notes in Theoretical Computer Science (ENTCS)
Bounded Model Checking with SNF, Alternating Automata, and Büchi Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
Termination Criteria for Bounded Model Checking: Extensions and Comparison
Electronic Notes in Theoretical Computer Science (ENTCS)
Improved SAT based bounded model checking
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Simple is better: efficient bounded model checking for past LTL
VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
Towards a notion of unsatisfiable and unrealizable cores for LTL
Science of Computer Programming
| Hi-index | 0.00 |
The Bounded Model Checking approach to the LTL model checking problem, based on an encoding to Boolean satisfiability, has seen a growth in popularity due to recent improvements in SAT technology. The currently available encodings have certain shortcomings, particularly in the size of the clause forms that it generates. We address this by making use of the established correspondence between temporal logic expressions and the fixpoints of predicate transformers as used in symbolic model checking. We demonstrate how an encoding based on fixpoints can result in improved performance in the SAT checker.