Circular coinductive rewriting

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 OBJects) 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 the underlying hidden algebraic theory and briefly describes BOBJ and some of its algorithms.

[1]  Lawrence S. Moss,et al.  Vicious circles - on the mathematics of non-wellfounded phenomena , 1996, CSLI lecture notes series.

[2]  Razvan Diaconescu,et al.  Cafeobj Report - The Language, Proof Techniques, and Methodologies for Object-Oriented Algebraic Specification , 1998, AMAST Series in Computing.

[3]  Joseph A. Goguen,et al.  Towards an Algebraic Semantics for the Object Paradigm , 1992, COMPASS/ADT.

[4]  Samuel R. Buss,et al.  Incompleteness of Behavioral Logics , 2000, CMCS.

[5]  Grigore Rosu,et al.  Hidden Congruent Deduction , 1998, FTP.

[6]  Grigore Rosu,et al.  Hiding More of Hidden Algebra , 1999, World Congress on Formal Methods.

[7]  Razvan Diaconescu,et al.  Behavioural Coherence in Object-Oriented Algebraic Specification , 2000, J. Univers. Comput. Sci..

[8]  Alan Bundy,et al.  Using A Generalisation Critic to Find Bisimulations for Coinductive Proofs , 1997, CADE.

[9]  Michel Bidoit,et al.  Observer Complete Definitions are Behaviourally Coherent , 1999 .

[10]  Rolf Hennicker,et al.  Context Induction: a Proof Principle for Behavioural Abstractions , 1990, DISCO.

[11]  Grigore Rosu,et al.  Circular Coinduction , 2000 .

[12]  Varol Akman.  John Barwise and Lawrence Moss, Vicious Circles: On the mathematics of Non-Wellfounded Phnenomena , 1997, J. Log. Lang. Inf..

[13]  Joseph A. Goguen,et al.  Software Engineering with OBJ , 2000, Advances in Formal Methods.

[14]  B. Jacobs,et al.  A tutorial on (co)algebras and (co)induction , 1997 .

[15]  Joseph A. Goguen,et al.  A hidden agenda , 2000, Theor. Comput. Sci..

[16]  Joseph A. Goguen,et al.  Types as theories , 1991 .

[17]  Grigore Rosu,et al.  A protocol for distributed cooperative work , 1999, Electron. Notes Theor. Comput. Sci..

[18]  Michel Bidoit,et al.  Observational Logic , 1998, AMAST.

[19]  G. Malcolm,et al.  Behavioral Correctness Proofs for Objects , 1999 .

[20]  Grigore Ro.  Behavioral Coinductive Rewriting , 1999 .