18 search results - page 1 / 4 » Semantic Labelling for Proving Termination of Combinatory Re... |
114
Voted
WFLP
2009
Springer
15 years 5 months ago
2009
Springer
103
click to vote
ESSLLI
2009
Springer
14 years 8 months ago
2009
Springer
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...
ENTCS
2008
14 years 10 months ago
2008
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...
ENTCS
2008
14 years 10 months ago
2008
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&#...
RTA
2004
Springer
15 years 4 months ago
2004
Springer
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...