Hidden coinduction: Behavioural correctness proofs for objects

Mathematical Structures in Computer Science

Volumn 9, Issue 3, 1999, Pages 287-319

  Goguen, Joseph A ^a   Malcolm, Grant ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84978604948     PISSN: 09601295     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0960129599002777     Document Type: Article

References (55)

1. Aczel, P. and Mendler, N. (1989) A final coalgebra theorem. In: Pitt, D.H. et al. (ed.) Category Theory and Computer Science. Springer-Verlag Lecture Notes in Computer Science 389.
2. Barr, M. (1993) Terminal coalgebras in well-founded set theory. Theoretical Computer Science 114 299–315.
3. Bidoit, M., Hennicker, R. and Wirsing, M. (1996) Behavioural and abstractor specifications. Science of Computer Programming 25 (2–3).
4. Boehm, B. (1981) Software Engineering Economics, Prentice-Hall.
5. Button, G. and Sharrock, W. (1993) Occasioned practises in the work of implementing development methodologies. In: Jirotka, M. and Goguen, J. (eds.) Requirements Engineering: Social and Technical Issues, Academic Press 217–240.
6. Cirstea, C. (1996) A Semantic Study of the Object Paradigm, Transfer thesis, Programming Research Group, Oxford University.
7. Cirstea, C. (1997) Coalgebra semantics for hidden algebra: parameterized objects and inheritance. Paper presented at the 12th Workshop on Algebraic Development Techniques, June 1997.
8. Diaconescu, R. (1994) Category-based Semantics for Equational and Constraint Logic Programming. Ph. D. thesis, Programming Research Group, Oxford University.
9. Diaconescu, R. (1996) A category-based equational logic semantics to constraint programming. In: Haveraaen, M., Owe, O. and Dahl, O.-J. (eds.) Recent Trends in Data Type Specification. Springer-Verlag Lecture Notes in Computer Science 200–222.
10. Ehrig, H., Kreowski, H.-J., Mahr, B. and Padawitz, P. (1983) Algebraic implementation of abstract data types. Theoretical Computer Science 20 209–263.
11. Ehrig, H., Orejas, F., Cornelius, F. and Baldamus, M. (1993) Abstract and behaviour module specifications. Technical Report 93–25, Technische Universitat Berlin.
12. Gaudel, M.C. and Privara, I. (1991) Context induction: an exercise. Technical Report 687, LRI, Universite de Paris-Sud.
13. Giarrantana, V., Gimona, F. and Montanari, U. (1976) Observability concepts in abstract data specifications. Proceedings, Conference on Mathematical Foundations of Computer Science. Springer-Verlag Lecture Notes in Computer Science 45.
14. Goguen, J. (1990a) Higher-order functions considered unnecessary for higher-order programming. In: Turner, D. (ed.) Research Topics in Functional Programming. University of Texas at Austin Year of Programming Series Addison Wesley 309–352.
15. Goguen, J. (1990c) Proving and rewriting. In: Kirchner, H. and Wechler, W. (eds.) Proceedings, Second International Conference on Algebraic and Fogic Programming. Springer-Verlag Lecture Notes in Computer Science 463 1–24.
16. Goguen, J. (1994) Requirements engineering as the reconciliation of social and technical issues. In: Jirotka, M. and Goguen, J. (eds.) Requirements Engineering: Social and Technical Issues, Academic Press 165–200.
17. Goguen, J. (1998) Theorem Proving and Algebra, MIT Press (to appear).
18. Goguen, J. and Burstall, R. (1992) Institutions: Abstract model theory for specification and programming. Journal of the Association for Computing Machinery 39 (1) 95–146. Goguen, J. and Diaconescu, R. (1994a) An Oxford survey of order sorted algebra. Mathematical Structures in Computer Science 4 363–392.
19. Goguen, J. and Diaconescu, R. (1994b) Towards an algebraic semantics for the object paradigm. In: Ehrig, H. and Orejas, F. (eds.) Proceedings, Tenth Workshop on Abstract Data Types. Springer-Verlag Lecture Notes in Computer Science 785 1–29.
20. Goguen, and Malcolm, G. (1994) Proof of correctness of object representation. In: Roscoe, A. W. (ed.) A Classical Mind: Essays in Honour of C.A.R. Hoare, Prentice Hall 119–142.
21. Goguen, J. and Malcolm, G. (1996) Algebraic Semantics of Imperative Programs, MIT Press.
22. Goguen, J., Malcolm, G. and Kemp, T. (1998) A hidden Herbrand theorem. In: Palamidessi, C., Glaser, H. and Meinke, K. (eds.) Principles of Declarative Programming. Springer-Verlag Lecture Notes in Computer Science 1490 445–462.
23. Goguen, J. and Meseguer, J. (1982) Universal realization, persistent interconnection and implementation of abstract modules. In: Nielsen, M. and Schmidt, E.M. (eds.) Proceedings, 9th International Conference on Automata, Languages and Programming. Springer-Verlag Lecture Notes in Computer Science 140 265–281.
24. Goguen, J. and Meseguer, J. (1987a) Order-sorted algebra solves the constructor selector, multiple representation and coercion problems. In: Proceedings, Second Symposium on Logic in Computer Science, IEEE Computer Society 18–29.
25. Goguen, J. and Meseguer, J. (1992) Order-sorted algebra I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations. Theoretical Computer Science 105 (2) 217–273. (Drafts exists from as early as 1985).
26. Goguen, J., Mori, A. and Lin, K. (1997a) Algebraic semiotics, proof Webs, and distributed cooperative proving. In: Proceedings, User Interfaces fpvor Theorem Provers (Sophia Antipolis, France, 1–2 Sept. 1997) 25–34.
27. Goguen, J., Mori, A., Lin, K., Ro§u, G. and Sato, A. (1997b) Distributed cooperative formal methods tools. In: Proceedings, Automated Software Engineering (Lake Tahoe NV, 3–5 Nov), IEEE 55–62.
28. Goguen, J., Thatcher, J. and Wagner, E. (1978) An initial algebra approach to the specification, correctness and implementation of abstract data types. In: Yeh, R. (ed.) Current Trends in Programming Methodology, IV, Prentice Hall 80–149.
29. Gordon, A. D. (1995) Bisimilarity as a theory of functional programming. Electronic Notes in Theoretical Computer Science 1.
30. Guttag, J. (1975) The Specification and Application to Programming of Abstract Data Types, Ph. D. thesis, University of Toronto. (Computer Science Department, Report CSRG-59.)
31. Guttag, J. (1977) Abstract data types and the development of data structures. Communications of the Association for Computing Machinery 20 297–404.
32. Hagino, T. (1988) A typed lambda calculus with categorical type constructors. In: Pitt, D.H., Poigne, A. and Rydeheard, D. E. (eds.) Category Theory and Computer Science. Springer-Verlag Lecture Notes in Computer Science 283 140–157.
33. Hamel, L. (1996) Behavioural Verification and Implementation of an Optimizing Compiler for OBJ3, Ph. D. thesis, Oxford University Computing Lab, 1996.
34. Hamel, L. and Goguen, J. (1994) Towards a provably correct compiler for OBJ3. In: Hermenegildo, M. and Penjam, J. (eds.) Proceedings, Conference on Programming Language Implementation and Logic Programming. Springer-Verlag Lecture Notes in Computer Science 844 132–146.
35. Hennicker, R. (1990) Context induction: a proof principle for behavioural abstractions. In: Miola, A. (ed.) Proceedings, International Symposium on the Design and Implementation of Symbolic Computation Systems. Springer-Verlag Lecture Notes in Computer Science 429 101–110.
36. Hoare, C.A.R. (1972) Proof of correctness of data representation. Acta Informatica 1 271–281. Jacobs, B. (1995) Mongruences and cofree coalgebras. In: Nivat, M. (ed.) Algebraic Methodology and Software Technology (AMAST95). Springer-Verlag Lecture Notes in Computer Science 936 245–260.
37. Jacobs, B. (1996) Objects and classes, coalgebraically. In: Freitag, B., Jones C., Lengauer, C. and Schek, H.-J. (eds.) Object-Orientation with Parallelism and Persistence, Kluwer 83–103.
38. Jacobs, B. (1997) Invariants, bisimulations and the correctness of coalgebraic refinements. Technical Report CSI-R9704, Computer Science Institute, University of Nijmegen. Malcolm, G. (1990) Data structures and program transformation. Science of Computer Programming 14.
39. Malcolm, G. (1996) Behavioural equivalence, bisimilarity, and minimal realisation. In Haveraaen, M., Owe, O. and Dahl, O.-J. (eds.) Recent Trends in Data Type Specifications. Springer-Verlag Lecture Notes in Computer Science 389.
40. Malcolm, G. and Goguen, J. (1994) Proving correctness of refinement and implementation. Technical Monograph PRG-114, Programming Research Group, University of Oxford.
41. Meseguer, J. and Goguen, J. (1985) Initiality, induction and computability. In: Nivat, M. and Reynolds, J. (eds.) Algebraic Methods in Semantics, Cambridge University Press 459–541.
42. Milner, R. and Tofte, M. (1991) Co-induction in relational semantics. Theoretical Computer Science 87 (1) 209–220.
43. Orejas, F., Navarro, M. and Sanchez, A. (1996) Algebraic implementation of abstract data types: a survey of concepts and new compositionality results. Mathematical Structures in Computer Science 6 (1).
44. Pinheiro, F. and Goguen, J. (1996) An object-oriented tool for tracing requirements. IEEE Software (Special issue of papers from ICRE ‘96) 52–64.
45. Reichel, H. (1981) Behavioural equivalence — a unifying concept for initial and final specifications. In: Proceedings, Third Hungarian Computer Science Conference, Akademiai Kiado, Budapest.
46. Reichel, H. (1985) Behavioural validity of conditional equations in abstract data types. In: Contributions to General Algebra 3, Teubner (Proceedings of the Vienna Conference, June 21–24).
47. Reichel, H. (1995) An approach to object semantics based on terminal co-algebras. Mathematical Structures in Computer Science 5 129–152.
48. Ro§u, G. and Goguen, J. (1998) Hidden congruent deduction. To appear in Proceedings, International Workshop on First Order Theorem Proving.
49. Rutten, J.J.M.J. (1996) Universal coalgebra a theory of systems. Technical Report CS-R9652, CWI.
50. Rutten, J. and Turi, D. (1994) Initial algebra and final coalgebra semantics for concurrency. In: de Bakker, J., de Roever, J. W. and Rozenberg, G. (eds.) Proc. REX Symposium A Decade of Concurrency'. Springer-Verlag Lecture Notes in Computer Science 803 530–582.
51. Sannella, D. and Tarlecki, A. (1988) Toward formal development of programs from algebraic specifications. Acta Informatica 25 233–281.
52. Turi, D. and Plotkin, G. (1997) Towards a mathematical operational semantics. In: Proceedings Logic in Computer Science 1997.
53. Veglioni, S. (1997) Integrating Static and Dynamic Aspects in the Specification of Open, Object-based and Distributed Systems, Ph. D. thesis, Oxford University Computing Laboratory.
54. Wand, M. (1979) Final algebra semantics and data type extension. Journal of Computer and System Sciences 19 27–44.
55. Winskel, G. (1984) Categories of models for concurrency. In: Brooks, S., Roscoe, A. W. and Winskel, G. (eds.) Proceedings, Workshop on the Semantics of Concurrency. Springer-Verlag Lecture Notes in Computer Science 197 246–267.