Hiding more of hidden algebra

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1709, Issue , 1999, Pages 1704-1719

  Goguen, Joseph ^a   Roşu, Grigore ^a,b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF BUCHAREST   (Romania)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84949496605     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48118-4_40     Document Type: Conference Paper

References (21)

1. Gilles Bernot, Michael Bidoit, and Teodor Knapik. Observational specifications and the indistinguishability assumption. Theoretical Computer Science, 139(1- 2):275-314, 1995. Submitted 1992.
2. Michael Bidoit and Rolf Hennicker. Behavioral theories and the proof of behavioral properties. Theoretical Computer Science, 165(1):3-55, 1996.
3. Michael Bidoit and Rolf Hennicker. Modular correctness proofs of behavioural implementations. Acta Informatica, 35(11):951-1005, 1998.
4. Michael Bidoit and Rolf Hennicker. Observer complete definitions are behaviourally coherent. Technical Report LSV-99-4, ENS de Cachan, 1999.
5. Razvan Diaconescu. Behavioral 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. Razvan 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. Razvan Diaconescu, Joseph Goguen, and Petros Stefaneas. Logical support for modularization. In Gerard Huet and Gordon Plotkin, editors, Logical Environments, pages 83-130. Cambridge, 1993.
8. Razvan Diaconescu and Kokichi Futatsugi. Logical foundations of CafeOBJ. Submitted for publication.
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 Rod Burstall. Institutions: Abstract model theory for specification and programming. Journal of the Association for Computing Machinery, 39(1):95-146, January 1992.
11. Joseph Goguen and Grant Malcolm. Algebraic Semantics of Imperative Programs. MIT, 1996.
12. Joseph Goguen and Grant Malcolm. A hidden agenda. Theoretical Computer Science, to appear 1999. Also UCSD Dept. Computer Science & Eng. Technical Report CS97-538, May 1997.
13. Joseph Goguen, James Thatcher, and Eric Wagner. An initial algebra approach to the specification, correctness and implementation of abstract data types. In Raymond Yeh, editor, Current Trends in Programming Methodology, IV, pages 80-149. Prentice-Hall, 1978.
14. Rolf Hennicker. Context induction: a proof principle for behavioral abstractions. Formaal Aspects of Computing, 3(4):326-345, 1991.
15. 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.
16. 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.
17. Seiko Mikami. Semantics of equational specifications with module import and verification method of behavioral equations. In Proceedings, CafeOBJ Symposium. Japan Advanced Institute for Science and Technology, 1998. Numazu, Japan, April 1998.
18. 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.
19. Peter Padawitz. Towards the one-tiered design of data types and transition systems. In Proceedings, WADT’97, volume 1376 of Lecture Notes in Computer Science, pages 365-380. Springer, 1998.
20. Horst Reichel. Behavioural equivalence - a unifying concept for initial and final specifications. In Proceedings, Third Hungarian Computer Science Conference. Akademiai Kiado, 1981. Budapest.
21. Grigore Rosu and Joseph Goguen. Hidden congruent deduction. In Ricardo Ca- ferra and Gernot Salzer, editors, Proceedings, First-Order Theorem Proving - FTP‘98, pages 213-223. Technische Universitat Wien, 1998. Full version to appear in Lecture Notes in Artificial Intelligence, 1999.