Add to ORKGAbstract Circular coinductive rewriting is a new method for prov-ing behavioral properties, that combines behavioral rewriting with circular coinduction. This method is implementedin our new BOBJ behavioral specification and computation system, which is used in examples throughout this paper.These examples demonstrate the surprising power of circular coinductive rewriting. The paper also sketches theunderlying hidden algebraic theory and briefly describes BOBJ and some of its algorithms
Coalgebra has in recent years been recognized as the framework of choice for the treatment of reacti...
Abstract: We extend the classical hidden algebra formalism by a re-arrangement of the basic concepts...
Some programs are not merely sets of batch instructions performed in isolation. They interact, eithe...
Abstract Behavioral rewriting differs from standard rewriting in taking account of the weaker infere...
AbstractBehavioral rewriting differs from standard rewriting in taking account of the weaker inferen...
Circular coinduction is a new technique for behavioral reasoning that extends coinduction to specifi...
Abstract: We argue for an algorithmic approach to behavioral proofs, re-view the hidden algebra appr...
Following condensed introductions to classical and behavioral algebraic specification, this paper di...
Coinductive proofs of behavioral equivalence often require human ingenuity, in that one is expected ...
this report, we propose a new technique which combines behavioral rewriting and coinduction. Equatio...
Behavioral specification is an important algebraic method in software technology. A subtle aspect of...
Abstract. CIRC is an automated circular coinductive prover imple-mented as an extension of Maude. Th...
CIRC is a tool for automated inductive and coinductive theorem proving. It includes an engine based ...
AbstractCIRC is an automated circular coinductive prover implemented as an extension of Maude. The m...
Several algorithmic variants of circular coinduction have been proposed and implemented during the l...
Coalgebra has in recent years been recognized as the framework of choice for the treatment of reacti...
Abstract: We extend the classical hidden algebra formalism by a re-arrangement of the basic concepts...
Some programs are not merely sets of batch instructions performed in isolation. They interact, eithe...
Abstract Behavioral rewriting differs from standard rewriting in taking account of the weaker infere...
AbstractBehavioral rewriting differs from standard rewriting in taking account of the weaker inferen...
Circular coinduction is a new technique for behavioral reasoning that extends coinduction to specifi...
Abstract: We argue for an algorithmic approach to behavioral proofs, re-view the hidden algebra appr...
Following condensed introductions to classical and behavioral algebraic specification, this paper di...
Coinductive proofs of behavioral equivalence often require human ingenuity, in that one is expected ...
this report, we propose a new technique which combines behavioral rewriting and coinduction. Equatio...
Behavioral specification is an important algebraic method in software technology. A subtle aspect of...
Abstract. CIRC is an automated circular coinductive prover imple-mented as an extension of Maude. Th...
CIRC is a tool for automated inductive and coinductive theorem proving. It includes an engine based ...
AbstractCIRC is an automated circular coinductive prover implemented as an extension of Maude. The m...
Several algorithmic variants of circular coinduction have been proposed and implemented during the l...
Coalgebra has in recent years been recognized as the framework of choice for the treatment of reacti...
Abstract: We extend the classical hidden algebra formalism by a re-arrangement of the basic concepts...
Some programs are not merely sets of batch instructions performed in isolation. They interact, eithe...