36 search results - page 3 / 8 » Decision procedures for extensions of the theory of arrays |
FROCOS
2005
Springer
14 years 1 months ago
2005
Springer
We define a general notion of a fragment within higher order type theory; a procedure for constraint satisfiability in combined fragments is outlined, following Nelson-Oppen sche...
CADE
2007
Springer
14 years 8 months ago
2007
Springer
Much research concerning Satisfiability Modulo Theories is devoted to the design of efficient SMT-solvers that integrate a SATsolver with T -satisfiability procedures. The rewrite-...
CAV
2004
Springer
14 years 1 months ago
2004
Springer
The logic of equality with uninterpreted functions (EUF) and its extensions have been widely applied to processor verification, by means of a large variety of progressively more s...
LPAR
2010
Springer
13 years 6 months ago
2010
Springer
The classic method of Nelson and Oppen for combining decision procedures requires the theories to be stably-infinite. Unfortunately, some important theories do not fall into this...
ATVA
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. We present a first-order theory of (finite) sequences with integer elements, Presburger arithmetic, and regularity constraints, which can model significant properties of ...