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

∙

∙

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

READ FULL TEXT VIEW PDF

Comments

There are no comments yet.

Authors

Matt Kaufmann
8 publications

∙ 02/25/2019

Dependent choice as a termination principle

We introduce a new formulation of the axiom of dependent choice that can...

Thomas Powell, et al. ∙

∙ 06/13/2018

TTT2 with Termination Templates for Teaching

On the one hand, checking specific termination proofs by hand, say using...

Jonas Schöpf, et al. ∙

∙ 05/03/2017

A Versatile, Sound Tool for Simplifying Definitions

We present a tool, simplify-defun, that transforms the definition of a g...

Alessandro Coglio, et al. ∙

∙ 03/09/2018

Clocked Definitions in HOL

Many potentially non-terminating functions cannot be directly defined in...

Ramana Kumar, et al. ∙

∙ 08/11/2018

The Boyer-Moore Waterfall Model Revisited

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

Petros Papapanagiotou, et al. ∙

∙ 01/23/2020

Star Games and Hydras

The recursive path ordering is an established and crucial tool in term r...

Jörg Endrullis, et al. ∙

∙ 07/30/2020

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

Systems that are based on recursive Bayesian updates for classification ...

Aziz Koçanaoğulları, et al. ∙

References

[1]
[2] Byron Cook, Andreas Podelski & Andrey Rybalchenko (2011): Proving Program Termination. Commun. ACM 54(5), pp. 88–98. Available at http://doi.acm.org/10.1145/1941487.1941509.
[3] Matt Kaufmann, Panagiotis Manolios, J Strother Moore & Daron Vroon (2006): Integrating CCG analysis into ACL2. In: Workshop Proceedings: WST 2006, Eighth International Workshop on Termination, pp. 64–68. Available at http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.97.8994&rep=rep1&type=pdf.
[4] J Moore (Accessed: 2018): Terminatricks. https://github.com/acl2/acl2/tree/master/books/projects/codewalker/terminatricks.lisp.