DeepAI AI Chat

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

research

∙ 02/25/2019

Dependent choice as a termination principle

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

0 Thomas Powell, et al. ∙

research

∙ 06/13/2018

TTT2 with Termination Templates for Teaching

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

0 Jonas Schöpf, et al. ∙

research

∙ 05/03/2017

A Versatile, Sound Tool for Simplifying Definitions

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

0 Alessandro Coglio, et al. ∙

research

∙ 02/05/2023

The Marriage of Effects and Rewrites

In the research on computational effects, defined algebraically, effect ...

0 Ezra e. k. Cooper, et al. ∙

research

∙ 04/19/2023

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

Probabilistic pushdown automata (pPDA) are a natural operational model f...

0 Tobias Winkler, et al. ∙

research

∙ 03/09/2018

Clocked Definitions in HOL

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

0 Ramana Kumar, et al. ∙

research

∙ 08/11/2018

The Boyer-Moore Waterfall Model Revisited

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

0 Petros Papapanagiotou, et al. ∙

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

Related Research

Dependent choice as a termination principle

TTT2 with Termination Templates for Teaching

A Versatile, Sound Tool for Simplifying Definitions

The Marriage of Effects and Rewrites

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

Clocked Definitions in HOL

The Boyer-Moore Waterfall Model Revisited