Speeding up Quantified Bit-Vector SMT Solvers by Bit-Width Reductions and Extensions
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F20%3A00114392" target="_blank" >RIV/00216224:14330/20:00114392 - isvavai.cz</a>
Result on the web
<a href="https://link.springer.com/chapter/10.1007%2F978-3-030-51825-7_27" target="_blank" >https://link.springer.com/chapter/10.1007%2F978-3-030-51825-7_27</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-030-51825-7_27" target="_blank" >10.1007/978-3-030-51825-7_27</a>
Alternative languages
Result language
angličtina
Original language name
Speeding up Quantified Bit-Vector SMT Solvers by Bit-Width Reductions and Extensions
Original language description
Recent experiments have shown that satisfiability of a quantified bit-vector formula coming from practical applications almost never changes after reducing all bit-widths in the formula to a small number of bits. This paper proposes a novel technique based on this observation. Roughly speaking, a given quantified bit-vector formula is reduced and sent to a solver, an obtained model is then extended to the original bit-widths and verified against the original formula. We also present an experimental evaluation demonstrating that this technique can significantly improve the performance of state-of-the-art smt solvers Boolector, CVC4, and Q3B on quantified bit-vector formulas from the smt-lib repository.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/GA18-02177S" target="_blank" >GA18-02177S: Abstraction and Other Techniques in Semi-Symbolic Program Verification</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2020
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Theory and Applications of Satisfiability Testing - SAT 2020 - 23rd International Conference, Alghero, Italy, July 3-10, 2020, Proceedings
ISBN
9783030518240
ISSN
0302-9743
e-ISSN
—
Number of pages
16
Pages from-to
378-393
Publisher name
Springer
Place of publication
Cham (Switzerland)
Event location
Alghero (Italy)
Event date
Jan 1, 2020
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000711645300027