Theoretical Computer Science
Maude: specification and programming in rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
Swinging Data Types: Syntax, Semantics, and Theory
Selected papers from the 11th Workshop on Specification of Abstract Data Types Joint with the 8th COMPASS Workshop on Recent Trends in Data Type Specification
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
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
Regular Strategies as Proof Tactics for CIRC
Electronic Notes in Theoretical Computer Science (ENTCS)
A Guide to Extending Full Maude Illustrated with the Implementation of Real-Time Maude
Electronic Notes in Theoretical Computer Science (ENTCS)
Patterns for Maude Metalanguage Applications
Electronic Notes in Theoretical Computer Science (ENTCS)
Well-Definedness of Streams by Termination
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
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
CIRC: a behavioral verification tool based on circular coinduction
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
A tool proving well-definedness of streams using termination tools
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Sampling, splitting and merging in coinductive stream calculus
MPC'10 Proceedings of the 10th international conference on Mathematics of program construction
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 specification language for reo connectors
FSEN'11 Proceedings of the 4th IPM international conference on Fundamentals of Software Engineering
Stream processing coalgebraically
Science of Computer Programming
| Hi-index | 0.00 |
CIRC is an automated circular coinductive prover implemented as an extension of Maude. The circular coinductive technique that forms the core of CIRC is discussed, together with a high-level implementation using metalevel capabilities of rewriting logic. To reflect the strength of CIRC in automatically proving behavioral properties, an example defining and proving properties about infinite streams of infinite binary trees is shown. CIRC also provides limited support for automated inductive proving, which can be used in combination with coinduction.