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.


References in zbMATH (referenced in 41 articles , 2 standard articles )

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

1 2 3 next

  1. Hirokawa, Nao; Middeldorp, Aart; Sternagel, Christian; Winkler, Sarah: Abstract completion, formalized (2019)
  2. Lammich, Peter; Lochbihler, Andreas: Automatic refinement to efficient data structures: a comparison of two approaches (2019)
  3. Paulson, Lawrence C.; Nipkow, Tobias; Wenzel, Makarius: From LCF to Isabelle/HOL (2019)
  4. Lochbihler, Andreas: Fast machine words in Isabelle/HOL (2018)
  5. Schlichtkrull, Anders; Blanchette, Jasmin Christian; Traytel, Dmitriy; Waldmann, Uwe: Formalizing Bachmair and Ganzinger’s ordered resolution prover (2018)
  6. Blanchette, Jasmin Christian; Waldmann, Uwe; Wand, Daniel: A lambda-free higher-order recursive path order (2017)
  7. Brockschmidt, Marc; Joosten, Sebastiaan J. C.; Thiemann, René; Yamada, Akihisa: Certifying safety and termination proofs for integer transition systems (2017)
  8. Felgenhauer, Bertram; Thiemann, René: Reachability, confluence, and termination analysis with state-compatible automata (2017)
  9. 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 \textsfAProVE (2017)
  10. Nagele, Julian; Felgenhauer, Bertram; Middeldorp, Aart: CSI: new evidence - a progress report (2017)
  11. Nagele, Julian; Felgenhauer, Bertram; Zankl, Harald: Certifying confluence proofs via relative termination and rule labeling (2017)
  12. Sternagel, Christian; Sternagel, Thomas: Certifying confluence of quasi-decreasing strongly deterministic conditional term rewrite systems (2017)
  13. 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)
  14. Blanchette, Jasmin Christian; Greenaway, David; Kaliszyk, Cezary; Kühlwein, Daniel; Urban, Josef: A learning-based fact selector for Isabelle/HOL (2016)
  15. Chihani, Zakaria; Miller, Dale: Proof certificates for equality reasoning (2016)
  16. Nagele, Julian; Middeldorp, Aart: Certification of classical confluence results for left-linear term rewrite systems (2016)
  17. Yamada, Akihisa; Sternagel, Christian; Thiemann, René; Kusakari, Keiichirou: AC dependency pairs revisited (2016)
  18. Avanzini, Martin; Sternagel, Christian; Thiemann, René: Certification of complexity proofs using CeTA (2015)
  19. Lochbihler, Andreas; Maximova, Alexandra: Stream fusion for Isabelle’s code generator (2015)
  20. Marić, Filip; Petrović, Danijela: Formalizing complex plane geometry (2015)

1 2 3 next


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