Certification of Termination Proofs Using CeTA

@inproceedings{Thiemann2009CertificationOT,
  title={Certification of Termination Proofs Using CeTA},
  author={Ren{\'e} Thiemann and Christian Sternagel},
  booktitle={TPHOLs},
  year={2009}
}
There are many automatic tools to prove termination of term rewrite systems, nowadays. Most of these tools use a combination of many complex termination criteria. Hence generated proofs may be of tremendous size, which makes it very tedious (if not impossible) for humans to check those proofs for correctness. In this paper we use the theorem prover Isabelle/HOL to automatically certify termination proofs. To this end, we first formalized the required theory of term rewriting including three… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 107 CITATIONS, ESTIMATED 100% COVERAGE

FILTER CITATIONS BY YEAR

2009
2019

CITATION STATISTICS

  • 10 Highly Influenced Citations

  • Averaged 10 Citations per year from 2017 through 2019