Behavioral and coinductive rewriting

Electronic Notes in Theoretical Computer Science

Volumn 36, Issue , 2000, Pages 2-23

  Goguen, Joseph ^a   Lin, Kai ^a   Roşu, Grigore ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING; CONTEXT FREE GRAMMARS; DATA REDUCTION; LINEAR ALGEBRA; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; THEOREM PROVING;

BEHAVIORAL SPECIFICATION; COALGEBRA; HIDDEN SIGNATURE; REGULAR EXPRESSIONS;

LOGIC PROGRAMMING;

EID: 0009898172     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)80128-8     Document Type: Conference Paper

References (25)

1. Barwise Jon, Moss Lawrence. Vicious Circles: On the Mathematics of Non-wellfounded Phenomena. 1996;Cambridge University Press. Originally appeared as CSLI Lecture Notes 60
2. Michel Bidoit and Rolf Hennicker. Observer complete definitions are behaviourally coherent. In Kokichi Futatsugi, Joseph Goguen, and José Meseguer, editors, OBJ/CafeOBJ/Maude at Formal Methods '99, pages 83-94. Theta, 1999. Proceedings of a workshop held in Toulouse, France, 20th and 22nd September 1999.
3. Samuel Buss and Grigore Roşu. Incompleteness of behavioral logics. In Horst Reichel, editor, Proceedings of Coalgebraic Methods in Computer Science (CMCS'OO), Berlin, Germany, March 2000, volume 33 of Electronic Notes in Theoretical Computer Science, pages 61-79. Elsevier Science, 2000.
4. Manuel Clavel, Steven Eker, Patrick Lincoln, and José Meseguer. Principles of Maude. In Jose Meseguer, editor, Proceedings, First International Workshop on Rewriting Logic and its Applications. Elsevier Science, 1996. Volume 4, Electronic Notes in Theoretical Computer Science.
5. Louise Dennis, Alan Bundy, and Ian Green. Using a generalisation critic to find bisimulations for coinductive proofs. In William McCune, editor, Proceedings of the 14th Conference on Automated Deduction, volume 1249 of Lecture Notes in Artificial Inteligence, pages 276-290. Springer, 1996.
6. Diaconescu Rǎzvan, Futatsugi Kokichi. Café OBJ Report: The Language, Proof Techniques, and Methodologies for Object-Oriented Algebraic Specification. 1998;World Scientific. AMAST Series in Computing, volume 6
7. Rǎzvan Diaconescu and Kokichi Futatsugi. Behavioral coherence in object-oriented algebraic specification. Journal of Universal Computer Science, 6(1):74-96, 2000.
8. Also Japan Advanced Institute for Science and Technology Technical Report number IS-RR-98-0017F, 1998.
9. Joseph Goguen. Types as theories. In George Michael Reed, Andrew William Roscoe, and Ralph F. Wachter, editors, Topology and Category Theory in Computer Science, pages 357-390. Oxford, 1991. Proceedings of a Conference held at Oxford, June 1989.
10. Joseph Goguen and Rǎzvan Diaconescu. Towards an algebraic semantics for the object paradigm. In Hartmut Ehrig and Fernando Orejas, editors, Proceedings, Tenth Workshop on Abstract Data Types, pages 1-29. Springer, 1994. Lecture Notes in Computer Science, Volume 785.
11. Joseph Goguen, Kai Lin, and Grigore Roşu. Circular coinductive rewriting. In Proceedings, Automated Software Engineering (ASE'OO). IEEE, 2000. to appear.
12. Goguen Joseph, Malcolm Grant. Algebraic Semantics of Imperative Programs. 1996;MIT
13. Goguen Joseph, Malcolm Grant. Hidden coinduction: Behavioral correctness proofs for objects. Mathematical Structures in Computer Science. 9:(3):1999;287-319
14. Goguen Joseph, Malcolm Grant. A hidden agenda. Theoretical Computer Science, to appear. Also UCSD Dept. Computer Science & Eng. Technical Report CS. May 1997;97-538
15. Joseph Goguen and Grigore Ro̧u. Hiding more of hidden algebra. In FM'99 -Formal Methods, pages 1704-1719. Springer, 1999. Lecture Notes in Computer Sciences, Volume 1709, Proceedings of World Congress on Formal Methods, Toulouse, France.
16. Goguen Joseph, Winkler Timothy, Meseguer José, Futatsugi Kokichi, Jouannaud Jean-Pierre. Introducing OBJ. Goguen Joseph, Malcolm Grant. Software Engineering with OBJ: Algebraic Specification in Action. 2000;Kluwer. Also Technical Report SRI-CSL-88-9, August 1988, SRI International
17. Hennicker Rolf. Context induction: a proof principle for behavioral abstractions. Formal Aspects of Computing. 3:(4):1991;326-345
18. Hennicker Rolf, Bidoit Michel. Observational logic. Algebraic Methodology and Software Technology (AMAST'98), volume 1548 of Lecture Notes in Computer Science. 1999;263-277 Springer
19. Jacobs Bart, Rutten Jan. A tutorial on (co)algebras and (co)induction. Bulletin of the European Association for Theoretical Computer Science. 62:1997;222-259
20. Peter Padawitz. Swinging data types: Syntax, semantics, and theory. In Proceedings, WADT'95, volume 1130 of Lecture Notes in Computer Science, pages 409-435. Springer, 1996.
21. Grigore Roşu. Behavioral coinductive rewriting. In Kokichi Futatsugi, Joseph Goguen, and José Meseguer, editors, OBJ/CafeOBJ/Maude at Formal Methods '99, pages 179-196. Theta, 1999. Proceedings of a workshop held in Toulouse, France, 20th and 22nd September 1999.
22. Grigore Roşu. Hidden Logic. PhD thesis, University of California at San Diego, 2000.
23. Roşu Grigore, Goguen Joseph. Hidden congruent deduction. Caferra Ricardo, Salzer Gernot. Automated Deduction in Classical and Non-Classical Logics. 2000;252-267 Springer. Lecture Notes in Artificial Intelligence, Volume 1761; papers from a conference held in Vienna, November 1998.
24. Roşu Grigore, Goguen Joseph. Circular coinduction. Technical Report CSE2000-0647, University of California at San Diego. February 2000;. Written October 1999
25. Shankar Natarajan, Owre Samuel, Rushby John M. PVS Tutorial. Computer Science Laboratory, SRI International, Menlo Park, CA. Also appears in Tutorial Notes, Formal Methods Europe '93: Industrial-Strength Formal Methods. February 1993;357-406 Odense, Denmark. April 1993