12 search results - page 1 / 3 » A Theory of Singly-Linked Lists and its Extensible Decision ... |
SEFM
2006
IEEE
13 years 10 months ago
2006
IEEE
The key to many approaches to reason about pointerbased data structures is the availability of a decision procedure to automatically discharge proof obligations in a theory encomp...
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...
CADE
2004
Springer
14 years 4 months ago
2004
Springer
contexts such as construction of abstractions, speed may be favored over completeness, so that undecidable theories (e.g., nonlinear integer arithmetic) and those whose decision pr...
CAV
2004
Springer
13 years 10 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...
CADE
2007
Springer
14 years 4 months ago
2007
Springer
Manna and Pnueli have extensively shown how a mixture of first-order logic (FOL) and discrete Linear time Temporal Logic (LTL) is sufficient to precisely state verification problem...