Truncating abstraction of bit-vector operations for BDD-based SMT solvers

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F24%3A00139156" target="_blank" >RIV/00216224:14330/24:00139156 - isvavai.cz</a>

Výsledek na webu

<a href="https://doi.org/10.1016/j.tcs.2024.114664" target="_blank" >https://doi.org/10.1016/j.tcs.2024.114664</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/J.TCS.2024.114664" target="_blank" >10.1016/J.TCS.2024.114664</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Truncating abstraction of bit-vector operations for BDD-based SMT solvers

Popis výsledku v původním jazyce

During the last few years, BDD-based SMT solvers proved to be competitive in deciding satisfiability of quantified bit-vector formulas. However, these solvers usually do not perform well on input formulas with complicated arithmetic. Hitherto, this problem has been alleviated by approximations reducing effective bit-widths of bit-vector variables. In this paper, we propose an orthogonal abstraction technique that works on the level of the individual instances of bit-vector operations. In particular, we compute only several bits of the operation result, which may be sufficient to decide the satisfiability of the formula. Experimental results show that our BDD-based SMT solver Q3B extended with these abstractions can solve more quantified bit-vector formulas from the SMT-LIB repository than SMT solvers Boolector, CVC4, and Z3.

Název v anglickém jazyce

Truncating abstraction of bit-vector operations for BDD-based SMT solvers

Popis výsledku anglicky

During the last few years, BDD-based SMT solvers proved to be competitive in deciding satisfiability of quantified bit-vector formulas. However, these solvers usually do not perform well on input formulas with complicated arithmetic. Hitherto, this problem has been alleviated by approximations reducing effective bit-widths of bit-vector variables. In this paper, we propose an orthogonal abstraction technique that works on the level of the individual instances of bit-vector operations. In particular, we compute only several bits of the operation result, which may be sufficient to decide the satisfiability of the formula. Experimental results show that our BDD-based SMT solver Q3B extended with these abstractions can solve more quantified bit-vector formulas from the SMT-LIB repository than SMT solvers Boolector, CVC4, and Z3.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

<a href="/cs/project/GA23-06506S" target="_blank" >GA23-06506S: Pokročilá analýza a verifikace pro pokročilý software</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2024

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

THEORETICAL COMPUTER SCIENCE

ISSN

0304-3975

e-ISSN

1879-2294

Svazek periodika

1008

Číslo periodika v rámci svazku

114664

Stát vydavatele periodika

NL - Nizozemsko

Počet stran výsledku

22

Strana od-do

1-22

Kód UT WoS článku

001254826000001

EID výsledku v databázi Scopus

2-s2.0-85195574216