The theory of arrays is ubiquitous in the context of software and hardware verification and
symbolic analysis. The basic array theory was introduced by McCarthy and allows to …

We show how a well-known superposition-based inference system for first-order equational
logic can be used almost directly for deciding satisfiability in various theories including lists …

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 …

Although different satisfiability decision procedures can be combined by algorithms such as
those of Nelson–Oppen or Shostak, current tools typically can only support a finite number of …

Satisfiability is the problem of deciding whether a formula has a model. Although it is not
even semidecidable in first-order logic, it is decidable in some first-order theories or …

Satisfiability modulo theories (SMT) solvers are efficient tools to decide the satisfiability of
ground formulas, including a number of built-in theories such as congruence, linear …

Rewriting logic is both a logical framework where many logics can be naturally represented,
and a semantic framework where many computational systems and programming …

Verification problems require to reason in theories of data structures and fragments of
arithmetic. Thus, decision procedures for such theories are needed, to be embedded in, or …

This paper deals with decision procedures specified by using a superposition calculus
which is an inference system at the core of all equational theorem provers. This calculus is …

Verification problems can often be encoded as first-order validity or satisfiability problems.
The availability of efficient automated theorem provers is a crucial pre-requisite for …