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.

References in zbMATH (referenced in 27 articles , 1 standard article )

Showing results 1 to 20 of 27.
Sorted by year (citations)

1 2 next

  1. Blanchette, Jasmin Christian; Waldmann, Uwe; Wand, Daniel: A lambda-free higher-order recursive path order (2017)
  2. Brockschmidt, Marc; Joosten, Sebastiaan J. C.; Thiemann, René; Yamada, Akihisa: Certifying safety and termination proofs for integer transition systems (2017)
  3. Felgenhauer, Bertram; Thiemann, René: Reachability, confluence, and termination analysis with state-compatible automata (2017)
  4. Giesl, Jürgen; Aschermann, Cornelius; Brockschmidt, Marc; Emmes, Fabian; Frohn, Florian; Fuhs, Carsten; Hensel, Jera; Otto, Carsten; Plücker, Martin; Schneider-Kamp, Peter; Ströder, Thomas; Swiderski, Stephanie; Thiemann, René: Analyzing program termination and complexity automatically with \ssfAProVE (2017)
  5. Nagele, Julian; Felgenhauer, Bertram; Middeldorp, Aart: CSI: new evidence - a progress report (2017)
  6. Nagele, Julian; Felgenhauer, Bertram; Zankl, Harald: Certifying confluence proofs via relative termination and rule labeling (2017)
  7. Sternagel, Christian; Sternagel, Thomas: Certifying confluence of quasi-decreasing strongly deterministic conditional term rewrite systems (2017)
  8. Ströder, Thomas; Giesl, Jürgen; Brockschmidt, Marc; Frohn, Florian; Fuhs, Carsten; Hensel, Jera; Schneider-Kamp, Peter; Aschermann, Cornelius: Automatically proving termination and memory safety for programs with pointer arithmetic (2017)
  9. Blanchette, Jasmin Christian; Greenaway, David; Kaliszyk, Cezary; Kühlwein, Daniel; Urban, Josef: A learning-based fact selector for Isabelle/HOL (2016)
  10. Nagele, Julian; Middeldorp, Aart: Certification of classical confluence results for left-linear term rewrite systems (2016)
  11. Nagele, Julian; Zankl, Harald: Certified rule labeling (2015)
  12. Sternagel, Christian; Thiemann, René: A framework for developing stand-alone certifiers (2015)
  13. Alkassar, Eyad; Böhme, Sascha; Mehlhorn, Kurt; Rizkallah, Christine: A framework for the verification of certifying computations (2014)
  14. Zankl, Harald; Korp, Martin: Modular complexity analysis for term rewriting (2014)
  15. Bertram Felgenhauer; Martin Avanzini; Christian Sternagel: A Haskell Library for Term Rewriting (2013) arXiv
  16. Sternagel, Christian: Proof pearl: A mechanized proof of GHC’s mergesort (2013)
  17. Krauss, Alexander; Nipkow, Tobias: Proof Pearl: regular expression equivalence and relation algebra (2012)
  18. Sternagel, Thomas; Zankl, Harald: KBCV -- Knuth-Bendix completion visualizer (2012)
  19. Coquand, Thierry; Siles, Vincent: A decision procedure for regular expression equivalence in type theory (2011)
  20. Fuhs, Carsten; Giesl, Jürgen; Parting, Michael; Schneider-Kamp, Peter; Swiderski, Stephan: Proving termination by dependency pairs and inductive theorem proving (2011)

1 2 next

Further publications can be found at: http://cl-informatik.uibk.ac.at/software/ceta/#publications