209 search results - page 15 / 42 » Termination of Priority Rewriting |
113
click to vote
CSL
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. We give the first mechanized proof of the fact that for showing termination of a term rewrite system, we may restrict to well-formed terms using just the function symbols...
96
Voted
PLILP
1998
Springer
15 years 6 months ago
1998
Springer
A property P of term rewriting systems is persistent if for any many-sorted term rewriting system R, R has the property P if and only if its underlying term rewriting system (R), ...
154
click to vote
RTA
2011
Springer
14 years 4 months ago
2011
Springer
Given an equational system, completion procedures compute an equivalent and complete (terminating and confluent) term rewrite system. We present a very simple and efficient compl...
132
click to vote
CADE
2007
Springer
16 years 2 months ago
2007
Springer
Abstract. A method based on dependency pairs for showing termination of functional programs on data structures generated by constructors with relations is proposed. A functional pr...
134
Voted
CAV
2012
Springer
13 years 4 months ago
2012
Springer
Abstract. In earlier work, we developed a technique to prove termination of Java programs automatically: first, Java programs are automatically transformed to term rewrite systems...