TTT2 with Termination Templates for Teaching

06/13/2018
by   Jonas Schöpf, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/10/2018

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...
research
07/20/2023

Automated Termination Proofs for C Programs with Lists (Short WST Version)

There are many techniques and tools for termination of C programs, but u...
research
05/31/2021

An Automated Approach to the Collatz Conjecture

We explore the Collatz conjecture and its variants through the lens of t...
research
04/19/2023

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

Probabilistic pushdown automata (pPDA) are a natural operational model f...
research
07/27/2023

A Verified Efficient Implementation of the Weighted Path Order

The Weighted Path Order of Yamada is a powerful technique for proving te...
research
05/03/2017

A Versatile, Sound Tool for Simplifying Definitions

We present a tool, simplify-defun, that transforms the definition of a g...
research
05/12/2019

Simulation Typology and Termination Risks

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

Please sign up or login with your details

Forgot password? Click here to reset