142 search results - page 13 / 29 » Total Termination of Term Rewriting |
PEPM
2010
ACM
13 years 9 months ago
2010
ACM
Software engineering, automated reasoning, rule-based programming or specifications often use rewriting systems for which termination, among other properties, may have to be ensur...
DAGSTUHL
2007
13 years 9 months ago
2007
Abstract. The dependency pair technique is a powerful modular method for automated termination proofs of term rewrite systems. We first show that dependency pairs are also suitabl...
CAV
2012
Springer
11 years 10 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...
IFIP
2004
Springer
14 years 26 days ago
2004
Springer
A term terminates if all its reduction sequences are of finite length. We show four type systems that ensure termination of well-typed π-calculus processes. The systems are obtai...
SOFSEM
2010
Springer
14 years 4 months ago
2010
Springer
We present a new technique to prove termination of Term Rewriting Systems, with full automation. A crucial task in this context is to find suitable well-founded orderings. A popul...