149 search results - page 2 / 30 » The Derivational Complexity Induced by the Dependency Pair M... |
CADE
2008
Springer
14 years 5 months ago
2008
Springer
In this paper, we present a variant of the dependency pair method for analysing runtime complexities of term rewrite systems automatically. This method is easy to implement, but si...
LPAR
2010
Springer
13 years 3 months ago
2010
Springer
Matrix interpretations can be used to bound the derivational complexity of term rewrite systems. In particular, triangular matrix interpretations over the natural numbers are known...
RTA
2009
Springer
13 years 12 months ago
2009
Springer
Abstract. We show how polynomial path orders can be employed efficiently in conjunction with weak innermost dependency pairs to automatically certify the polynomial runtime comple...
AAECC
2005
Springer
13 years 5 months ago
2005
Springer
Abstract In [24], a new size-change principle was proposed to verify termination of functional programs automatically. We extend this principle in order to prove termination and in...
ASAP
2004
IEEE
13 years 9 months ago
2004
IEEE
The Compaan compiler automatically derives a Process Network (PN) description from an application written in Matlab. The basic element of a PN is a Producer/Consumer (P/C) pair. F...