846 search results - page 14 / 170 » Rewrite-Based Decision Procedures |
LATIN
2004
Springer
14 years 3 months ago
2004
Springer
Equality logic with or without uninterpreted functions is used for proving the equivalence or refinement between systems (hardware verification, compiler’s translation, etc). C...
CADE
2004
Springer
14 years 10 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...
CADE
2009
Springer
14 years 10 months ago
2009
Springer
Abstract. We give an optimal (exptime), sound and complete tableaubased algorithm for deciding satisfiability for propositional dynamic logic. Our main contribution is a sound meth...
POPL
2010
ACM
14 years 7 months ago
2010
ACM
VMCAI
2010
Springer
14 years 4 months ago
2010
Springer