DeepAI AI Chat
Log In Sign Up

DefunT: A Tool for Automating Termination Proofs by Using the Community Books (Extended Abstract)

10/10/2018
by   Matt Kaufmann, et al.
The University of Texas at Austin
0

We present a tool that automates termination proofs for recursive definitions by mining existing termination theorems.

READ FULL TEXT
02/25/2019

Dependent choice as a termination principle

We introduce a new formulation of the axiom of dependent choice that can...
06/13/2018

TTT2 with Termination Templates for Teaching

On the one hand, checking specific termination proofs by hand, say using...
05/03/2017

A Versatile, Sound Tool for Simplifying Definitions

We present a tool, simplify-defun, that transforms the definition of a g...
02/05/2023

The Marriage of Effects and Rewrites

In the research on computational effects, defined algebraically, effect ...
04/19/2023

On Certificates, Expected Runtimes, and Termination in Probabilistic Pushdown Automata

Probabilistic pushdown automata (pPDA) are a natural operational model f...
03/09/2018

Clocked Definitions in HOL

Many potentially non-terminating functions cannot be directly defined in...
08/11/2018

The Boyer-Moore Waterfall Model Revisited

In this paper, we investigate the potential of the Boyer-Moore waterfall...