Parameterized Specifications: Parameter Passing and Implementation with Respect to Observability

ACM Transactions on Programming Languages and Systems (TOPLAS)

Volumn 5, Issue 3, 1983, Pages 318-354

  Ganzinger, Harald ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84976821809     PISSN: 01640925     EISSN: 15584593     Source Type: Journal    
DOI: 10.1145/2166.357212     Document Type: Article

References (35)

1. BERGSTRA, J.A., AND TUCKER, J.V. A natural data type with a finite equational final semantics specification but no effective equational initial semantics specification. Rep. IW 133/80, Dep. of Computer Science, Mathematisch Centrnm, Amsterdam, 1980.
2. BROY, M., DoscH, H., PARTSCH, H., PEPPER, P., AND WIRSING, M. Existential quantifiers in abstract data types. In Lecture Notes in Computer Science: Proceedings, 6th International Colloquium on Automata, Languages, and Programming (Graz, Austria, 1979). Springer-Verlag, New York, 1979, pp. 73-87.
3. BURSTALL, R.M., AND GOGUEN, J.A. The semantics of CLEAR, a specification language. In Lecture Notes in Computer Science, vol. 86: Abstract Software Specifications; Proceedings, 1979 Copenhagen Winter School (Copenhagen, Jan. 22-Feb. 2, 1979), D. Bjcrner (Ed.). Springer- Verlag, New York, 1980, pp. 292-332.
4. BURSTALL, R.M., AND GOGUEN, J.A. Putting theories together to make specifications. In Proceedings, 5th International Joint Conference on Artificial Intelligence, Cambridge, Mass., Aug. 1977, pp. 1045-1058.
5. EHRICH, H.-D. On the theory of specification, implementation, and parametrization of abstract data types. J. ACM29, 1 (Jan. 1982), 206-227.
6. EHRIG, H., AND KREOWSKI, H.-J. Parameter passing commutes with implementation of parameterized data types. In Lecture Notes in Computer Science, vol. 140: Automata, Languages, and Programming; 9th Colloqium (Aarhus, Denmark, July 12-16, 1982), M. Nielsen and E.M. Schmidt (Eds.). Springer-Verlag, New York, 1982, pp. 197-211.
7. EHRIG, H., KREOWSKI, H.-J., MAHR, B., AND PADAWITZ, P. Compound algebraic implementations: An approach to stepwise refinement of software systems. In Lecture Notes in Computer Science, vol. 88: Mathematical Foundations of Computer Science 1980; Proceedings of the 9th Symposium (Rydzyna, Poland, Sept. 1-5, 1980), P. Dembinski (Ed.). Springer-Verlag, New York, 1980, pp. 231-245.
8. EHRIG, H., KREOWSKI, H.-J., AND PADAWITZ, P. Algebraic implementation of abstract data types: Concept, syntax, semantics and correctness. In Lecture Notes in Computer Science, vol. 85: Automata, Languages and Programming; 7th Colloquium (Noordwijkerhout, Netherlands, July 14-18, 1980), J.W. de Bakker and J. van Leeuwen (Eds.). Springer-Verlag, New York, 1980, pp. 142-156.
9. EHRIG, H., KREOWSKI, H.-J., THATCHER, J.W., WAGNER, E.G., AND WRIGHT, J.B. Parameter passing in algebraic specification languages. In Lecture Notes in Computer Science, vol. 134: Workshop on Program Specification (Aarhus, Denmark, 1981). Springer-Verlag, New York, 1981, pp. 322-369. Short version in Lecture Notes in Computer Science, vol. 85” Automata, Languages and Programming; 7th Colloquium (Noordwijkerhout, Netherlands, July 14-18, 1980), J.W. de Bakker and J. van Leeuwen (Eds.). Springer-Verlag, New York, 1980, pp. 157-168.
10. GANZINGER, H. Parameterized specifications: Parameter passing and optimizing implementation. Rep. TUM-I8110, Technlsche Universitat Miinchen, Munich, W. Germany, Aug. 1981.
11. GANZINGER, H. A fmal algebra semantics for parameterized specifications. Unpublished manuscript, 1980.
12. GIARRANTANA, V., GIMONA, F., AND MONTANARI, U. Observability concepts in abstract data type specifications. In Lecture Notes in Computer Science, vol. 45: Mathematical Foundations of Computer Science 1976; Proceedings, 5th Symposium (Gdafsk, Sept. 6-10,1976), A. Mazurkiewicz (Ed.). Springer-Verlag, New York, 1976, pp. 576-587.
13. GOGUEN, J.A., AND MESEGUER, J. Universal realization, persistent interconnection and implementation of abstract modules. In Lecture Notes in Computer Science, vol. 140: Automata, Languages, and Programming; 9th Colloquium (Aarhus, Denmark, July 12-16, 1982), M. Nielsen and E.M. Schmidt (Eds.). Springer-Verlag, New York, 1982, pp. 265-281.
14. GOGUEN, J.A., AND MESEGUER, J. Completeness of many-sorted equational logic. Unpublished manuscript, SRI International, Menlo Park, Calif., 1980.
15. GOGUEN, J.A., AND NOURANI, F. Some algebraic techniques for proving correctness of data type implementation. Unpublished extended abstract, Computer Science Dept., Univ. of California, Los Angeles, Los Angeles,. California, 1978.
16. GOGUEN, J.A., AND TARDO, J.J. An introduction to OBJ: A language for writing and testing formal algebraic program specifications. In Proceedings, IEEE Conference on Specifications of Reliable Software, Cambridge, Mass., Apr. 1979, pp. 170-189
17. GOGUEN, J.A., THATCHER, J.W., AND WAGNER, E.G. An initial algebra approach to the specification, correctness, and implementation of abstract data types. In Current Trends in Programming Methodology, vol. 4: Data Structuring, R.T. Yeh (Ed.). Prentice-Hall, Englewood Cliffs, N.J., 1978, pp. 80-149.
18. GUTTAG, J. The specification and application to programming of abstract data types. Tech. Rep. 59, Computer Systems Research Group, Univ. of Toronto, Toronto, 1975.
19. GUTTAG, d.V., HOROWITZ, E., AND MUSSER, D.R. Abstract data types and software validation. Commun. ACM21, 12 (Dec. 1978), 1048-1064.
20. HOARE, C.A.R. Proof of correctness of data representations. Acta Inf. 1, 4 (Nov. 1972), 271-281.
21. HUPBACH, U.L. Abstract implementation of abstract data types. In Lecture Notes in Computer Science, vol. 88: Mathematical Foundations of Computer Science 1980; Proceedings of the 9th Symposium (Rydzyna, Poland, Sept. 1-5, 1980), P. Dembinski (Ed.). Springer-Verlag, New York, 1980, pp. 291-304.
22. KAMIN, S. Final data type specifications: A new data type specification method. In Conference Record of the 7th Annual Symposium on Principles of Programming Languages, Las Vegas, Nev., Jan. 28-30, 1980, pp. 131-138.
23. KLAEREN, H.A. A simple class of algorithmic specifications for abstract software modules. In Lecture Notes in Computer Science, vol. 88: Mathematical Foundations of Computer Science 1980; Proceedings of the 9th Symposium (Rydzyna, Poland, Sept. 1-5, 1980), P. Dembifiski (Ed.). Springer-Verlag, New York, 1980, pp. 362-374.
24. LIPECK, U. Ein algebraischer Kalkiil fiir einen strukturierten Entwurf von Datenabstraktionen. Ph.D. dissertation, Dept. of Computer Science, Univ. Dortmund, Dortmund, W. Germany, 1982.
25. LISKOV, B., SNYDER, A., ATKINSON, R., AND SCHAFFERT, C. Abstraction mechanisms in CLU. Commun. ACM20, 8 (Aug. 1977), 564-576.
26. LOECKX, J. Algorithmic specifications of abstract data types. In Lecture Notes in Computer Science, vol. 115: Automata, Languages and Programming; 8th Colloquium (Acre, Israel, July 13-17, 1981), S. Even and O. Kariv (Eds.). Springer-Verlag, New York, 1981, pp. 129-147.
27. MACLANE, S. Categories for the Working Mathematician. Springer-Verlag, New York, 1971.
28. MUSSER, D.R. Abstract data types in the AFFIRM system. IEEE Trans. Softw. Eng. SE-6, 1 (1980), 154-162.
29. PADAWITZ, P. Equational data type specifications and recursive program schemes. In Formal Description of Programming Concepts II, D. Bjcrner (Ed.). Elsevier North-Holland, New York, 1983
30. REICHEL, H. Initially-restricting algebraic theories. In Lecture Notes in Computer Science, vol. 88: Mathematical Foundations of Computer Science 1980; Proceedings of the 9th Symposium (Rydzyna, Poland, Sept. 1-5, 1980), P. Dembifiski (Ed.). Springer-Verlag, New York, 1980, pp. 504-514.
31. SANELLA, D., AND WIRSING, M. Implementation of parameterized specifications. In Lecture Notes in Computer Science, vol. 140: Automata, Languages, and Programming; 9th Colloquium (Aarhns, Denmark, July 12-16, 1982), M. Nielsen and E.M. Schmidt (Eds.). Springer-Verlag, New York, 1982, pp. 473-488.
32. THATCHER, J.W., WAGNER, E.G., AND WRIGHT, J.B. Data type specification: Parameterization and the power of specification techniques. ACM Trans. Program. Lang. Syst. 4, 4 (Oct. 1982), 711-732.
33. WAND, M. Final algebra semantics and data type extensions. J. Comput. Syst. Sci. 19, 1 (Jan. 1979), 27-44.
34. WAND, M. First-order identities as a defining language. Tech. Rep. 29, Computer Science Dept., Indiana Univ., Bloomington, Ind., 1979.
35. WULF, W.A., LONDON, R.L., AND SHAW, M. An introduction to the construction and verification of Alphard programs. IEEE Trans. Soflw. Eng. SE-2, 4 (1976), 253-265.