A machine program for theorem-proving
Communications of the ACM
Symbolic Model Checking
Journal of Automated Reasoning
Symbolic Model Checking without BDDs
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Benefits of Bounded Model Checking at an Industrial Setting
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
Accelerating Bounded Model Checking of Safety Properties
Formal Methods in System Design
AI Communications
Bounded Model Checking for All Regular Properties
Electronic Notes in Theoretical Computer Science (ENTCS)
The CADE-21 automated theorem proving system competition
AI Communications
Deciding Effectively Propositional Logic Using DPLL and Substitution Sets
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Proof Systems for Effectively Propositional Logic
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Instantiation-Based Automated Reasoning: From Theory to Practice
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Labelled unit superposition calculi for instantiation-based reasoning
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
The 5th IJCAR automated theorem proving system competition - CASC-J5
AI Communications
An incremental answer set programming based system for finite model computation
AI Communications - Answer Set Programming
Finite model computation via answer set programming
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
EPR-based bounded model checking at word level
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Symbolic backward reachability with effectively propositional logic
Formal Methods in System Design
| Hi-index | 0.00 |
We present an encoding of LTL bounded model checking problems within the Bernays-Schönfinkel fragment of first-order logic. This fragment, which also corresponds to the category of effectively propositional problems (EPR) of the CASC system competitions, allows a natural and succinct representation of both a software/hardware system and the property that one wants to verify.The encoding for the transition system produces a formula whose size is linear with respect to its original description in common component description languages used in the field (e.g. smvformat) preserving its modularity and hierarchical structure. Likewise, the LTL property is encoded in a formula of linear size with respect to the input formula, plus an additional component, with a size of O(logk) where kis the bound, that represents the execution flow of the system.The encoding of bounded model checking problems by effectively propositional formulae is the main contribution of this paper. As a side effect, we obtain a rich collection of benchmarks with close links to real-life applications for the automated reasoning community.