Conditional Circular Coinductive Rewriting with Case Analysis

We argue for an algorithmic approach to behavioral proofs, review the hidden algebra approach, develop circular coinductive rewriting for conditional goals, extend it with case analysis, and give some examples.

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

[2]  Michel Bidoit,et al.  Observational Specifications and the Indistinguishability Assumption , 1995, Theor. Comput. Sci..

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

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

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

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

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

[8]  Peter Padawitz.  Towards the one-tiered design of data types and transition systems , 1997, WADT.

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

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

[11]  Bart Jacobs,et al.  Mongruences and Cofree Coalgebras , 1995, AMAST.

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

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

[14]  Jan J. M. M. Rutten,et al.  Universal coalgebra: a theory of systems , 2000, Theor. Comput. Sci..

[15]  Michaël Rusinowitch,et al.  Observational Proofs with Critical Contexts , 1998, FASE.

[16]  Michel Bidoit,et al.  Behavioural Theories and the Proof of Behavioural Properties , 1996, Theor. Comput. Sci..

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

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

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