A relative of the Thue-Morse sequence
Proceedings of the 4th conference on Formal power series and algebraic combinatorics
Automated Proving of the Behavioral Attributes
BCI '09 Proceedings of the 2009 Fourth Balkan Conference in Informatics
CIRC: a circular coinductive prover
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Circular coinduction: a proof theoretical foundation
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Circular Coinduction with Special Contexts
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
Circular coinduction: a proof theoretical foundation
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Automating coinduction with case analysis
ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
Quantitative Kleene coalgebras
Information and Computation
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
A Coalgebraic Perspective on Logical Interpretations
Studia Logica
Hi-index | 0.02 |
CIRC is a tool for automated inductive and coinductive theorem proving. It includes an engine based on circular coinduction, which makes CIRC particularly well-suited for proving behavioral properties of infinite data-structures. This paper presents the current status of the coinductive features of the CIRC prover, focusing on new features added over the last two years. The presentation is by examples, showing how CIRC can automatically prove behavioral properties.