In computer science, coinduction is a technique for defining and proving properties of systems of concurrent interacting objects. Coinduction is the… (More)

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

- Dexter Kozen, Alexandra Silva
- Mathematical Structures in Computer Science
- 2017

Induction is a well-established proof principle that is taught in most undergraduate programs in mathematics and computer science… (More)

Is this relevant?

Highly Cited

2009

Highly Cited

2009

- Davide Sangiorgi
- ACM Trans. Program. Lang. Syst.
- 2009

The origins of bisimulation and bisimilarity are examined, in the three fields where they have been independently discovered… (More)

Is this relevant?

2009

2009

- Dorel Lucanu, Grigore Rosu
- ICFEM
- 2009

Coinductive proofs of behavioral equivalence often require human ingenuity, in that one is expected to provide a “good” relation… (More)

Is this relevant?

2009

2009

- Grigore Rosu, Dorel Lucanu
- CALCO
- 2009

Several algorithmic variants of circular coinduction have been proposed and implemented during the last decade, but a proof… (More)

Is this relevant?

Highly Cited

2007

Highly Cited

2007

- Ichiro Hasuo, Bart Jacobs, Ana Sokolova
- Logical Methods in Computer Science
- 2007

Trace semantics has been defined for various kinds of state-based systems, notably with different forms of branching such as non… (More)

Is this relevant?

2007

2007

- Ulrich Berger, Tie Hou
- Theory of Computing Systems
- 2007

This paper studies coinductive representations of real numbers by signed digit streams and fast Cauchy sequences. It is shown how… (More)

Is this relevant?

2003

2003

- Falk Bartels
- 2003

We introduce the λ-coiteration schema for a distributive law λ of a functor T over a functor F. Parameterised by T and λ it… (More)

Is this relevant?

1999

1999

- Marina Lenisa
- Electr. Notes Theor. Comput. Sci.
- 1999

We investigate the relation between the set-theoretical description of coinduction based on Tarski Fixpoint Theorem, and the… (More)

Is this relevant?

Highly Cited

1998

Highly Cited

1998

- Jan J. M. M. Rutten
- CONCUR
- 1998

The classical theory of deterministic automata is presented in terms of the notions of homomorphism and bisimulation, which are… (More)

Is this relevant?

Highly Cited

1998

Highly Cited

1998

- Claudio Hermida, Bart Jacobs
- Inf. Comput.
- 1998

We present a categorical logic formulation of induction and coinduction principles for reasoning about inductively and coin… (More)

Is this relevant?