Files in this item



application/pdfCircular Coindu ... Theoretical Foundation.pdf (223kB)
(no description provided)PDF


Title:Circular Coinduction: A Proof Theoretical Foundation
Author(s):Rosu, Grigore; Lucanu, Dorel
Subject(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.
Issue Date:2009-02
Genre:Technical Report
Other Identifier(s):UIUCDCS-R-2009-3037
Rights Information:You are granted permission for the non-commercial reproduction, distribution, display, and performance of this technical report in any format, BUT this permission is only for a period of 45 (forty-five) days from the most recent time that you verified that this technical report is still available from the University of Illinois at Urbana-Champaign Computer Science Department under terms that include this permission. All other rights are reserved by the author(s).
Date Available in IDEALS:2009-04-23

This item appears in the following Collection(s)

Item Statistics