Automated Termination Proofs with AProVE
- 1 January 2004
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 210-220
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- TORPA: Termination of Rewriting Proved AutomaticallyLecture Notes in Computer Science, 2004
- Improved Modular Termination Proofs Using Dependency Pairs2004
- Improving Dependency PairsLecture Notes in Computer Science, 2003
- Modular Termination Proofs for Rewriting Using Dependency PairsJournal of Symbolic Computation, 2002
- A General Framework for Automatic Termination Analysis of Logic ProgramsApplicable Algebra in Engineering, Communication and Computing, 2001
- Termination of Logic Programs: Transformational Methods RevisitedApplicable Algebra in Engineering, Communication and Computing, 2001
- Verification of Erlang Processes by Dependency PairsApplicable Algebra in Engineering, Communication and Computing, 2001
- Termination of term rewriting using dependency pairsTheoretical Computer Science, 2000
- Automating the Knuth Bendix orderingActa Informatica, 1990
- Termination of rewritingJournal of Symbolic Computation, 1987