251 search results - page 3 / 51 » Automated Complexity Analysis Based on the Dependency Pair M... |
FSTTCS
2008
Springer
14 years 10 months ago
2008
Springer
For a given (terminating) term rewriting system one can often estimate its derivational complexity indirectly by looking at the proof method that established termination. In this s...
ICST
2008
IEEE
15 years 4 months ago
2008
IEEE
This paper introduces a new method for generating test data that combines the benefits of equivalence partitioning, boundary value analysis and cause-effect analysis. It is suitab...
ATVA
2009
Springer
15 years 4 months ago
2009
Springer
We present a new approach for automatic verification of data-dependent programs manipulating dynamic heaps. A heap is encoded by a graph where the nodes represent the cells, and t...
LOPSTR
2009
Springer
15 years 4 months ago
2009
Springer
We show how to combine the two most powerful approaches for automated termination analysis of logic programs (LPs): the direct approach which operates directly on LPs and the trans...
110
click to vote
COMPSAC
2003
IEEE
15 years 2 months ago
2003
IEEE
In this paper, we propose an algorithm to construct the Ordered Binary Decision Diagram (OBDD) representing the cut function of a terminal-pair network. The algorithm recognizes i...