Behavioral and Coinductive Rewriting

Abstract Behavioral rewriting differs from standard rewriting in taking account of the weaker inference rules of behavioral logic, but it shares much with standard rewriting, including notions like termination and confluence. We describe an efficient implementation of behavioral rewriting that uses standard rewriting. Circular coinductive rewriting combines behavioral rewriting with circular coinduction, giving a surprisingly powerful proof method for behavioral properties; it is implemented in the BOBJ system, which is used in our examples. These include several lazy functional stream program equivalences and a behavioral refinement.

[1]  Joseph A. Goguen,et al.  Software Engineering with Obj: Algebraic Specification In Action , 2010 .

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

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

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

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

[6]  Peter Padawitz,et al.  Swinging Data Types: Syntax, Semantics, and Theory , 1995, COMPASS/ADT.

[7]  Joseph A. Goguen,et al.  Algebraic semantics of imperative programs , 1996, Foundations of computing series.

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

[9]  M. Clavel,et al.  Principles of Maude , 1996, WRLA.

[10]  Grigore Rosu,et al.  Circular coinductive rewriting , 2000, Proceedings ASE 2000. Fifteenth IEEE International Conference on Automated Software Engineering.

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

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

[13]  Joseph A. Goguen,et al.  Hidden coinduction: behavioural correctness proofs for objects , 1999, Mathematical Structures in Computer Science.

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

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

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