Publications

Authors:

Alessandro, Armando; Bonacina, Maria Paola; Silvio, Ranise; Stephan, Schulz

Title:

New results on rewrite-based satisfiability procedures

Year:

2009

Type of item:

Articolo in Rivista

Tipologia ANVUR:

Articolo su rivista

Language:

Inglese

Format:

A Stampa

Referee:

Sì

Name of journal:

ACM Transactions on Computational Logic

ISSN of journal:

1529-3785

N° Volume:

1

Number or Folder:

10

:

ACM

Page numbers:

129-179

Keyword:

Decision procedures; satisfiability modulo theories; combination of theories; inference; superposition; rewriting; termination; scalability

Short description of contents:

Program analysis and verification require decision procedures to reason on theories of data structures. Many problems can be reduced to the satisfiability of sets of ground literals in a theory T. If a sound and complete inference system for first-order logic is guaranteed to terminate on T-satisfiability problems, a theorem-proving strategy with that system and a fair search plan is a T-satisfiability procedure. We prove termination of a rewrite-based first-order engine on the theories of records, integer offsets, integer offsets modulo and lists. We give a modularity theorem stating sufficient conditions for termination on a combinations of theories, given termination on each. The above theories, as well as others, satisfy these conditions. We introduce several sets of benchmarks on these theories and their combinations, including both parametric synthetic benchmarks to test scalability, and real-world problems to test performances on huge sets of literals. We compare the rewrite-based theorem prover E with the validity checkers CVC and CVC Lite. Contrary to the folklore that a general-purpose prover cannot compete with reasoners with built-in theories, the experiments are overall favorable to the theorem prover, showing that not only the rewriting approach is elegant and conceptually simple, but has important practical implications.

Web page:

http://doi.acm.org/10.1145/1459010.1459014
https://mariapaola.github.io/

Product ID:

33854

Handle IRIS:

11562/225588

Deposited On:

March 15, 2012

Last Modified:

September 15, 2023

Bibliographic citation:

Alessandro, Armando; Bonacina, Maria Paola; Silvio, Ranise; Stephan, Schulz, New results on rewrite-based satisfiability procedures «ACM Transactions on Computational Logic» , vol. 1 , n. 10 , 2009 , pp. 129-179

Consulta la scheda completa presente nel repository istituzionale della Ricerca di Ateneo