RTL-Datapath Verification using Integer Linear Programming
ASP-DAC '02 Proceedings of the 2002 Asia and South Pacific Design Automation Conference
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
An abstraction-based decision procedure for bit-vector arithmetic
International Journal on Software Tools for Technology Transfer (STTT)
Boolector: An Efficient SMT Solver for Bit-Vectors and Arrays
TACAS '09 Proceedings of the 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009,
Formalization and Implementation of Modern SAT Solvers
Journal of Automated Reasoning
POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
LLBMC: bounded model checking of C and C++ programs using a compiler IR
VSTTE'12 Proceedings of the 4th international conference on Verified Software: theories, tools, experiments
| Hi-index | 0.00 |
We describe a system URBiVA for specifying and solving a range of problems by uniformly reducing them to bit-vector arithmetic (bva). A problem description is given in a C-like specification language and this high-level specification is transformed to a bva formula by symbolic execution. The formula is passed to a bva solver and, if it is satisfiable, its models give solutions of the problem. The system can be used for efficient modelling (specifying and solving) of a wide class of problems. Several state-of-the-art solvers for bva are currently used (Boolector, MathSAT, Yices) and additional solvers can be easily included. Hence, the system can be used not only as a specification and solving tool, but also as a platform for evaluation and comparison between bva solvers.