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 ...
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 ...
People also ask
What is a CETa certification?
What is a termination certification?
In this paper we use the theorem prover Isabelle/HOL to automat- ically certify termination proofs. To this end, we first formalized the required theory of term ...
This paper uses the theorem prover Isabelle/HOL to automatically certify termination proofs and formalized the required theory of term rewriting including ...
To certify a proof using CeTA, you just need a CeTA binary plus a termination tool that is able to print the appropriate XML proof tree. Moreover, the runtime ...
CeTA – A Tool for Certified Termination Analysis C. · Currently, CeTA features certifying proofs for term rewrite systems (TRSs), i.e., the initial problem is.
Aug 8, 2012 · Abstract page for arXiv paper 1208.1591: CeTA - A Tool for Certified Termination Analysis.
This led to the general approach of using proof assistants (like Coq and Isabelle) for certification. We present the latest developments for IsaFoR/CeTA ...
Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. Theoretical Computer Science 236, 133–178 (2000)
Nowadays certification is widely employed by automated termination tools for term rewriting, where certifiers support most available techniques.