Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

KBSE
2000
IEEE

favoriteEmaildiscussreport

104views Software Engineering» more KBSE 2000»

Circular Coinductive Rewriting

13 years 9 months ago

Circular Coinductive Rewriting

Download fsl.cs.uiuc.edu

Circular coinductive rewriting is a new method for proving behavioral properties, that combines behavioral rewriting with circular coinduction. This method is implemented in our new BOBJ behavioral speciﬁcation 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 the underlying hidden algebraic theory and brieﬂy describes BOBJ and some of its algorithms.

Joseph A. Goguen, Kai Lin, Grigore Rosu

Real-time Traffic

BOBJ Behavioral Speciﬁcation | Circular Coinduction | Circular Coinductive Rewriting | KBSE 2000 | Software Engineering |

claim paper

Related Content

» CIRC A Circular Coinductive Prover

» Behavioral and Coinductive Rewriting

» Circular Coinduction with Special Contexts

» Iterative Circular Coinduction for CoCasl in IsabelleHOL

» Automating Coinduction with Case Analysis

» Incremental PatternBased Coinduction for Process Algebra and Its Isabelle Formalization

» CIRC A Behavioral Verification Tool Based on Circular Coinduction

» Circular Coinduction A Proof Theoretical Foundation

» Syntactic Type Soundness for the Region Calculus

Post Info
More Details (n/a)

Added	31 Jul 2010
Updated	31 Jul 2010
Type	Conference
Year	2000
Where	KBSE
Authors	Joseph A. Goguen, Kai Lin, Grigore Rosu

Comments (0)