Circular Coinductive Rewriting
ASE '00 Proceedings of the 15th IEEE international conference on Automated software engineering
Equality of streams is a Π0 over 2-complete problem
Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming
CIRC: a circular coinductive prover
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
All about maude - a high-performance logical framework: how to specify, program and verify systems in rewriting logic
CIRC: a behavioral verification tool based on circular coinduction
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Iterative circular coinduction for CoCasl in isabelle/HOL
FASE'05 Proceedings of the 8th international conference, held as part of the joint European Conference on Theory and Practice of Software conference on Fundamental Approaches to Software Engineering
Circular Coinduction with Special Contexts
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
CIRC: a behavioral verification tool based on circular coinduction
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Regular expression containment: coinductive axiomatization and computational interpretation
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Automating coinduction with case analysis
ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
A decision procedure for bisimilarity of generalized regular expressions
SBMF'10 Proceedings of the 13th Brazilian conference on Formal methods: foundations and applications
Incremental pattern-based coinduction for process algebra and its isabelle formalization
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Towards a unified theory of operational and axiomatic semantics
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Circular coinduction in coq using bisimulation-up-to techniques
ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving
| Hi-index | 0.00 |
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.