The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs

@inproceedings{Giesl2004TheDP,
  title={The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs},
  author={J. Giesl and R. Thiemann and Peter Schneider-Kamp},
  booktitle={LPAR},
  year={2004}
}
  • J. Giesl, R. Thiemann, Peter Schneider-Kamp
  • Published in LPAR 2004
  • Computer Science
  • The dependency pair approach is one of the most powerful techniques for automated termination proofs of term rewrite systems. Up to now, it was regarded as one of several possible methods to prove termination. In this paper, we show that dependency pairs can instead be used as a general concept to integrate arbitrary techniques for termination analysis. In this way, the benefits of different techniques can be combined and their modularity and power are increased significantly. We[2] refer to… CONTINUE READING

    Topics from this paper.

    Proving and Disproving Termination of Higher-Order Functions
    159
    Mechanizing and Improving Dependency Pairs
    183
    A Dependency Pair Framework for A OR C-Termination
    16
    Termination of Narrowing with Dependency Pairs
    3
    Termination of Narrowing Using Dependency Pairs
    9

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 34 REFERENCES
    Improving Dependency Pairs
    48
    Modular Termination Proofs for Rewriting Using Dependency Pairs
    88
    Improved Modular Termination Proofs Using Dependency Pairs
    39
    Termination of term rewriting using dependency pairs
    548
    Verification of Erlang Processes by Dependency Pairs
    59
    Automated Termination Proofs with AProVE
    158
    Termination of Term Rewriting by Semantic Labelling
    196
    Argument Filtering Transformation
    81
    Dependency Pairs Revisited
    77
    Abstract Relations between Restricted Termination and Confluence Properties of Rewrite Systems
    83