Abstraction of Bit-Vector Operations for BDD-Based SMT Solvers

Author(s):  
Martin Jonáš ◽  
Jan Strejček
Keyword(s):  
10.29007/spnx ◽  
2018 ◽  
Author(s):  
Martin Jonáš ◽  
Jan Strejček

In general, deciding satisfiability of quantified bit-vector formulas becomes harder with increasing maximal allowed bit-width of variables and constants. However, this does not have to be the case for formulas that come from practical applications. For example, software bugs often do not depend on the specific bit-width of the program variables and would manifest themselves also with much lower bit-widths. We experimentally evaluate this thesis and show that satisfiability of the vast majority of quantified bit-vector formulas from the smt-lib repository remains the same even after reducing bit-widths of variables to a very small number. This observation may serve as a starting-point for development of heuristics or other techniques that can improve performance of smt solvers for quantified bit-vector formulas.


1998 ◽  
Author(s):  
Clark W. Barrett ◽  
David L. Dill ◽  
Jeremy R. Levitt

Author(s):  
Mohammad Mehdi Pourhashem Kallehbasti ◽  
Matteo Giovanni Rossi ◽  
Luciano Baresi
Keyword(s):  

2021 ◽  
Vol 66 ◽  
pp. 162-175
Author(s):  
H.R. Schmidtke
Keyword(s):  

2020 ◽  
Vol 4 (OOPSLA) ◽  
pp. 1-25
Author(s):  
Dominik Winterer ◽  
Chengyu Zhang ◽  
Zhendong Su
Keyword(s):  

2013 ◽  
Vol 78 (3) ◽  
pp. 310-326 ◽  
Author(s):  
David Déharbe
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document