Sciweavers

Share
RTA
2010
Springer
10 years 2 months ago
Certified Subterm Criterion and Certified Usable Rules
Abstract. In this paper we present our formalization of two important termination techniques for term rewrite systems: the subterm criterion and the reduction pair processor in com...
Christian Sternagel, René Thiemann
RTA
2004
Springer
10 years 4 months ago
TORPA: Termination of Rewriting Proved Automatically
Abstract. In this paper it is described how a combination of polynomial interpretations, recursive path order, RFC match-bounds, the dependency pair method and semantic labelling c...
Hans Zantema
CADE
2004
Springer
10 years 4 months ago
Improved Modular Termination Proofs Using Dependency Pairs
The dependency pair approach is one of the most powerful techniques for automated (innermost) termination proofs of term rewrite systems (TRSs). For any TRS, it generates inequalit...
René Thiemann, Jürgen Giesl, Peter Sch...
LPAR
2005
Springer
10 years 4 months ago
Recursive Path Orderings Can Also Be Incremental
In this paper the Recursive Path Ordering is adapted for proving termination of rewriting incrementally. The new ordering, called Recursive Path Ordering with Modules, has as ingre...
Mirtha-Lina Fernández, Guillem Godoy, Alber...
DAC
2006
ACM
10 years 11 months ago
Automatic invariant strengthening to prove properties in bounded model checking
In this paper, we present a method that helps improve the performance of Bounded Model Checking by automatically strengthening invariants so that the termination proof may be obta...
Mohammad Awedh, Fabio Somenzi
books