CIRC: A Circular Coinductive Prover
From MaRDI portal
Recommendations
Cited in
(19)- Making a productive use of failure to generate witnesses for coinduction from divergent proof attempts
- CIRC
- Non-well-founded deduction for induction and coinduction
- Integrating induction and coinduction via closure operators and proof cycles
- Behavioral and coinductive rewriting
- Regular strategies as proof tactics for \textsf{CIRC}
- Circular coinduction: a proof theoretical foundation
- CIRC: A Behavioral Verification Tool Based on Circular Coinduction
- A tool proving well-definedness of streams using termination tools
- Stream differential equations: specification formats and solution methods
- Well-Definedness of Streams by Termination
- Circuits as streams in Coq: verification of a sequential multiplier
- Patterns for Maude metalanguage applications
- A Maude environment for CafeOBJ
- Fundamental Approaches to Software Engineering
- Circular coinduction in Coq using bisimulation-up-to techniques
- Conditional circular coinductive rewriting with case analysis.
- Checking equivalence in a non-strict language
- Some techniques for reasoning automatically on co-inductive data structures
This page was built for publication: CIRC: A Circular Coinductive Prover
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3612501)