DefunT: A Tool for Automating Termination Proofs by Using the Community Books (Extended Abstract)
share
We present a tool that automates termination proofs for recursive definitions by mining existing termination theorems.
READ FULL TEXT
research
∙
02/25/2019
Dependent choice as a termination principle
We introduce a new formulation of the axiom of dependent choice that can...
research
∙
06/13/2018
TTT2 with Termination Templates for Teaching
On the one hand, checking specific termination proofs by hand, say using...
research
∙
05/03/2017
A Versatile, Sound Tool for Simplifying Definitions
We present a tool, simplify-defun, that transforms the definition of a g...
research
∙
02/05/2023
The Marriage of Effects and Rewrites
In the research on computational effects, defined algebraically, effect ...
research
∙
04/19/2023
On Certificates, Expected Runtimes, and Termination in Probabilistic Pushdown Automata
Probabilistic pushdown automata (pPDA) are a natural operational model f...
research
∙
03/09/2018
Clocked Definitions in HOL
Many potentially non-terminating functions cannot be directly defined in...
research
∙
08/11/2018