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 VIEW PDF
POST COMMENT

Comments

There are no comments yet.

Authors

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...
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...
01/23/2020

Star Games and Hydras

The recursive path ordering is an established and crucial tool in term r...
07/30/2020

Stopping Criterion Design for Recursive Bayesian Classification: Analysis and Decision Geometry

Systems that are based on recursive Bayesian updates for classification ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.

References