50 search results - page 1 / 10 » Rewrite-Based Satisfiability Procedures for Recursive Data S... |
ENTCS
2007
13 years 4 months ago
2007
ENTCS
2007
13 years 4 months ago
2007
The rewrite-based approach to satisfiability modulo theories consists of using generic theorem-proving strategies for first-order logic with equality. If one can prove that an i...
IIE
2007
13 years 4 months ago
2007
Abstract. A reversible sequence of steps from the specification of the algorithm and the mathematical definition of the recurrent solution through the recursive procedure, the ta...
CADE
2004
Springer
14 years 5 months ago
2004
Springer
This paper is concerned with the integration of recursive data structures with Presburger arithmetic. The integrated theory includes a length function on data structures, thus prov...
TACAS
2010
Springer
13 years 12 months ago
2010
Springer
Many algorithms on data structures such as terms (finitely branching trees) are naturally implemented by second-order recursion: A first-order procedure f passes itself as an arg...