URBiVA: Uniform Reduction to Bit-Vector Arithmetic
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.
KeywordsConstraint Satisfaction Problem Symbolic Execution Standard Semantic Abstract Syntax Tree Uniform Reduction
Unable to display preview. Download preview PDF.
- 1.Brinkmann, R., Drechsler, R.: Rtl-datapath verification using integer linear programming. In: Proceedings of the VLSI Design 2002. IEEE Computer Society, Los Alamitos (2002)Google Scholar
- 2.Brummayer, R., Biere, A.: Boolector: An efficient smt solver for bit-vectors and arrays. In: Kowalewski, S., Philippou, A. (eds.) TACAS 2009. LNCS, vol. 5505, pp. 178–181. Springer, Heidelberg (2009)Google Scholar
- 4.Bryant, R.E., Kroening, D., Ouaknine, J., Seshia, S.A., Strichman, O., Brady, B.A.: An abstraction-based decision procedure for bit-vector arithmetic. STTT 11(2) (2009)Google Scholar
- 5.Janičić, P.: Uniform Reduction to SAT (manuscript submitted) (2010)Google Scholar
- 6.Marić, F.: Formalization and Implementation of Modern SAT Solvers. Journal of Automated Reasoning 43(1) (2009)Google Scholar