Name
Abstract | ||
|---|---|---|
Bit-vector formulas arising from hardware verification problems often contain word-level arithmetic operations. Empirical evidence shows that state-of-the-art SMT solvers are not very efficient at reasoning about bit-vector formulas with multiplication. This is particularly true when multiplication operators are decomposed and represented in alternative ways in the formula. We present a pre-processing heuristic that identifies certain types of decomposed multipliers, and adds special assertions to the input formula that encode the equivalence of sub-terms and word-level multiplication terms. The pre-processed formulas are then solved using an SMT solver. Our experiments with three SMT solvers show that our heuristic allows several formulas to be solved quickly, while the same formulas time out without the pre-processing step. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/978-3-319-52234-0_8 | VERIFICATION, MODEL CHECKING, AND ABSTRACT INTERPRETATION, VMCAI 2017 |
DocType | Volume | ISSN |
Conference | 10145 | 0302-9743 |
Citations | PageRank | References |
1 | 0.35 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Supratik Chakraborty | 1 | 300 | 29.51 |
| Ashutosh Gupta | 2 | 5 | 2.11 |
| Rahul Jain | 3 | 784 | 71.51 |