Mechanizing and Improving Dependency Pairs

Abstract

The dependency pair technique is a powerful method for automated termination and innermost termination proofs of term rewrite systems (TRSs). For any TRS, it generates inequality constraints that have to be satisfied by well-founded orders. We improve the dependency pair technique by considerably reducing the number of constraints produced for (innermost) termination proofs. Moreover, we extend transformation techniques to manipulate dependency pairs that simplify (innermost) termination proofs significantly. To fully mechanize the approach, we show how transformations and the search for suitable orders can be mechanized efficiently. We implemented our results in the automated termination prover AProVE and evaluated them on large collections of examples.

DOI: 10.1007/s10817-006-9057-7

Extracted Key Phrases

3 Figures and Tables

020406020072008200920102011201220132014201520162017
Citations per Year

260 Citations

Semantic Scholar estimates that this publication has 260 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Giesl2006MechanizingAI, title={Mechanizing and Improving Dependency Pairs}, author={J{\"{u}rgen Giesl and Ren{\'e} Thiemann and Peter Schneider-Kamp and Stephan Falke}, journal={Journal of Automated Reasoning}, year={2006}, volume={37}, pages={155-203} }