Sciweavers

18 search results - page 1 / 4
» Semantic Labelling for Proving Termination of Combinatory Re...
Sort
View
101
Voted
ESSLLI
2009
Springer
14 years 7 months ago
POP* and Semantic Labeling Using SAT
The polynomial path order (POP for short) is a termination method that induces polynomial bounds on the innermost runtime complexity of term rewrite systems (TRSs for short). Seman...
Martin Avanzini
ENTCS
2008
85views more  ENTCS 2008»
14 years 10 months ago
Innermost Termination of Rewrite Systems by Labeling
Semantic labeling is a powerful transformation technique for proving termination of term rewrite systems. The semantic part is given by a model or a quasi-model of the rewrite rul...
René Thiemann, Aart Middeldorp
ENTCS
2008
102views more  ENTCS 2008»
14 years 10 months ago
Towards a Systematic Method for Proving Termination of Graph Transformation Systems
We describe a method for proving the termination of graph transformation systems. The method is based on the fact that infinite reductions must include infinite `creation chains&#...
Harrie Jan Sander Bruggink
RTA
2004
Springer
15 years 3 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