Ítem
|
Bofill Arasa, Miquel
Nieuwenhuis, Robert Oliveras Llunell, Albert Rodríguez Carbonell, Enric Rubio, Albert |
|
| The extensional theory of arrays is one of the most important ones for applications of SAT Modulo Theories (SMT) to hardware and software verification. Here we present a new T-solver for arrays in the context of the DPLL(T) approach to SMT. The main characteristics of our solver are: (i) no translation of writes into reads is needed, (ii) there is no axiom instantiation, and (iii) the T-solver interacts with the Boolean engine by asking to split on equality literals between indices. As far as we know, this is the first accurate description of an array solver integrated in a state-of-the-art SMT solver and, unlike most state-of-the-art solvers, it is not based on a lazy instantiation of the array axioms. Moreover, it is very competitive in practice, specially on problems that require heavy reasoning on array literals | |
| http://hdl.handle.net/2072/218201 | |
| eng | |
| IEEE (Institute of Electrical and Electronics Engineers) | |
| Tots els drets reservats | |
|
Algorismes computacionals
Computer algorithms Models, Teoria dels Model theory Lògica matemàtica Logic, Symbolic and mathematical Matrius (Matemàtica) Matrices |
|
| A Write-Based Solver for SAT Modulo the Theory of Arrays | |
| info:eu-repo/semantics/article | |
| Recercat |
