DeepAI AI Chat
Log In Sign Up

TTT2 with Termination Templates for Teaching

by   Jonas Schöpf, et al.
Leopold Franzens Universität Innsbruck

On the one hand, checking specific termination proofs by hand, say using a particular collection of matrix interpretations, can be an arduous and error-prone task. On the other hand, automation of such checks would save time and help to establish correctness of exam solutions, examples in lecture notes etc. To this end, we introduce a template mechanism for the termination tool TTT2 that allows us to restrict parameters of certain termination methods. In the extreme, when all parameters are fixed, such restrictions result in checks for specific proofs.


page 1

page 2

page 3

page 4


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

We present a tool that automates termination proofs for recursive defini...

An Automated Approach to the Collatz Conjecture

We explore the Collatz conjecture and its variants through the lens of t...

The Marriage of Effects and Rewrites

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

DynamiTe: Dynamic Termination and Non-termination Proofs

There is growing interest in termination reasoning for non-linear progra...

Simulation Typology and Termination Risks

The goal of the article is to explore what is the most probable type of ...

A Versatile, Sound Tool for Simplifying Definitions

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

Clocked Definitions in HOL

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