5499 search results - page 25 / 1100 » Generalized Rewrite Theories |
FSTTCS
2010
Springer
14 years 7 months ago
2010
Springer
Uniqueness of normal forms (UN= ) is an important property of term rewrite systems. UN= is decidable for ground (i.e., variable-free) systems and undecidable in general. Recently ...
ENTCS
2007
14 years 9 months ago
2007
Software model checkers are typically language-specific, require substantial development efforts, and are hard to reuse for other languages. Adding partial order reduction (POR)...
CADE
2012
Springer
13 years 6 days ago
2012
Springer
Abstract. This paper presents new results on the decidability of inductive validity of conjectures. For these results, a class of term rewrite systems (TRSs) with built-in linear i...
TYPES
1998
Springer
15 years 2 months ago
1998
Springer
We define a generic notion of cut that applies to many first-order theories. We prove a generic cut elimination theorem showing that the cut elimination property holds for all theo...
FOSSACS
2004
Springer
15 years 3 months ago
2004
Springer
Several types of term rewriting systems can be distinguished by the way their rules overlap. In particular, we define the classes of prefix, suffix, bottom-up and top-down system...