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.
KeywordsProof System Proof Tree Entailment Relation Equational Reasoning Proof Task
Unable to display preview. Download preview PDF.
- 4.Gaudel, M.-C., Privara, I.: Context induction: an exercise. Technical Report 687, LRI, Université de Paris-Sud (1991)Google Scholar
- 10.Lucanu, D., Goriac, E.-I., Caltais, G., Roşu, G.: CIRC: A behavioral verification tool based on circular coinduction. In: Kurz, A., Lenisa, M., Tarlecki, A. (eds.) Designing Privacy Enhancing Technologies. LNCS, vol. 5728, pp. 433–442. Springer, Heidelberg (2009)Google Scholar
- 12.Meseguer, J.: General logics. In: Ebbinghaus, H.-D., et al. (eds.) Logic Colloquium 1987, pp. 275–329. North Holland, Amsterdam (1989)Google Scholar
- 13.Roşu, G.: Hidden Logic. PhD thesis, University of California at San Diego (2000)Google Scholar
- 14.Roşu, G.: Equality of streams is a \(\Pi_2^0\)-complete problem. In: Proceedings of the 11th ACM SIGPLAN International Conference on Functional Programming (ICFP 2006), ACM Press, New York (2006)Google Scholar
- 15.Roşu, G., Goguen, J.: Circular coinduction. Short paper at the International Joint Conference on Automated Reasoning, IJCAR 2001 (2001)Google Scholar