Ehrig, H.; Kreowski, H.-J.; Mahr, B.; Padawitz, P. Algebraic implementation of abstract data types. (English) Zbl 0483.68018 Theor. Comput. Sci. 20, 209-263 (1982). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 1 ReviewCited in 32 Documents MSC: 68P05 Data structures Keywords:implementations for algorithm in specific programming languages; recursive programs; synthesis; restriction; identification; correctness; hash-tables PDFBibTeX XMLCite \textit{H. Ehrig} et al., Theor. Comput. Sci. 20, 209--263 (1982; Zbl 0483.68018) Full Text: DOI References: [1] Goguen, J. A.; Thatcher, J. W.; Wagner, E. G., An initial algebra approach to the specification, correctness and implementation of abstract data types, IBM Research Report RC6487. (Yeh, R., Current Trends in Programming Methodology. Current Trends in Programming Methodology, Data Structuring, IV (1978), Prentice-Hall: Prentice-Hall Englewood Cliffs, NJ), 80-144 (1976) [2] Thatcher, J. W.; Wagner, E. G.; Wright, J. B., Data type specification: Parameterization and the power of specification techniques, (Proc. 10 SIGACT Symposium on Theory of Computing (1978)), 119-132, San Diego · Zbl 1282.68170 [3] Ehrig, H.; Kreowski, H.-I.; Thatcher, J. W.; Wagner, E. G.; Wright, J. B., Parameterized data types in algebraic specification languages, (Proc.ICALP’80. Proc.ICALP’80, Noordwijkerhout, Lecture Notes in Computer Science, 85 (1980), Springer: Springer Berlin), 157-168 [4] Ehrig, H.; Kreowski, H.-I.; Thatcher, J. W.; Wagner, E. G.; Wright, J. B., Parameter passing in algebraic specification languages, Draft version (1981) [5] Burstall, R. M.; Goguen, J. A., Putting theories together to make specifications, (Proc. International Conference Artificial Intelligence (1977)), Boston · Zbl 0518.68009 [6] Burstall, R. M.; Goguen, J. A., CAT, A system for the structured elaboration of correct programs from structured specifications, Preliminary draft (1979) [7] Burstall, R. M.; Goguen, J. A., Semantics of CLEAR, a specification language, (Proc. 1979 Copenhagen Winter School on Abstract Software Specification. Proc. 1979 Copenhagen Winter School on Abstract Software Specification, Lecture Notes in Computer Science, 86 (1980), Springer: Springer Berlin), 294-332 · Zbl 0456.68024 [8] Bergstra, J. A.; Tucker, J. V., A characterization of computable data types by means of a finite, equational specification method, (Proc. ICALP’80. Proc. ICALP’80, Noordwijkerhout, Lecture Notes in Computer Science, 85 (1980), Springer: Springer Berlin), 76-90 · Zbl 0417.68012 [9] Dijkstra, E. W., Notes on structured programming, (Hoare, C. A.R., Structured Programming (1972), Academic Press: Academic Press New York) · Zbl 0418.68032 [10] Dybjer, P., Algebraic specification of LISP, Draft report (1980), Department of Computer Science, University of California: Department of Computer Science, University of California Los Angeles [11] Ehrich, H. D., Extensions and implementations of abstract data type specifications, (Proc. MFCS’78. Proc. MFCS’78, Zakopane, Lecture Notes in Computer Science, 64 (1978), Springer: Springer Berlin), 155-163 · Zbl 0382.68028 [12] Ehrich, H. D., On the theory of specification, implementation and parameterization of abstract data types (1978), Forschungsbericht Universität Dortmund · Zbl 0467.68017 [13] Ehrig, H.; Fey, W.; Kreowski, H.-J., Algebraische Spezifikation eines Stücklistensystems—Eine Fallstudie, (Proc. German Chapter ACM Conference on Software Engineering: Entwurf und Spezifikation (1980)), Berlin [14] Ehrig, H.; Kreowski, H.-J.; Mahr, B.; Padawitz, P., Compound algebraic implementations: An approach to stepwise refinement of software systems, (Proc. MFCS’80. Proc. MFCS’80, Rydzyna, Lecture Notes in Computer Science, 88 (1980), Springer: Springer Berlin), 231-245 · Zbl 0442.68016 [15] Ehrig, H.; Kreowski, H.-J.; Padawitz, P., Stepwise specification and implementation of abstract data types, (Proc. ICALP’ 78. Proc. ICALP’ 78, Udine, Lecture Notes in Computer Science, 62 (1978), Springer: Springer Berlin), 205-226 [16] Ehrig, H.; Kreowski, H.-J.; Padawitz, P., Algebraic implementation of abstract data types: An announcement, SIGACT News, 11, 2, 25-29 (1979) · Zbl 0418.68018 [17] Ehrig, H.; Kreowski, H.-J.; Padawitz, P., Completeness in algebraic specifications, Bull. EATCS, 11, 2-9 (1980) · Zbl 0457.68019 [18] Ehrig, H.; Kreowski, H.-J.; Padawitz, P., Algebraic implementation of abstract data types: Concept, syntax, semantics and correctness, (Proc. ICALP’80. Proc. ICALP’80, Noordwijkerhout, Lecture Notes in Computer Science (1980), Springer: Springer Berlin), 142-156 · Zbl 0457.68019 [19] Ehrig, H.; Kreowski, H.-J.; Padawitz, P., A case study of abstract implementations and their correctness, (Proc. 4th International Symposium on Programming. Proc. 4th International Symposium on Programming, Lecture Notes in Computer Science, 83 (1980), Springer: Springer Berlin), 108-122, Paris · Zbl 0435.68023 [20] Ehrig, H.; Kreowski, H.-J.; Weber, H., New aspects of algebraic specification schemes for data base system, (Proc. Fachtagung “Formale Modelle für Informationssysteme” (1979)), Tutzing am See · Zbl 0388.68061 [21] Ehrig, H.; Mahr, B., Complexity of algebraic implementations for abstract data types, J. Comput. System Sci., 23, 2, 223-253 (1981) · Zbl 0474.68021 [22] Eswaran, K. P.; Gray, J. N.; Corie, RA.; Traiger, I. L., On the notions of consistency and predicate locks in a data base system, Comm. ACM, 19, 11, 624-633 (1976) · Zbl 0341.68023 [23] Ganzinger, H., Parameterized data types: Parameter passing and implementation, Draft manuscript (1980), Computer Science Division: Computer Science Division UC Berkeley [24] Gaudel, M.-C., Algebraic specification of abstract data types, INRIA Rapport de Recherche No. 360 (1979) [25] Goguen, J. A., How to prove algebraic inductive hypothesis without induction, (Lecture Notes in Computer Science, 87 (1980), Springer: Springer Berlin), 356-373 [26] Goguen, J. A.; Parsaye-Ghomi, Algebraic denotational semantics using parameterized abstract modules, (Diaz, J.; Ramos, I., Formalization of Programming Concepts. Formalization of Programming Concepts, Lecture Notes in Computer Science, 107 (1981), Springer: Springer Berlin), 292-309 · Zbl 0467.68014 [27] Goguen, J. A.; Nourani, F., Some algebraic techniques for proving correctness of data type implementation, Extended abstract (1978), Computer Science Department: Computer Science Department UCLA, Los Angeles [28] Guttag, J. V., Abstract data types and the development of data structures, Supplement to Proc. Conference on Data Abstraction, Definition, and Structure, SIGPLAN Notices, 8 (1976) [29] Guttag, J. V.; Horowitz, E.; Musser, D. R., Abstract data types and software validation, Comm. ACM, 21, 12, 1048-1063 (1978) · Zbl 0387.68012 [30] Harrison, M. A.; Lipton, R. J., Implementation of abstract data types, Extended abstract (1979), Computer Science Division: Computer Science Division UC Berkeley [31] Huet, G.; Oppen, D. C., Equations and rewrite rules: A survey, (Book, R., Formal Languages: Perspectives and Open Problems (1980), Academic Press: Academic Press New York) [32] Hupbach, U. L., Abstract implementation of abstract data types, (Proc. MFCS’80. Proc. MFCS’80, Rydzyna, Lecture Notes in Computer Science, 88 (1980), Springer: Springer Berlin), 291-304 · Zbl 0499.68011 [33] Hupbach, U. L., Abstract implementation and parameter substitution, (Proc. 3rd Hungarian Computer Science Conference (1981)), Budapest · Zbl 0499.68011 [34] Kreowski, H.-J., Algebraische Spezifikation von Softwaresystemen, (Proc. German Chapter ACM Conference on Software Engineering: Entwurf und Spezifikation (1980)), Berlin [35] Lehmann, D. H.; Smyth, M. B., Data types, (Proc. 18th IEEE Symposium on Foundations of Computing (1977)), 7-12, Providence, RI [36] Liskov, B. H.; Zilles, S. N., Programming with abstract data types, SIGPLAN Notices, 9, 50-59 (1974) [37] Mosses, P., A constructive approach to compiler correctness, (Proc. ICALP’ 80. Proc. ICALP’ 80, Noordwijkerhout, Lecture Notes in Computer Science, 85 (1980), Springer: Springer Berlin), 449-469 [38] Mosses, P., Abstract semantic algebras, Aarhus University Report DAIMI IR-29 (1981) [39] Nourani, F., Constructive extension and implementation of abstract data types and algorithms, Technical Report UCLA-ENG-7945 (1979) [40] Padawitz, P., New results on completeness and consistency of abstract data types, (Proc. MFCS’80. Proc. MFCS’80, Rydzyna, Lecture Notes in Computer Science, 88 (1980), Springer: Springer Berlin), 460-473 [41] Wand, M., Final algebra semantics and data type extensions, J. Comput. System Sci., 19, 1, 27-44 (1979) · Zbl 0418.68020 [42] Wirsing, M.; Broy, M., Abstract data types as lattices of finitely generated models, (Proc. MFCS’80. Proc. MFCS’80, Rydzyna, Lecture Notes in Computer Science, 88 (1980), Springer: Springer Berlin), 673-685 · Zbl 0441.68014 [43] Wirth, N., Program development by stepwise refinement, Comm. ACM, 14, 4, 221-227 (1971) · Zbl 0214.43005 [44] Wulf, W. A., Abstract data types: A retrospective and prospective view, (Proc. MFCS’ 80. Proc. MFCS’ 80, Rydzyna, Lecture Notes in Computer Science, 88 (1980), Springer: Springer Berlin), 94-112 [45] Zilles, S. N., An introduction to data algebras, Working draft paper (1975), IBM Research: IBM Research San José This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.