Circular Coinduction: A Proof Theoretical Foundation
Rosu, Grigore; Lucanu, Dorel
Loading…
Permalink
https://hdl.handle.net/2142/10840
Description
Title
Circular Coinduction: A Proof Theoretical Foundation
Author(s)
Rosu, Grigore
Lucanu, Dorel
Issue Date
2009-02
Keyword(s)
Computer Science
Abstract
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.
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.