Circular coinductive rewriting

Proceedings ASE 2000: 15th IEEE International Conference on Automated Software Engineering

Volumn , Issue , 2000, Pages 123-131

  Goguen, J ^a   Lin, K ^a   Rosu C ^a,b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF BUCHAREST   (Romania)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY;

ALGEBRAIC THEORIES; BEHAVIORAL PROPERTIES; BEHAVIORAL SPECIFICATION; COINDUCTION; COMPUTATION SYSTEMS;

SOFTWARE ENGINEERING;

EID: 84960940206     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ASE.2000.873657     Document Type: Conference Paper

References (21)

1. Jon Barwise and Lawrence Moss. Vicious Circles: On the Mathematics of Non-wellfounded Phenomena. Cambridge University Press, 1996. Originally appeared as CSLI Lecture Notes 60.
2. Michael 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, Coalgebraic Methods in Computer Science (CMCS'00), volume 33 of Electronic Notes in Theoretical Computer Science, pages 61-79. Elsevier Science, March 2000.
4. Louise Dennis, Alan Bundy, and Ian Green. Using a generalisation critic to find bisimulations for coinductive proofs. In Proceedings, 14th Conference on Automated Deduction, pages 276-290. Springer, 1996. Lecture Notes in Computer Science, Volume 1249.
5. Rǎzvan Diaconescu. Behavioural coherence in object-oriented algebraic specification. Technical Report IS-RR-98-0017F, Japan Advanced Institute for Science and Technology, June 1998. Submitted for publication.
6. Rǎzvan Diaconescu and Kokichi Futatsugi. CafeOBJ Report: The Language, Proof Techniques, and Methodologies for Object-Oriented Algebraic Specification. World Scientific, 1998. AMAST Series in Computing, Volume 6.
7. 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.
8. 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.
9. Joseph Goguen and Grant Malcolm. Hidden coinduction: Behavioral correctness proofs for objects. Mathematical Structures in Computer Science, 9(3):287-319, June 1999.
10. Joseph Goguen and Grant Malcolm. A hidden agenda. Theoretical Computer Science, to appear.
11. UCSD Dept. Computer Science & Eng. Technical Report CS97-538, May 1997.
12. Joseph Goguen and Grigore Roşu. Hiding more of hidden algebra. In Jeannette Wing, Jim Woodcock, and Jim Davies, editors, 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.
13. Joseph Goguen and Grigore Roşu. A protocol for distributed cooperative work. In Gheorghe Stefanescu, editor, Proceedings, FCT'99, Workshop on Distributed Systems, pages 1-22. Elsevier, 1999. (Iaşi, Romania).
14. Electronic Lecture Notes in Theoretical Computer Science, Elsevier Volume 28.
15. Joseph Goguen, Timothy Winkler, José Meseguer, Kokichi Futatsugi, and Jean-Pierre Jouannaud. Introducing OBJ. In Joseph Goguen and Grant Malcolm, editors, Software Engineering with OBJ: Algebraic Specification in Action. Kluwer, 2000. Also Technical Report SRI-CSL-88-9, August 1988, SRI International.
16. Rolf Hennicker. Context induction: a proof principle for behavioural abstractions. Formal Aspects of Computing, 3(4):326-345, 1991.
17. Rolf Hennicker and Michel Bidoit. Observational logic. In Algebraic Methodology and Software Technology (AMAST'98), volume 1548 of Lecture Notes in Computer Science, pages 263-277. Springer, 1999.
18. Bart Jacobs and Jan Rutten. A tutorial on (co)algebras and (co)induction. Bulletin of the European Association for Theoretical Computer Science, 62:222-259, 1997.
19. 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 (Bucharest), 1999. Proceedings of a workshop in Toulouse, 20 and 22 September 1999.
20. Grigore Roşu and Joseph Goguen. Circular coinduction. Technical Report CSE2000-0647, Dept. Computer Science & Engineering, Univ. California at San Diego, February 2000. Written October 1999.
21. Grigore Roşu and Joseph Goguen. Hidden congruent deduction. In Ricardo Caferra and Gernot Salzer, editors, Automated Deduction in Classical and Non-Classical Logics, pages 252-267. Springer, 2000. Lecture Notes in Artificial Intelligence, Volume 1761; papers from a conference held in Vienna, November 1998.