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