CeTA
swMATH ID:  6584 
Software Authors:  Thiemann, René; Sternagel, Christian 
Description:  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. 
Homepage:  http://clinformatik.uibk.ac.at/software/ceta/ 
Programming Languages:  Haskell 
Keywords:  Certified Termination Analysis; Isabelle/HOL; Logic in Computer Science; arXiv_cs.LO; proof; term rewrite systems; TRSs 
Related Software:  Isabelle/HOL; Isabelle; Archive Formal Proofs; CoLoR; AProVE; Coq; HOL; Tyrolean; CiME; Haskell; CSI; z3; IsaFoR; Locales; Isar; ML; Sledgehammer; A3PAT; Matchbox; AVATAR 
Referenced in:  45 Publications 
Further Publications:  http://clinformatik.uibk.ac.at/software/ceta/#publications 
Standard Articles
2 Publications describing the Software, including 1 Publication in zbMATH  Year 

CeTA  A Tool for Certified Termination Analysis Christian Sternagel, René Thiemann, Sarah Winkler, Harald Zankl 
2012

Certification of termination proofs using CeTA. Zbl 1252.68265 Thiemann, René; Sternagel, Christian 
2009

all
top 5
Referenced by 59 Authors
all
top 5
Referenced in 6 Serials
all
top 5
Referenced in 6 Fields
45  Computer science (68XX) 
8  Mathematical logic and foundations (03XX) 
2  Number theory (11XX) 
1  Commutative algebra (13XX) 
1  Algebraic geometry (14XX) 
1  Geometry (51XX) 