Published June 29, 2021 | Version v1
Conference paper Metadata-only

Proof Pearl : Playing with the Tower of Hanoi Formally

Théry, Laurent
Other:
Sûreté du logiciel et Preuves Mathématiques Formalisées (STAMP) ; Inria Sophia Antipolis - Méditerranée (CRISAM) ; Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)

Description

The Tower of Hanoi is a typical example that is used in computer science courses to illustrate all the power of recursion. In this paper, we show that it is also a very nice example for inductive proofs and formal verification. We present some non-trivial results that have been formalised in the {Coq} proof assistant.

Abstract

International audience

Additional details

Identifiers Origin repository
Created:
December 4, 2022
Modified:
November 29, 2023