Algebraic implementation of abstract data types: A survey of concepts and new compositionality results

Mathematical Structures in Computer Science

Volumn 6, Issue 1, 1996, Pages 33-67

  Orejas, Fernando ^a   Navarro, Marisa ^b   Sánchez, Ana ^b  

^a Polytechnic   (Spain)

^b UNIVERSITY OF THE BASQUE COUNTRY UPV EHU   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

SOFTWARE DESIGN; SOFTWARE ENGINEERING;

COMPOSITIONALITY; FORMAL FRAMEWORK; SOFTWARE DEVELOPMENT PROCESS;

ABSTRACT DATA TYPES;

EID: 26944494337     PISSN: 09601295     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0960129500000864     Document Type: Article

References (57)

1. Astesiano, E. and Cerioli, M. (1993) Relationships between logical frameworks. Proc. 8th Workshop on Specification of Abstract Data Types (Dourdan, 1991). Springer-Verlag Lecture Notes in Computer Science 655 126-143.
2. Bauer, F. L. and Wirsing, M. (1988) Crypt-Equivalent Algebraic Specifications. Ada Informatica 25 (2) 11-153.
3. Bernot, G. (1989) Correctness Proofs for Abstract Implementations. Information and Computation 80 121-151.
4. Bernot, G. and Bidoit, M. (1991) Proving the correctness of Algebraically Specified Software: Modularity and Observability Issues. In: Processings 2nd. AM AST {Iowa City) 139-161.
5. Bernot, G., Bidoit, M. and Choppy, C. (1986) Abstract implementations and correctness proofs. Proc. 3rd. Symp. on Theoretical Aspects of Computer Science. Springer-Verlag Lecture Notes in Computer Science 210 236-251.
6. Bjorner, D., and Jones, C. (1982) Formal Specification and Software Development, Prentice Hall.
7. Breu, M. (1993) Bounded implementation of algebraic specifications. 8th Workshop on Specification of Abstract Data Types (Dourdan, 1991). Springer-Verlag Lecture Notes in Computer Science 655 181-198.
8. Broy, M., Moller, B., Pepper, P. and Wirsing, M. (1986) Algebraic implementations preserve program correctness. Science of Computer Programming 7 35-53.
9. Burstall, R. M. and Diaconescu, R. (1994) Hiding and behaviour: an institutional approach. In: Roscoe, A. W. (ed.) A Classical Mind: Essays in Honour of C. A. R. Hoare, Prentice Hall 75-92.
10. Clerici, S. and Orejas, F. (1988) GSBL: an algebraic specification language based on inheritance. Proc. 1988 European Conf. on Object Oriented Programming, Oslo. Springer-Verlag Lecture Notes in Computer Science 322 78-92.
11. Diaconescu, R., Goguen, J. A. and Stefaneas, P. (1993) Logical support for modularisation. In: Huet, G. and Plotkin, G. (eds.) Logical Environments, Cambridge University Press 83-130.
12. Ehrich, H.-D. (1982) On the theory of specification, implementation and parameterization of abstract data types. Journal of the Association for Computing Machinery 29 206-207.
13. Ehrich, H.-D. and Lipeck, U. (1980) Proving implementation correct - two alternative approaches. Information Processing 80 83-88.
14. Ehrig, H. (1989) Concepts and compatibility requirements for implementations and transformation of specifications, Algebraic Specification Column Part 6. EATCS Bulletin 38 79-92.
15. Ehrig, H. and Adametz, H. (1981) New compatibility results for implementations within the initial algebraic approach, Algebraic Specification Column Part 11. EATCS Bulletin 43 102-112.
16. Ehrig, H. and Kreowski, H.-J. (1983) Compatibility of parameter passing and implementation of parameterized data types. Theoretical Computer Science 27 (3) 255-286.
17. Ehrig, H., Kreowski, H.-J., Mahr, B. and Padawitz, P. (1982) Algebraic implementation of abstract data types. Theoretical Computer Science 20 209-263.
18. Ehrig, H., Kreowski, H.-J. and Padawitz, P. (1978) Stepwise specification and implementation of abstract data types. Proc. 5th Intl. Colloq. on Automata, Languages and Programming, Udine. Springer-Verlag Lecture Notes in Computer Science 62 205-226.
19. Ehrig, H. and Mahr, B. (1985) Fundamentals of Algebraic Specifications 1, Springer-Verlag.
20. Ehrig, H., Mahr, B. (1989) Fundamentals of Algebraic Specifications 2, Springer-Verlag.
21. Ehrig, H., Pepper, P. and Orejas, F. (1989) On Recent Trends in Algebraic Specification, Proc. ICALP '89. Springer-Verlag Lecture Notes in Computer Science 372 263-288.
22. Farres-Casals, J. (1989) Proving Correctness of Constructor Implementations. Proc MFCS 89. Springer-Verlag Lecture Notes in Computer Science 379 225-235.
23. Ganzinger, H. (1983) Parameterized specifications: parameter passing and implementation with respect to observability. ACM Trans, on Programming Languages and Systems 5 (3) 318-354.
24. Goguen, J. A. and Burstall, R. M. (1980) CAT, a system for the structured elaboration of correct programs from structured specifications. Technical report CSL-118, Computer Science Laboratory, SRI International.
25. Goguen, J. A. and Burstall, R. M. (1984) Introducing institutions: Proc. Logics of Programming Workshop, Carnegie-Mellon. Springer-Verlag Lecture Notes in Computer Science 164 221-256.
26. Goguen, J. A. and Burstall, R. M. (1992) Institutions: Abstract model theory for specification and programming. Journ. of the ACM 39 (1) 95-146.
27. Goguen, J. A. and Meseguer, J. (1982) Universal realization, persistent interconnection and implementation of abstract modules. Proc. 9th Intl. Colloq. on Automata, Languages and Programming, Aarhus. Springer-Verlag Lecture Notes in Computer Science 140 265-281.
28. Goguen, J. A., Thatcher, J. W. and Wagner, E.G. (1976) An initial algebra approach to the specification, correctness and implementation of abstract data types. IBM Report RC-6487, IBM T. J. Watson Research Center, Yorktown Heights (also in: Yeh, R. T. (ed.) Current Trends in Programming Methodology, Vol. 4. Data Structuring, Prentice-Hall 80-149).
29. Guttag, J. V. and Horowitz, E., Musser, D. R. (1978) Abstract data types and software validation. Communications of the ACM 21 (12) 1048-1063.
30. Hennicker, R. (1989) Observational implementations. Proc. 6th Symp. on Theoretical Aspects of Computer Science, Paderborn. Springer-Verlag Lecture Notes in Computer Science 349 59-71.
31. Hennicker, R. (1991) Observational implementation of algebraic specifications. Acta Informatica 28 187-230.
32. Hoare, C. A. R. (1972) Proofs of correctness of data representations. Acta Informatica 1 271-281.
33. Kamin, S. and Archer, M. (1984) Partial Implementations of Abstract Data Types: A Dissenting View on Errors. Proc. Int. Symposium on Semantics of Data Types, Sophia-Antipolis. Springer-Verlag Lecture Notes in Computer Science 173 317-336.
34. Kapur, D. and Srivas, M. (1988) Computability and implementability issues in abstract data types. Science of Computer Programming 10 33-63.
35. Meseguer, J. (1989) General logics. Proc. Logic Colloquium '87, Granada. North Holland 275-329.
36. Meseguer, J. and Goguen, J. A. (1985) Initiality, induction and computability. In: Nivat, M. and Reynolds, J. (eds.). Algebraic Methods in Semantics, Cambridge University Press 459-540.
37. Nivela, P. (1987) Semdntica de comportamiento para especificaciones algebraicas, Ph.D. Thesis, Universitat Politecnica de Catalunya, Barcelona.
38. Nivela, P. and Orejas, F. (1988) Initial behavioural semantics for algebraic specifications. Recent Trends in Data Type Specification, Selected Papers from the 5th Workshop on Specification of Abstract Data Types, Gullane, Scotland. Springer- Verlag Lecture Notes in Computer Science 332 184-207.
39. Orejas, F. (1981) On the representation of data types. Proc. Intl. Coll. on Formalization of Programming Concepts. Springer-Verlag Lecture Notes in Computer Science 107 419-431.
40. Orejas, F. (1983) Characterizing composability of abstract implementations. Proc. 1983 Intl. Conf. on Foundations of Computation Theory, Borgholm, Sweden. Springer-Verlag Lecture Notes in Computer Science 158 335-346.
41. Orejas, F. (1984). A proof system for checking composability of implementations of abstract data types. Proc. of the Intl. Symp. on Semantics of Data Types, Sophia-Antipolis. Springer-Verlag Lecture Notes in Computer Science 173 357-374.
42. Orejas, F. (1985) On implementability and computability in abstract data types. In: Algebra, Logics and Combinatorics in Computer Science, North-Holland 633-644.
43. Orejas, F. (1986) The role of abstraction in program development (response). Proc. IFIP Congress 1986, Dublin, North-Holland 143-146.
44. Orejas, F., Navarro, M. and Sanchez, A. (1993) Implementations and behavioural equivalence: a survey. Invited Lecture. 8th Workshop on Specification of Abstract Data Types (Dourdan, 1991). Springer-Verlag Lecture Notes in Computer Science 655 93-125.
45. Orejas, F., Navarro, M. and Sanchez, A. (1994): On the correctness of modular systems. Theoretical Computer Science (to appear).
46. Orejas, F., Sacristan, V. and Clerici, S. (1989) Development of algebraic specifications with constraints. Proc. Workshop on Categorical Methods in Computer Science with Aspects from Topology. Springer-Verlag Lecture Notes in Computer Science 393 102-123.
47. Poigne, A. (1984) Another look at parameterization using subsorts, Proc. MFCS 84. Springer-Verlag Lecture Notes in Computer Science 176.
48. Reichel, H. (1981) Behavioural equivalence - a unifying concept for initial and final specification methods. Proc. 3rd Hungarian Comp. Sci. Conference 27-39.
49. Sanchez, A. (1992) Implementation de Especificaciones Algebraicas, Ph.D. Thesis, Depto. de Leng. y Sist. Inf., Basque Country University, Spain.
50. Sannella, D. T. and Tarlecki, A. (1987) On observational equivalence and algebraic specification. Journal of Computer and System Sciences 34 150-178.
51. Sannella, D. T. and Tarlecki, A. (1988a) Toward formal development of programs from algebraic specifications: implementations revisited. Acta Informatica 25 233-281.
52. Sannella, D. T. and Tarlecki, A. (1988b) Specifications in an arbitrary institution. Information and Computation 76 165-210.
53. Sannella, D. T. and Tarlecki, A. (1989) Toward formal development of ML programs: foundations and methodology. In: Proc. TAPSOFT'89, Barcelona. Springer-Verlag Lecture Notes in Computer Science 352 375-389.
54. Sannella, D. T. and Wirsing, M. (1982) Implementation of parameterized specifications. Proc. 9th Intl. Colloq. on Automata, Languages and Programming, Aarhus. Springer-Verlag Lecture Notes in Computer Science 140 473-488.
55. Sannella, D. T. and Wirsing, M. (1983) A kernel language for algebraic specification and implementation. Proc. 1983 Intl. Conf. on Foundations of Computation Theory, Borgholm, Sweden. Springer-Verlag Lecture Notes in Computer Science 158 413-427.
56. Schoett, O. (1987) Data Abstraction and the Correctness of Modular Programming, Ph.D. thesis (Report CST-42-87, Dept. of Computer Science, Univ. of Edinburgh).
57. Wirsing, M. (1991) Algebraic Specification. In: Van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, Vol. B; Formal Models and Semantics, Elsevier 675-788.