ComputingComputer ScienceAlgorithmsProgramming LanguagesTheory Of ComputationBoolean AlgebraModel CheckingParsingSyntactic AnalysisQuantifier Semantics
This is a proposal for a bit-precise word-level format, called BTOR. It is easy to parse and has precise semantics. In its basic form it allows to model SMT problems over the quantifier-free theory of bit-vectors in combination with one-dimensional arrays. Our main contribution is a sequential extension that can be used to capture model checking problems on the word-level. We present two case studies where BTOR is used as sequential format. Finally, we report on experimental results for the model checking extension of our SMT solver Boolector.
7
Willem Visser, Klaus Havelund, Guillaume Brat et al. · Automated Software Engineering · 2003 · 1.4K citations
Automatically Validating Temporal Safety Properties of Interfaces
2001 · 605 citations
Armin Biere · Journal on Satisfiability Boolean Modeling and Computation · 2008 · 180 citations · Full text