CeTA
Certification of termination proofs using CeTA. 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.par 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 major termination criteria: dependency pairs, dependency graphs, and reduction pairs. Second, for each of these techniques we developed an executable check which guarantees the correct application of that technique as it occurs in the generated proofs. Moreover, if a proof is not accepted, a readable error message is displayed. Finally, we used Isabelle’s code generation facilities to generate a highly efficient and certified Haskell program, CeTA, which can be used to certify termination proofs without even having Isabelle installed.
Keywords for this software
References in zbMATH (referenced in 15 articles , 1 standard article )
Showing results 1 to 15 of 15.
Sorted by year (- Blanchette, Jasmin Christian; Greenaway, David; Kaliszyk, Cezary; Kühlwein, Daniel; Urban, Josef: A learning-based fact selector for Isabelle/HOL (2016)
- Sternagel, Christian; Thiemann, René: A framework for developing stand-alone certifiers (2015)
- Alkassar, Eyad; Böhme, Sascha; Mehlhorn, Kurt; Rizkallah, Christine: A framework for the verification of certifying computations (2014)
- Zankl, Harald; Korp, Martin: Modular complexity analysis for term rewriting (2014)
- Sternagel, Christian: Proof pearl: A mechanized proof of GHC’s mergesort (2013)
- Krauss, Alexander; Nipkow, Tobias: Proof Pearl: regular expression equivalence and relation algebra (2012)
- Sternagel, Thomas; Zankl, Harald: KBCV -- Knuth-Bendix completion visualizer (2012)
- Coquand, Thierry; Siles, Vincent: A decision procedure for regular expression equivalence in type theory (2011)
- Fuhs, Carsten; Giesl, Jürgen; Parting, Michael; Schneider-Kamp, Peter; Swiderski, Stephan: Proving termination by dependency pairs and inductive theorem proving (2011)
- Krauss, Alexander; Sternagel, Christian; Thiemann, René; Fuhs, Carsten; Giesl, Jürgen: Termination of Isabelle functions via termination of rewriting (2011)
- Lochbihler, Andreas; Bulwahn, Lukas: Animating the formalised semantics of a Java-like language (2011)
- Sternagel, Christian; Thiemann, René: Modular and certified semantic labeling and unlabeling (2011)
- Haftmann, Florian; Nipkow, Tobias: Code generation via higher-order rewrite systems (2010)
- Sternagel, Christian; Thiemann, René: Certified subterm criterion and certified usable rules (2010)
- Thiemann, René; Sternagel, Christian: Certification of termination proofs using CeTA (2009)
Further publications can be found at: http://cl-informatik.uibk.ac.at/software/ceta/#publications