×

zbMATH — the first resource for mathematics

Complexity of algebraic implementations for abstract data types. (English) Zbl 0474.68021

MSC:
68P05 Data structures
68Q25 Analysis of algorithms and problem complexity
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Goguen, J.A.; Thatcher, J.W.; Wagner, E.G.; Goguen, J.A.; Thatcher, J.W.; Wagner, E.G., An initial algebra approach to the specification, correctness and implementation of abstract data types, () · Zbl 0359.68018
[2] Thatcher, J.W.; Wagner, E.G.; Wright, J.B., Data type specification: parameterization and the power of specification techniques, (), 119-132 · Zbl 1282.68170
[3] Ehrig, H.; Kreowski, H.-J.; Thatcher, J.W.; Wagner, E.G.; Wright, J.B., Parameterized specifications in algebraic specification languages, (), 157-168
[4] Aho, A.V.; Hopcroft, J.E.; Ullman, J.D., The design and analysis of computer algorithms, (1974), Addison-Wesley Reading, Mass · Zbl 0286.68029
[5] Burstall, R.M.; Goguen, J.A., Putting theories together to make specifications, () · Zbl 0518.68009
[6] Bergstra, J.A.; Tucker, J.V., A characterization of computable data types by means of a finite, equational specification method, (), 76-90 · Zbl 0417.68012
[7] Ehrich, H.D., Extensions and implementations of abstract data type specifications, (), 155-163 · Zbl 0382.68028
[8] Ehrich, H.D., On the theory of specification, implementation and parametrization of abstract data types, () · Zbl 0465.68005
[9] Ehrig, H.; Kreowski, H.-J.; Mahr, B.; Padawitz, P., Compound algebraic implementations: an approach to stepwise refinement of software systems, (), 231-245 · Zbl 0442.68016
[10] {\scH. Ehrig, H.-J. Kreowski, B. Mahr, and P. Padawitz}, Algebraic implementations for abstract data types, Theoret. Comput. Sci., in press. · Zbl 0483.68018
[11] Ehrig, H.; Kreowski, H.-J.; Padawitz, P., Stepwise specification and implementation of abstract data types, (), 205-226
[12] Ehrig, H.; Kreowski, H.-J.; Padawitz, P., Algebraic implementation og abstract data types: concept, syntax, semantics and correctness, (), 142-156 · Zbl 0412.68018
[13] Ehrig, H.; Mahr, B., Complexity of implementations on the level of algebraic specifications, (), 281-293
[14] Ehrig, H.; Mahr, B., Complexity of algebraic implementations for abstract data types: technical report version, Forschungsbericht der TU Berlin, FB 20, nr. 80-33, (1980)
[15] Goguen, J.A.; Nourani, F., Some algebraic techniques for proving correctness of data type implementation, (1978), Computer Science Department, UCLA Los Angeles, Calif, Extended Abstract
[16] Guttag, J.V., Abstract data types and the development of data structures, () · Zbl 0395.68020
[17] Harrison, M.A.; Lipton, R.J., Implementation of abstract data types, (1979), Computer Science Division Berkeley, Extended Abstract
[18] Hupbach, U.L., Abstract implementation of abstract data types, (), 291-304 · Zbl 0499.68011
[19] Kozen, D., Complexity of finite presented algebras, () · Zbl 0953.03524
[20] Lehmann, D.H.; Smyth, M.B., Data types, (), 7-12
[21] Lynch, N., Straight-line program length as a parameter for complexity measures, () · Zbl 1282.03021
[22] {\scB. Mahr}, “Measurable Implementations of Abstract Data Types,” Forschungsbericht der TU Berlin, in press. · Zbl 0474.68021
[23] Siefkes, D., Recursive equations as a programming system, (), in press · Zbl 0635.68086
[24] Wand, M., Final algebra semantics and data type extensions, () · Zbl 0418.68020
[25] Zilles, S.N., An introduction to data algebras, (Spetember 1975), IBM Research San José, working draft paper
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. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.