Circular Coinduction: A Proof Theoretical Foundation

Several algorithmic variants of circular coinduction have been proposed and implemented during the last decade, but a proof theoretical foundation of circular coinduction in its full generality is still missing. This paper gives a three-rule proof system that can be used to formally derive circular coinductive proofs. This three-rule system is proved behaviorally sound and is exemplified by proving several properties of infinite streams. Algorithmic variants of circular coinduction now become heuristics to search for proof derivations using the three rules.

[1]  Grigore Rosu,et al.  Equality of streams is a Π0 over 2-complete problem , 2006, ICFP '06.

[2]  Jeffrey Shallit,et al.  The Ubiquitous Prouhet-Thue-Morse Sequence , 1998, SETA.

[3]  Perdita Stevens,et al.  Modelling Recursive Calls with UML State Diagrams , 2003, FASE.

[4]  Grigore Rosu.  Equality of streams is a ∏ 2 0-complete problem , 2006 .

[5]  Grigore Rosu,et al.  CIRC: A Behavioral Verification Tool Based on Circular Coinduction , 2009, CALCO.

[6]  Michel Bidoit,et al.  Constructor-based observational logic , 2006, J. Log. Algebraic Methods Program..

[7]  Hannes Federrath.  Designing Privacy Enhancing Technologies , 2001, Lecture Notes in Computer Science.

[8]  Tor Helleseth,et al.  Sequences and their Applications , 1999, Discrete Mathematics and Theoretical Computer Science.

[9]  Martin Wirsing,et al.  Extraction of Structured Programs from Specification Proofs , 1999, WADT.

[10]  Grigore Rosu,et al.  CIRC : A Circular Coinductive Prover , 2007, CALCO.

[11]  Rolf Hennicker,et al.  Context induction: A proof principle for behavioural abstractions and algebraic implementations , 1991, Formal Aspects of Computing.

[12]  Narciso Martí-Oliet,et al.  All About Maude - A High-Performance Logical Framework, How to Specify, Program and Verify Systems in Rewriting Logic , 2007, All About Maude.

[13]  Alexander Kurz,et al.  Algebra and Coalgebra in Computer Science, Third International Conference, CALCO 2009, Udine, Italy, September 7-10, 2009. Proceedings , 2009, CALCO.

[14]  Grigore Rosu,et al.  Circular coinductive rewriting , 2000, Proceedings ASE 2000. Fifteenth IEEE International Conference on Automated Software Engineering.

[15]  Till Mossakowski,et al.  Iterative Circular Coinduction for CoCasl in Isabelle/HOL , 2005, FASE.

[16]  Grigore Rosu,et al.  Circular Coinduction , 2000 .

[17]  José Meseguer,et al.  General Logics , 2006 .

[18]  Randy Moore,et al.  Thanks … , 2019, Witcraft.

[19]  Rolf Hennicker,et al.  Context Induction: a Proof Principle for Behavioural Abstractions , 1990, DISCO.

[20]  Grigore Rosu,et al.  Conditional Circular Coinductive Rewriting with Case Analysis , 2002, WADT.