CIRC
From MaRDI portal
Cited in
(65)- FEPG
- CoFI
- MANIFOLD
- TRAM
- CliffMath
- CliffSymNil
- CliffOC
- CafeOBJ
- Matching logic explained
- Integrating induction and coinduction via closure operators and proof cycles
- Loop verification with invariants and contracts
- Galliwasp
- HERMIT
- PLT Redex
- SPIKE
- CLT
- CoCasl
- RGITL
- GNATprove
- Well-definedness of streams by transformation and termination
- CoALP
- Witnessing (co)datatypes
- Constructor-Based Inductive Theorem Prover
- Regular strategies as proof tactics for \textsf{CIRC}
- On the complexity of stream equality
- Circular coinduction: a proof theoretical foundation
- A tool proving well-definedness of streams using termination tools
- A specification language for Reo connectors
- Stream differential equations: specification formats and solution methods
- Friends with benefits. Implementing corecursion in foundational proof assistants
- A Decision Procedure for Bisimilarity of Generalized Regular Expressions
- Behavioral equivalence of hidden k-logics: an abstract algebraic approach
- Cyclist
- CafeInMaude
- Towards a unified theory of operational and axiomatic semantics
- Bisimulations generated from corecursive equations
- Final semantics for decorated traces
- CoCaml
- Incremental pattern-based coinduction for process algebra and its Isabelle formalization
- Sampling, splitting and merging in coinductive stream calculus
- Well-Definedness of Streams by Termination
- A coalgebraic perspective on logical interpretations
- HOLCF
- CITP
- Coinductive
- Foundations for structuring behavioural specifications
- coFJ
- Coinductive proof techniques for language equivalence
- Program equivalence by circular reasoning
- A generic framework for symbolic execution: a coinductive approach
- Patterns for Maude metalanguage applications
- A Maude environment for CafeOBJ
- Quantitative Kleene coalgebras
- Practical coinduction
- Proving equality of streams automatically
- CafeOBJ Traces
- Behavioral rewrite systems and behavioral productivity
- On Automation of OTS/CafeOBJ Method
- Theorem Proving Based on Proof Scores for Rewrite Theory Specifications of OTSs
- Sound and complete equational reasoning over comodels
- AQuA
- HolBA
- Coalgebras in functional programming and type theory
- ``Backward coinduction, Nash equilibrium and the rationality of escalation
- Proving language inclusion and equivalence by coinduction
This page was built for software: CIRC
