Abstract
This section contains 870 papers with useful bibliographic informations. Each item consists of four parts:
-
name(s) of author(s) and year of issue
-
title
-
kind(s) of publication (separated by a plus-sign ‘+’)
-
(optional:) references to citations in Zentralblatt fur Mathematik, Section 68B, (ZfM), Mathematical Reviews, Section 68B, (MR), Current Mathematical Publications, Section 68B, (CMP), Computer Abstracts, Sections Computer Theory and Programming, (CA)
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Altmann P., 1980. Software-Entwicklung auf der Grundlage von Gleichungskalkülen. TH Aachen, Dissertation.
AmbleR A.L., Good D.I., Browne C., Burger W.F., Cohen R.M., Hoch C.G., Wells R.E., 1977. GYPSY: A Language for Specification and Implementation of Verifiable Programs. Sigplan Notices, vol. 12, no. 3, pp. 1–10.
Andreka H., Nemeti I., 1979. Applications of Universal Algebra, Model Theory and Categories in Computer Science ( Survey and Bibliography )., vol. 13.
Andreka H., Nemeti I., 1980. Additions to Survey of Applications of Universal Algebra, Model Theory and Categories in Computer Science. Computational Linguistics and Computer Languages, vol. 14.
Archibald J.L., 1981. The External Structure: Experience with an Automated Module Interconnection Language. Journal of Systems and Software, vol. 2, pp. 147–157.
Ardis M.A., Hamlet R.G., 1979. Structure of Specifications and Implementations of Data Abstractions. Univ. of Maryland, LCS, TR-801.
ARDIS M.A., 1980. Data Abstraction Transformations. Univ. of Maryland, DCS, Dissertation, TR 925.
Arnold A., Karpinski M., 1980. An Easy Improvement of Bergstra-Meyer’s 81 Equations Bound for Data Specifications. EATCS Bulletin no. 12, pp. 7–9.
Asveld P.R.J., Tucker J.V., 1980. On the Operational Structure of Algebraic Programming Systems. Math. Centre Amsterdam Rep. IW 152/80 (superseded by Asveld/Tu 82). ZfM: 437. 68011
Asveld P.R.J., Tucker J.V., 1982. Complexity Theory and the Operational Structure of Algebraic Programming Systems Acta Informatica, vol. 17, pp. 451–476.
Atkinson M.P., Martin J.A., JORDAN M.A., 1978. A Uniform, Modular Structure for Databases and Programs. University of Edinburgh, DCS, CSR–33–78.
Atkinson R.R., Liskov B.H., Scheifler R.W., 1978. Aspects of Implementing CLU. MIT, LCS, Computation Structures Group Memo 167 + Proc. ACM 1978 Annual Conference.
Ausiello G., Mascari G.F., 1979. On the Design of Algebraic Data Structures with the Approach of Abstract Data Types.Proc. EUROSAM 79, LNCS 72, pp. 514–530. ZfM: 402. 68013
Ausiello G., 1978. Data Types for Manipulation of Algebraic Expressions. Seminar on ‘Introduction to Symbolic and Algebraic Manipulation’, IAC/CNR Rome/Italy + Abstract in Sigsam Bulletin, vol. 12, no. 2, p. 10.
Balzer R.M., Goldman N., 1979. Principles of Good Software Specification and their Implications for Specification Languages Proc. ‘Specifications of Reliable Software’, pp. 393–400, IEEE.
Balzer R.M., 1967. Dataless Programming. Proc. AFIPS, FJCC, vol. 31, pp. 535–544.
Banachowski L., 1978. On Implementations of Abstract Data Types. Proc. 26. Coll. on ‘Mathematical Logic in Computer Science’, pp. 143–166, North Holland. CMP:14. 14. 987
Banachowski L., 1980. On Proving Program Correctness by Means of Stepwise Refinement Method. Proc. ‘Algorithmic Logic’, LNCS.
Banatre M., Couvert A., Herman D., PLOYETTE F., RISTORI J., 1977. Notions sur les types abstraits de donnees. Ecole IRIA, Marseille.
Banatre M., Couvert A., Herman D., Raynal M., 1977 a. Types abstraits et objets conserves. Bulletin Bigre 7, pp. 7–11.
Banatre M., Couvert A., Herman D., Raynal M., 1977 b. Conservation d’objets types. Actes des Journees Bigre, pp. 29–32.
Banatre M., Couvert A., Herman D., Raynal H., 1978 a. Types abstraits et pluralité de leurs representations a Vexecution. Proc. 3rd Internat. Symp. on Programming, pp. 263–278. ZfM: 405. 68019
Banatre M., Couvert A., Herman D., Raynal M., 1978 b. Langages de programmation et mecanisme de protection. Univ. Rennes, IRISA, TR no. 89.
Banatre M., Couvert A., Herman D., Raynal M., 1978 c. Presentation et evaluation du projet SOC: Un systeme d’objets conserves.
Actes du Congres AFCET, Gif/Yvette, pp. 446–456.
Banatre M., Couvert A., Herman D., Raynal M., 1981. An Experience in Implementing Abstract Data Types. Software Practice Experience, vol. 11, no. 3, pp. 315–320. ZfM: 463. 68026
Banatre M., 1978. m Types abstraits et objets conserves. Univ. Rennes, these de 3eme cycle.
Barnard D.T., Ellliott W.D., 1977. Notes on EUCLID. Univ. of Toronto, Computer Systems Research Group, TR 82.
Barnard D.T., et al, 1978. EUCLID and MODULA. Sigplan Notices, vol. 13, no. 3, pp. 70–84.
Bartels U., Althoff W., Raulefs P., 1981. APE: An Expert System for Automatic Programming from Abstract Specifications of Data Types and Algorithms. Univ. Bonn, Inst. f. Informatik III, Memo SEKI-BN-81-01.
Bartussek W., Parnas D.L., 1977. Using Assertions to Write Abstract Specifications for Software Modules. Univ. of North Carolina, Rep. 77–012 + Proc. Conf. ‘Information Systems Methodology’, LNCS 65, pp. 211–236.
Bauer F.L., Broy M., DOSCH W., Gnatz R., Geiselbrechtinger F., Hesse W., Krieg-BrüCkner B., Laut A., Matzner T., Möller B., Partsch H., Pepper P., SAMELSON K., Wirsing M., Wössner H., 1981 a. Report on a Wide Spectrum Language for Program Specification and Development (Tentative Version). TU München, Inst. f. Informatik, Bericht TUM-I8104.
Bauer F.L., Broy M., Dosch w., Gnatz r., Krieg-Brückner B., Laut a., Luckmann M., Matzner T., Möller B., Partsch H., Pepper P., Samelson K., Steinbröggen R., Wirsing M., Wössner H., 1981 b. Programming in a Wide Spectrum Language: A Collection of Examples. Science of Computer Programming 1, pp. 73–114.
Bauer F.L., Broy M., Gnatz R., Krieg-Brockner B., Partsch H., Pepper P., Wössner H., 1978. Towards a Wide Spectrum Language to Support Program Specification and Program Development. Int. Summer School on Program Construction, München 1978 + Sigplan Notices, vol. 17, no. 12, pp. 15–24.
Bauer F.L., Wössner H., 1981. Algorithmische Sprache und Programmentwicklung. Springer Verlag: Informatik Lehrbuchreihe.
Bauer F.L., Wössner H., 1982. Algorithmic Language and Program Development. Springer Verlag: Texts and Monographs in Computer Science.
Bauer F.L., 1979. Algorithms and Algebra. Proc. ‘Algorithms in Modern Mathematics and Computer Science’, LNCS 122, pp. 421–429.
Beichter F., Buchegger O., Fuchs N.E., Herzog 0., 1979. SLAN 4 - A Software Specification and Design Language. IBM Lab. Böblingen, GTR 05-235 + Floyd/Klopetz (eds.): ‘ Software Engineering - Entwurf und Spezifikation’, vol. 5, Teubner Verlag.
Beichter F., Herzog O., Petzsch H., 1982. SLAN-4 Reference Manual and Design Rationale. IBM Lab. Böblingen, GTR 05 - 272.
Belady L.A., Leavenworth B.M., 1980. Program Modifiability. IBM Yorktown, RC 8147.
Bentley J.L., Shaw M., 1978. An ALPHARD Spécification of a Correct and Efficient Transformation on Data Structures.
Shaw (éd.): ‘ALPHARD: Form and Content’, pp. 255–282.
Berg H.K., Giloi W.K., 1980. Hierarchical Specification of Abstract Data Types. Seminar ‘The Use of Formal Specification of Software’, IFB 36, pp. 150–196. ZfM: 452. 68023
Bergman M., Deransart P., 1981. Abstract Data Types arid Rewriting Systems: Application to the Programming of Algebraic Abstract Data Types in PROLOG. Proc. CAAP’81, LNCS 112, pp. 101–116. ZfM:468.68018 - MR:82h.68018 - CMP: 13. 23. 1830 Algebraic Specifications: A Constructive Methodology in Logic Programming. Proc. EUROCAM182, LNCS 144.
Bergman M., 198x. Compiling Algebraic Abstract Data Types with Horn Clauses. Faculté des Sciences de Luminy, France + Abstract in Sigsam Bulletin, vol. 14, no. 4, p. 13–14.
Bergstra J.A., Broy M., Tucker J.V., Wirsing M., 198x. On the Power of Algebraic Specifications. Proc. 10th MFCS, LNCS 118, pp. 193–204. ZfM: 462. 68001
Bergstra J.A., Kleijn H.C.M., Nouwt P., 1980. On the Algebraic Specification of Infinite Data Types Using Monoidal Auxiliary Functions. Univ. of Leiden, Rep. 80–43.
Bergstra J.A., Klop J.W., 1981 b. Initial Algebra Specifications for Parameterized Data Types. Math. Centre Amsterdam Rep. IW 186/81 + Proc. 7th CAAP’82, Lille. ZfM:474.68019 - CMP: 14. 18. 1310
Bergstra J.A., Meyer J.J.C., 1980 a. On Specifying Sets of Integers. Univ. of Leiden, Rep. 80–21.
Bergstra J.A., Meyer J.J.C., 1980 b. On Bounds for the Specification of Finite Minimal Monoids by Means of Equations Using Only Unary Hidden Functions. Univ. of Leiden, Rep. 80–11 (superseded by Bergstra/Me 82).
Bergstra J.A., Meyer J.J.C., 1980 c. Small Specifications for Large Finite Data Structures.
Univ. of Leiden, Rep. 80-13 + Int. J. Computer Math., vol. 9, no. 4, pp. 305–320.
Bergstra J.A., Meyer J.J.C., 1980 d. On Axiomatizing Finite Data Structures. Univ. of Leiden, Rep. 80–18.
Bergstra J.A., Meyer J.J.C., 1980 e. A Simple Transfer Lemma for Algebraic Specifications.Free Univ. Amsterdam, Rep. IR-64 + IPL, vol. 14, no. 2, pp. 80–85. CA:26.07. 1957
Bergstra J.A., Meyer J.J.C., 1981 a. I/O-Computable Data Structures. Sigplan Notices, vol. 16, no. 4, pp. 27–32.
Bergstra J.A., Meyer J.J.C., 1981 b. An Equational Class of I/O-Computable Data Structures that Contains no Recursive Data Structures. EATCS Bulletin no. 13, pp. 25–30.
Bergstra J.A., Meyer J.J.C., 1982. The Equational Specification of Finite Minimal Unoids Using only Unary Hidden Functions. Free Univ. Amsterdam, Report no. 209 + Fundamenta Informaticae, vol. 5.
Bergstra J.A., Ollongren A., Van Der Weide T.P., 1977. An Axiomatization of the Rational Data Objects. Proc. FCT’77, LNCS 56, pp. 33–38. ZfM: 363. 68045
Bergstra J.A., Terlouw J., 1981. A Completeness Result for Algebraic Hoare Logics. Univ. of Leiden, Rep. 81-09.
Bergstra J.A., Terlouw J., 1982. Standard Model Semantics for DSL-A Datatype Specification Language. Univ. of Utrecht, Dept. of Mathematics, Preprint no. 234 + Acta Informatica.
Bergstra J.A., Tucker J.V., 1979 a. Algebraic Specifications of Computable and Semi computable Data Structures. Math. Centre Amsterdam Rep. IW 115/79. ZfM: 419. 68029
Bergstra J.A., Tucker J.V., 1979 b. A Characterization of Computable Data Types by Means of a Finite, Equational Specification Method. Math. Centre Amsterdam Rep. IW 124/79 + Univ. of Leiden, Report no. 79-21 + Proc. ICALP’80, LNCS 85, pp. 76–90. ZfM:417.68012/449.68003 - CMP:13. 03. 197
Bergstra J.A., Tucker J.V., 1979 c. On the Adequacy of Finite Equational Methods for Data Type Specification. Math. Centre Amsterdam Rep. IW 127/79 + Sigplan Notices, vol. 14, no. 11, pp. 13–18.
Bergstra J.A., Tucker J.V., 1980 a. Equational Specifications for Computable Data Types: Six Hidden Functions Suffice and Other Sufficiency Bounds. Math. Centre Amsterdam Rep. IW 128/80. ZfM: 418. 68019
Bergstra J.A., Tucker J.V., 1980 b. On Bounds for the Specification of Finite Data Types by Means of Equations and Conditional Equations. Math. Centre Amsterdam Rep. IW 131/80.ZfM:421.68021
Bergstra J.A., Tucker J.V., 1980 c. A Natural Data Type with a Finite Equational Final Semantics Specification but no Effective Equational Initial Semantics Specification. Math. Centre Amsterdam Rep. IW 133/80 + EATCS Bulletin no. 11, pp. 23–33.
Bergstra J.A., Tucker J.V., 1980 d. Initial and Final Algebra Semantics for Data Type Specifications: Two Characterization Theorems. Math. Centre Amsterdam Rep. IW 142/80 + SIAM Journal of Computing. ZfM: 431. 68021
Bergstra J.A., Tucker J.V., 1980 e. Algebraically Specified Programming Systems and Hoare’s Logic. Math. Centre Amsterdam Rep. IW 143/80 + Proc. 8th ICALP’81, LNCS 115, pp. 348–362. ZfM:465.68003 - CMP:14. 05. 278
Bergstra J.A., Tucker J.V., 1980 f. On the Refinement of Specifications and Hoare’s Logic. Math. Centre Amsterdam Rep. IW 155/80 + LNCS 131, pp. 24–36.
Bergstra J.A., Tucker J.V., 1980 g. The Completeness of the Algebraic Specification Methods for Data Types. Math. Centre Amsterdam Rep. IW 156/80.
Bergstra J.A., Tucker J.V., 1982. Hoare’s Logic for Programming Languages with two Data Types. Math. Centre Amsterdam Rep. IW 207 /82.
Bergstra J.A., Van Der Weide T.P., 1978. Process Semantics of Algebraic Datatypes. Univ. Leiden, Report no. 78-6 + Proc. ‘Mathematical Logic in Computer Science’, pp. 167–180, North Holland. CMP:14. 14. 987
Bergstra J.A., 1977. What is an Abstract Data Type?. Univ. of Leiden, Rep. 77-12 + IPL, vol. 7, no. 1, pp. 42–43. ZfM: 374. 68023
Berry D.M., Berry O., 1980. The Prograrmner-Client Interaction in Arriving at Program Specifications: Abstract Data Typing, Strong Typing and Jewish Motherhood. UCLA, DCS, Report.
Berry D.M., Erlich Z., Lucena C.J.P., 1976. Correctness of Data Representations: Pointers in High Level Languages. Proc. ‘Conference on Data: Abstraction, Definition and Structure’, Sigplan Notices, vol. 8, no. 2, pp. 115–119.
Berryr D.M., Erlich Z., Lucena C.J.P., 1977. Pointers and Data Abstractions in High Level Languages I: Language Proposals. Computer Languages, vol. 2, pp. 135–148. ZfM: 433. 68012
Berryr D.M., Kemmerer R.A., Von Staa A., Yemini S., 1978. Toward Modular Verifiable Exception Handling. Computer Languages, vol. 5, pp. 77–101.
Berryr D.M., 1977. Pointers and Data Abstractions in High Level Languages II: Correctness Proofs. Computer Languages, vol. 2, pp. 149–170. ZfM: 433. 68013
Berryr D.M., 1981. The Application of the Formal Development Methodology to Data Base Design and Integrity Verification. UCLA, DCS, Report + UCLA Computer Science Dept. Quarterly, Fall 1981, vol. 9, no. 4, pp. 63–96.
Bert D., Jacquet P., 1977 a. Types abstraits generiques et multireprésentation. Bulletin GROPLAN, no. 2, pp. 41–47 (AFCET - Informatique).
Bert D., Jacquet P., 1977 b. Generic Abstract Data Types. Univ. of Grenoble, IMAG, Report no. 97 + Proc. 5th Annual Conference III organized by WG 2.1 (IFIP).
Bert D., Jacquet P., 1978. Some Validation Problems with Parameterized Types and Generic Functions. Proc. 3rd Int. Symp. on Programming, pp. 279–292. ZfM:405.68018 - MR: 80d. 68025
Bert D., SOLER R., 1981. About Data Type Genericity. Proc. Proc. ‘Formalization of Progr. Concepts’, LNCS 107, pp. 231–243. ZfM:467.68020 - MR:82f.68005 - CMP: 13. 22. 1758
Bert D., 1978. Specification algébrique des types abstraits et certification de programmes. Bulletin GROPLAN, no. 8 (AFCET - Informatique).
Bert D., 1979. La programmation generique - Construction de logiciel, specification algebrique et verification. Univ. of Grenoble, IMAG, thèse d’etat.
Bert D., 1980 a. Specification algebrique et axiomatique des exceptions. Univ. of Grenoble, IMAG, Report no. 183.
Bert D., 1980 b. Types algebriques et semantique des langages de programmation. Proc. 4th Int. Symp. on Programming, LNCS 83, pp. 30–43. ZfM: 435. 68024
Bert D., 1981. LPG - Langage pour la programmation générique. Univ. of Grenoble, IMAG, Report no. 262.
Bert D., 1982. Software Components Construction. Nee! (ed.): ‘Tools and Notions for Program Construction’, pp. 347–376, Cambridge University Press.
Bert Homieu B., 1981. Algebraic Specification of Communication Protocols. USC, ISI, Report RR-81–98.
Bertoni A., Mauri G., Miglioli P.A., Wirsing W., 1979. On Different Approaches to Abstract Data Types and the Existence of Recursive Models. EATCS Bulletin no. 9, pp. 47–57.
Bertoni A., Mauri G., Miglioli P.A., 1978. Model-Theoretic Aspects of Abstract Data Specifications. Proc. 26th ‘Mathematical Logic in Computer Science’, pp. 181–193, North Holland. CMP:14. 14. 987
Bertoni A., Mauri G., Miglioli P.A., 1979. A Characterization of Abstract Data Types as Model-Theoretic Invariants. Proc. 6th ICALP, LNCS 71, pp. 26–38 + Annales Societatis Mathematicae Palonae, Series IV, Fundamenta Informaticae VI.1. MR:82a.68027 - CMP:12.20.1333 - MaBi8662
Bertoni A., Mauri G., Miglioli P.A., 1980. Towards a Theory of Abstract Data Types: A Discussion on Problems and Tools. Proc. Int. Symp. on Programming, LNCS 83, pp. 44–58. ZfM:435.68022 - MR:82c.68013 - CMP:13. 06. 429
Berzins V.A., 1979. Abstract Model Specifications for Data Abstractions. MIT, LCS, TR-221.
Bidoit M., Gresse C., Guiho G., 1981. Assisted Program Construction from Abstract Data Type Decomposition. Lab. de Marcoussis, Internal Report.
Bidoit M., 1981. Une method de presentation de types abstraits: applications. Univ. de Pari s-Sud, thèse de 3eme cycle.
Bidoit M., 1982 a. Types abstraits algebriques: spécifications structurées et présentations gracieuses. Proc. AFCET Coll. ‘Les mathématiques de l’informatique’, Paris ‘82, pp. 347–358.
Bidoit M., 1982 b. Putting Together ‘Fair’ Presentations of Abstract Data Types into Structured Specifications. Lab. de Marcoussis, Report.
BIDOIT M., 1982 c. Automatic Transformation of Abstract Data Types ‘Fair’ Presentations. ECAI, Orsay, France.
Bidoit M., 1982 d. Proofs by Induction in ‘Fairly’ Specified Equational Theories. Proc. 6th German Workshop ‘Artificial Intelligence’, Bad Honnef, Germany.
Birkhoff G., Lipson J.D., 1970. Heterogeneous Algebras. Journal of Combinatorial Theory, vol. 8, pp. 115–133.
Black A.P., 1979. Exception Handling and Data Abstraction. IBM Yorktown, RC 8059.
Booth T.L., Wiecek C.A., 1980. Performance Abstract Data Types as a Tool in Software Performance Analysis and Design. IEEE-SE, vol. SE-6, no. 2, pp. 138–151. ZfM:432.68027 - CA: 24. 06. 1649
Bothe K., 1978. Spezifikation und Verifikation abstrakter Datentypen. ZfR - Informationen, ZfR-7811.
Bothe K., 1979. Specification and Verification of Abstract Data Types. Humboldt Univ. Berlin, Seminarbericht Nr. 13. ZfM:416.68017 - MR: 80i. 68011
Bothe K., 1980 a. Abstrakte Datentypen und ihre Spezifikation. Wiss. Z. Techn. Univ. Dresden Nr. 29, pp. 341–344. ZfM: 435. 68020
Bothe K., 1980 b. A Generalised Abstract Data Type Concept. Humboldt Univ. Berlin, Sektion Mathematik, Preprint no. 3. ZfM: 469. 68025
Bothe K., 1981 a. Restructuring a Compiler by Abstract Data Types - An Experiment in Using Data Abstractions for Software Modularization. Humboldt Univ. Berlin, Seminarbericht Nr. 40. ZfM: 477. 68026
Bothe K., 1981 b. A Comparative Study of Abstract Data Type Concepts. E IK, vol. 17, pp. 237–257. ZfM:484.68014 - CMP: 14. 16. 1142
Boulenger J., Kronental M., 1975. Aspects de la notion de type en programmation. IRIA, Report no. 108.
Bradshaw F.T., Ernst G.W., Hookway R.J., 1982. Use of Data Abstraction in Process Specification. ACM Sigsoft, vol. 7, no. 3, pp. 16–21.
Brand D., 197x. A Note on Data Abstractions. IBM Yorktown + Sigplan Notices, vol. 13, no. 1, pp. 21–24.
Brodie M.L., Mylopoulos J., Schmidt J.W., 1983. On Conceptual Modelling: Perspectives from Artificial Intelligence, Databases and Programming Languages. Springer Verlag.
Brodie M.L., Schmidt J.W., 1978. What is the Use of Abstract Data Types?. Proc. 4th Int. Conf. on VLDB.
Brodie M.L., 1978 a. Specification and Verification of Database Semantic Integrity. Univ. of Toronto, Ph.D. Dissertation, CSRG-91.
Brodie M.L., 1978 b. Data Types and Databases. Univ. of Maryland, IFSM, TR-37.
Brodie M.L., 1978 c. The Application of Data Types to Databases. Univ. of Hamburg, FB Informatik, IFI-HH-B-51/78. ZfM: 425. 68025
Brodie M.L., 1979. The Application of Data Types to Data Base Semantic Integrity. Univ. of Maryland, TR-833 + Inform. Syst., vol. 5, pp. 287–296.
Brodie M.L., 1980 a. Data Abstraction, Databases and Conceptual Modelling: An Annotated Bib!iography. US Dept. of Commerce, National Bureau of Standards, NBS Special Publication 500–59.
Brodie M.L., 1980 b. Data Abstraction for Designing Database Intensive Applications. Proc. ‘Workshop on Data Abstraction, Databases and Conceptual Modelling’, ACM Special Issue, pp. 101–103.
Brodie M.L., 1981. Axiomatic Definitions for Data Model Semantics. Inform. Systems, vol. 7, no. 2, pp. 183–197.
Broy M., Dosch W., Möller B., Wirsing M., 1981. GOTOs - A Study in the Algebraic Specification of Programming Languages. Univ. of Edinburgh, CSR-89-81 + Proc. 11. Jahrestagung der Gl, IFB 50, pp. 109–121. ZfM: 481. 68028
Broy M., Dosch W., Müller B., Wirsing M., 1982. Abstrakte Datentypen. Informatik Spektrum, vol. 5, no. 3, p. 189.
Broy M., Dosch W., Partsch H., Pepper P., Wirsing M., 1979. Existential Quantifiers in Abstract Data Types. TU München, Internal Report + Proc. 6th ICALP, LNCS 71, pp. 73–87. ZfM:404.68026–MR:81d.68028 - CMP: 12. 20. 1333
Broy M., Möller B., Pepper P., Wirsing M., 1980. A Model-Independent Approach to Implementations of Abstract Data Types. Proc. ‘Algorithmic Logic and the Programming Language LOGLAN’, LNCS.
Broy M., Moller B., Pepper P., Wirsing M., 1983. Algebraic Implementations Preserve Program Correctness. SCP.
Broy M., PAIR C., Wirsing M., 1981. A Systematic Study of Models of Abstract Data Types. Univ. of Nancy, CRIN, 81-R-42.
Broy M., Pepper P., Wirsing M., 1982. On the Algebraic Definition of Programming Languages. TU München, Inst. f. Informatik, TUM-I8204.
Broy M., Pepper P., 1981. Program Development as a Formal Activity. TU München, Inst. f. Informatik, TUM-I8012 + IEEE-SE, vol. SE-7, no. 1, 14–22.
Broy M., Wirsing M., 1979. The Theory of Recursive Functions as an Abstract Type and its Semantical Model TU München, Inst. f. Informatik, Internal Report.
Broy M., Wirsing M., 1980 a. Programming Languages as Abstract Data Types. Proc. 5th CAAP, pp. 160–177. ZfM: 433. 68014
Broy M., Wirsing M., 1980 b. Partial-Recursive Functions and Abstract Data Types. EATCS Bulletin no. 11, pp. 34–41.
Broy M., Wirsing M., 1980 c. Initial Versus Terminal Algebra Semantics for Partially Defined Abstract Types TU München, Inst. f. Informatik, TUM-I8018 (superseded by Broy/Wi 82b).
Broy M., Wirsing M., 1980 d. Algebraic Definition of a Functional Programming Language and its Semantic Models. TU München, Inst- f. Informatik, TUM-I8Q08 + RÄIRO.
Broy M., Wirsing M., 1981 a. On the Algebraic Specification of Nondeterministic Programming Languages. Proc. 6th CAAP’81, LNCS 112, pp. 162–179.
Broy M., Wirsing M., 1981 b. Unbounded Nondeterminism - An Exercise in Abstract Data Types. Seminaire INRIA, langage et traducteurs, France, pp. 75–98.
Broy M., Wirsing M., 1981 c. On the Algebraic Extensions of Abstract Data Types. Pipcv ‘Formalization of Programming Concepts’, LNCS 107, pp. 244–251. MR:82f.68005 - CMP: 13. 22. 1758
Broy M., Wirsing M., 1982 a. On the Algebraic Specification of Finitary Infinite Communicating Sequential Processes. Proc. 2nd IFIP TC2 Working Conf. ‘Formal Descriptions of Programming Concepts’, North Holland.
Broy M., Wirsing M., 1982 b. Partial Abstract Types. Acta Informatica, vol. 18, pp. 47–64.
Broy M., 1975. Prospects of New Tools for Software Development. Proc. 3rd ECI Conf., LNCS 123, pp. 106–121.
Bublik V.V., Gorohovskil S.S., 1978. Algebraic Interpretation of Data Structures. Kibernetika, Kiev 78, no. 2, pp. 10–15, (Russian with English Summary). ZfM: 384. 68019
Buchberger B., 1971. Associating Functions and the Operator of Conditioned Iteration. Comm. of JINR, Dubna, Pr-5788 + Univ. Innsbruck, Inst. f. Informatik, Bericht Nr. 71–1.
Buckle N., 1977. Restricted Data Types, Specification and Enforcement of Invariant Properties of Variables. Proc. ‘Language Design for Reliable Software’, Sigplan Notices, vol. 12, no. 3.
Burstall R.M., Goguen J.A., 1977. Putting Theories Together to Make Specifications. Proc. 5th IJCAI, Boston, pp. 1045–1058.
Burstall R.M., Goguen J.A., 1980. The Semantics of CLEAR, a Specification Language. Univ. of Edinburgh, DCS, CSR-65-80 + Proc. Winter School Copenhagen on Abstract Software Specifications, LNCS 86, pp. 292–332. ZfM: 456. 68024
Burstall R.M., Goguen J.A., 1981 a. Algebras, Theories and Freeness: An Introduction for Computer Scientists. Marktoberdorf Summer School 1981.
Burstall R.M., Goguen J.A., 1981 b. An Informal Introduction to Specifications Using CLEAR. Boyer/Moore (eds.): ‘The Correctness Problem in Computer Science’, Acad. Press, pp. 185–213 + International Summer School on Theoretical Foundations of Programming Methodology München 1981. CMP:14. 11. 689
Burstall R.M., Landin P.J., 1969. Programs and their Proofs - An Algebraic Approach. Machine Intelligence, vol. 4, pp. 17–43.
Burstall R.M., Macqueen D.B., Sannella D.T., 1980. HOPE: An Experimental Applicative Language. Univ. of Edinburgh, DCS, CSR-62-80.
Burstall R.M., 1980. Electronic Category Theory. Proc. 9th MFCS’80, LNCS 88, pp. 22-39 + Marktoberdorf Summer School 1981. ZfM:462.68003 - MR:82a.68011 - CMP:13. 09. 673
Burstall R.M., 1981. Notes on Category Theory. Marktoberdorf Summer School 1981.
Burton F.W., Lings B.J., 1980 a. Abstract Data Types, Subtypes and Data Independence. The Computer Journal, vol. 24, no. 4, pp. 308–311. CA:26. 01. 177
Burton F.W., Lings B.J., 1980 b. FACETS: A Language Feature for Security and Flexibility. The Australian Computer Journal, vol. 12, no. 4., pp. 125–131.
Burton F.W., 1979. Logical and Physical Data Types in Geographical Information Systems. Geo-Processing, vol. 1, pp. 167–181.
Callegarin G., Pacini G., 1981. About the Implement ability arid the Power of Equationally Defined Data Abstractions. TCS, vol. 14, no. 3, pp. 305–315. ZfM:472.68011 - CMP:13.20.1604 - CA:25.07. 1837
Cartwright R., 1980. A Constructive Alternative to Axiomatic Data Type Definitions. Cornell Univ., DCS, TR 80–427.
Castilho J.M.V., Furtado A.L., 1980. Algebraic Specification of Database Applications. PUC, TR DB-108004.
Chabrier J.J., Chabrier J., 1982. Un système de spécification utilisant des types abstraits algébrique et des pré- post conditions. Actes journées GROPLAN - gréco de programmation.
Chabrier J.J., Derniame J.C., 1976. Conception de bases de données évolutives a l’aide de types abstraits de données. Journées informatiques de Nice.
Chabrier J.J., Joniame J.C., 1982. Programmation a l’aide de types abstraits: Le système TYP. TSI, vol. 1, no. 4, pp. 287–295.
Chand D., Yadav S., 1978. On the Application of Data Abstraction Facilities. Proc. 1978 ACM Annual Conference, Washington, D.C., pp. 639–645.
Chang E., Kaden N.E., Elliott W.D., 1978. Abstract Data Types in EUCLID. Sigplan Notices, vol. 13, no. 3, pp. 34–42.
Chaudhary B.D., Sahasrabuddhe H.V., 1978. Suggestions about a Specification Technique. Sigplan Notices, vol. 13, no. 12, pp. 25–28.
Chew P., 1980. An Improved Algorithm for Computing with Equations. Proc. 21st FOCS’80, pp. 108–117.
Chew P., 1981. Choppy C., Lescanne P., Remy J.L., 1980 a. Improving Abstract Data Types Specifications by Appropriate Choice of Constructors. Workshop on Program Construction, Bonas, 1980 + Bierman/Guiho/Kodratoff (eds.): ‘Automatic Program Construction Techniques’, MacMillan, New York.
Choppy C., Lescanne P., Remy J.L., 1980 b. Using Models to Construct and Implement Abstract Data Types. Univ. of Nancy, CRIN, Report no. 79-R-079.
Claybrook B.G., Claybrook A.-M.G., Keeton-Williams J., 1981. Defining Database Views as Data Abstractions. Mitre Corp., Report M82-3. Amp;Aybrook B.G., Cleaveland J.C., Criscione D., 1979. Logical Structure Specification and Data Type Definition. Proc. A€M’79 Conf., pp. 203–211.
Claybrook B.G., et al, 198x. Abstract Data Type Specification: A Comparison of Two Methods. Report.
Claybrook B.G., Wyckoff M.P., 1980. MODULE: An Encapsulation Mechanism for Specifying and Implementing Abstract Data Types. Proc. ACM’80 Conf., pp. 225–235.
Claybrook B.G., 198x. An Approach to Data Indépendance Using Abstract Data Types. Report.
Claybrook B.G., 1981. A Specification Method for Specifying Data and Procedural Abstractions. IEEE-SE, vol. SE-8, no. 5, pp. 449–459.
Cleaveland J.C., 1980 a. Mathematical Specifications. Sigplan Notices, vol. 15, no. 12, pp. 31–42.
Cleaveland J.C., 1980 b. Programming Languages Considered as Abstract Data Types. Proc. ACM’81 National Conf.
Closs E., 1977. Betrachtungen zur Charakterisierung von Datentypen. TU München, Inst. f. Informatik, Diplomarbeit. Unique Normal Forms in Term Rewriting Systems with Repeated Variables. Proc. 13th ACM Symp. ‘Theory of Computing’, pp. 7–18.
Comyn G., Werner G-, 1978. Une définition de types de données effectifs. Univ. of Lille, Report no. IT-8-78.
Comyn G., Werner G., 1979 a. Diverses characterisations de types de données effectifs. Actes de l’ecole d’été AFCET de Monastir.
Comyn G., Werner G., 1979 b. Computable Data Types. Proc. MFCS’79, LNCS 74, pp. 228–236.
Comyn G., Werner G., 1980. Structures d’algorithmes et types de données calculables. Congrès AFCET, Nancy.
Comyn G., 1982. Objets infinis calculables. Univ. Lille, thèse d’état.
Correll C.H., 1978. Proving Programs Correct through Refinement. Acta Informatica, vol. 9, pp. 121–132.
Cowan D.D., Graham J.W., Welch J.W., Lucena C.J.P., 1978. A Data-Directed Approach to Program Construction. Software Practice Experience, vol. 10, pp. 355–372.
Cowan D.D., Lucena C.J.P., 1978. Some Thoughts on the Construction of Programs - A Data–Directed Approach. Proc. 3rd Jerusalem Conf. on Information Technology, pp. 531–535, North Holland.
Cremers A.B., Hibbard T.N., 1980. Specification of Data Spaces by Means of Context-Free Grammar-Controlled Primitive Recursion. Univ. of Dortmund, Abt. Informatik, Bericht Nr. 107.
Cristian F., 1981. Robust Data Types. Proc. Workshop on ‘Program Specification’, Aarhus, LNCS 134, pp. 215–254 + Acta Informatica, vol. 17, pp. 365–398. ZfM: 474. 68020
Cristian F., 1982. Exception Handling and Software Fault Tolerance. IEEE-Trans, on Computers, vol. C-31, no. 6, pp. 531–540
Cunha P.R.F., Maibaum T.S.E., 1980. A Communication Data Type for Message Oriented Programming. Proc. Int. Symp. on Programming, LNCS 83, pp. 79–91. ZfM: 435. 68026
Cunha P.R.F., Maibaum T.S.E., 1981. Resource = Abstract Data Type + Synchronization. A Methodology for Message Oriented Programming. Proc. 5th IEEE Int- Conf. on Software Engineering, pp. 263–272.
Darlington J., 1980 a. The Synthesis of Implementations for Abstract Data Types - A Program Transformation Tactic. Imperial College, Dept. of Computing, Report + Bierman/Guiho (eds.): ‘Computer Program Synthesis Methodologies’, pp. 309–334, Reidel Publishing Comp.
Daz J., 1980 b. The Design of Efficient Data Representations. Imperial College Dept. of Computing, Report.
De Carvalho R.L., Maibaum T.S.E., Pequeno T.H.C., Pereda Borquez A.A., Veloso P.A.S., 1982. A Model Theoretic Approach to the Semantics of Data Types and Structures. PUC, Dept. Inf., TR + Proc. Int. Comp. Symp. 82, Feng Chia University, Taiwan.
Demers A.J., Donahue J.E., Skinner G., 1978. Data Types as Values: Polymorphism, Type-Checking, Encapsulation. Proc. 5th POPL, Tucson, pp. 23–30.
Demers A.J., Donahue J.E., 1980 a. Data Types, Parameters and Type Checking. Proc. 7th POPL’80, pp. 12–23.
Demers A.J., Donahue J.E., 1980 b. The Russel Semantics: An Exercise in Abstract Data Types. Cornell Univ., TR 80–431.
Denert E., 1979. Software Modularisierung. Informatik Spektrum, vol. 2, pp. 204–218.
Dennis J.B., 1975. An Example of Programming with Abstract Data Types. MIT, Project MAC, Computation Structures Group Memo 131 + Sigplan Notices, vol$110, no$17, pp. 25–29 + Review in SIGPLAN Notices, vol. 11, no. 2, p. 13.
Deremer F.L., LEVY P., 1979. Summary of the Characteristics of Some ‘Modern’ Programming Languages. Sigplan Notices, vol. 14, no. 5, pp. 28–45.
Derniame J.C., Finance J.P., 1979. Types abstraits de données: Spécification, utilisation et réalisation. Ecole d’été AFCET, Monastir.
Dershowitz N., 1979. Orderings for Term-Rewriting Systems. TCS, vol. 17, pp. 279–301.
Dershowitz N., 1981. Termination of Linear Rewriting Systems. Proc. 8th ICALP’81, LNCS 115, pp. 448–458.
Deschamp P., 1982. PERLUETTE: A Compilers Producing System Using Abstract Data Types. Proc. 5th Coll. in Programming, LNCS 137, pp. 63–77. ZfM: 482. 68023
Despeyroux-Savonitto J., 1982 a.Une sémantique formelle du p-code basée sur les types abstraits algébriques. INRIA, Report no. 158.
Despeyroux-Savonitto J., 1982 b. Une sémantique algébrique de pascal et application a la spécification d’un compilateur pascal - p-code.
Univ. Paris Sud, thèse de 3éme cycle.
Donahue J.E., 1977. On the Semantics of ‘Data Type’. Cornell Univ., DCS, TR-77-311 + SIAM J. Computing, vol. 8, no. 4, pp. 546–560. ZfM:418.68010 - MR:82f.68015 - CMP:12.20.1333 - CA:24. 01. 23
Dosch W., Mascari G.F., Wirsing M., 1982. On the Algebraic Specification of Data Bases. Univ. Roma, Ist. d. Automatica, Report no. 82-11 + Proc. 8th Conf. on VLDB, Mexico.
Dosch W., Wirsing M., Ausiello G., Mascari G.F., 1980. Polynomials - The Specification, Analysis and Development of an Abstract Data Type. Proc. 10. Jahrestagung der Gl, IFB 33, pp. 306–320.
Dungan D.M., Fleck A.C., 1982. Structural Equivalence of Types in a System with Type Union. Report.
Dungan D.M., 1979. Bibliography on Data Types. Sigplan Notices, vol. 14, no. 11, pp. 31–59.
Dungan D.M., 1980. Variations on Data Type Equivalence.Univ. of Iowa, DCS, Ph.D. Dissertation, TR 80–03.
Ehrich H.-D., Lipeck U., 1980. Proving Implementations Correct - Two Alternative Approaches. Proc. 8th IFIP’80, pp. 83–89, North Holland. ZfM:444.68015 - CA:25. 02. 364
Ehrich H.-D., Lipeck U., 1981. Algebraic Domain Equations. Univ. Dortmund, Abt. Informatik, Bericht Nr. 125/81 + TCS.
Ehrich H.-D., LOHBERGER V.G., 1978 a. Algebraic Specification of Databases and Concurrent Access Synchronization. Univ. Dortmund, Abt. Informatik, Bericht Nr. 58/78.
Ehrich H.-D., LOHBERGER V.G., 1978 b. Constructing Specifications of Abstract Data Types by Replacements. Proc. Workshop on ‘Graph Grammars and their Application to Computer Science and Biology’, LNCS 73, pp. 180–191. ZfM:402.68012 - MR:81d.68030 - CMP:12. 15. 967
Ehrich H.-D., Lohberger V.G., 1979. Parametric Specification of Abstract Data Types, Parameter Substitution and Graph Replacements. Proc. Workshop ‘Graphentheoretische Konzepte in der Informatik’, pp. 169–182, Carl Hanser Verlag. ZfM:403.68017 - MR:81b.68017 - CMP:12. 14. 879
Ehrich H.-D., 1976. Outline of an Algebraic Theory of Structured Objects. Proc. 3rd ICALP’76, pp. 508–530, Edinburgh Univ. Press.
Ehrich H.-D., 1977. Algebraic Semantics of Type Definitions and Structured Variables. Univ. Dortmund, Abt. Informatik, Bericht Nr. 44/77 + Proc. FCT’77, LNCS 56, pp. 84–97.
Ehrich H.-D., 1978 a. Extensions and Implementations of Abstract Data Type Specifications. Univ. Dortmund, Inst. f. Informatik, Bericht Nr. 55/78 + Proc. 7th MFCS’78, LNCS 64, pp. 155–164. ZfM:382.68028 - MR: 80i. 68013
Ehrich H.-D., 1978 b. Algebraische Spezifikation von Datenstrukturen. Univ. Dortmund, Abt. Informatik + Proc. 3rd Fachtagung ‘Graphentheoretische Konzepte in der Informatik’, pp. 47–61. ZfM: 382. 68027
Ehrich H.-D., 1978 c. Abstract Data Types: Specification, Implementation and Parametrization. Univ. Dortmund, Abt. Informatik. ZfM: 467. 68017
Ehrich H.-D., 1979. On the Theory of Specification, Implementation and Parametrization of Abstract Data Types. Univ. Dortmund, Abt. Informatik, Forschungsbericht Nr. 82 + JACM, vol. 29, no. 1, pp. 206–227 + short version in LNCS 85, pp. 155–164. ZfM:478.68020 - CMP:14.21.1558 - CA:26. 03. 655
Ehrich H.-D., 1980 a. Zur Theorie abstrakter Datentypen. Wissenschaftliche Zeitung der TU Dresden, vol. 29, no. 2, pp. 334–346. ZfM:437.68012 - CMP:12.21. 1405
Ehrich H.-D., 1980 b. AI gebras as Solutions of Domain Equations. Univ. Dortmund, Abt. Informatik, Bericht Nr. 114, pp. 21–26.
Ehrich H.-D., 1981 a. Two Papers on Algebraic Data Type Implementation and Specification. Univ. Dortmund, Abt. Informatik, Bericht Nr. 109.
Ehrich H.-D., 1981 b. On Realization and Implementation. Univ. Dortmund, Abt. Informatik, Bericht Nr. 109/1 + Proc. 10th MFCS’81, LNCS 118, pp. 271–280. ZfM:465.68005 - CMP: 14. 16. 1142
Ehrich H.-D., 1981 c. Specifying Algebraic Data Types by Domain Equations. Proc. FCT’81, LNCS 117, pp. 120–129. ZfM:465.68004 - CMP: 14. 16. 1142
Ehrich H.-D., 1981 d. Implicit Specification by Algebraic Domain Equations. EATCS Bulletin no. 14, pp. 45–51.
Ehrig H., Fey W., Kreowski H.-J., 1980 a. Some Examples of Algebraic Specifications and Implementations: Part I. TU Berlin, FB Informatik, Bericht Nr. 80–31.
Ehrig H., Fey W., Kreowski H.-J., 1980 b. Algebraische Spezifikation eines Stück!istensystems - Eine Fall Studie. Proc. 2nd German Chapter of the ACM ‘Software Engineering - Entwurf und Spezifikation’.
Ehrig H., Fey W., 1981. Methodology for the Specification of Software Systems: From Formal Requirements to Algebraic Design Specifications. Proc. 11. Jahrestagung der 61, IFB 50, pp. 255–269. ZfM: 479. 68018
Ehrig H., Kreowski H.-J., Mahr B., Padawitz P., 1980 a. Compound Algebraic Implementations: An Approach to Stepwise Refinement of Software Systems. TU Berlin, FB Informatik, Bericht Nr. 80-04 + Proc. 9th MFCS, LNCS 88, pp. 231–245. ZfM:442!68016 - CMP:13. 09. 673
Ehrig H., Kreowski H.-J., Mahr B., Padawitz P., 1980 b. Algebraic Implementation of Abstract Data Types. TU Berlin, FB Informatik, Bericht Nr. 80-32 + TCS, vol. 20, no. 3, pp. 209–263. ZfM: 483. 68018
Ehrig H., Kreowski H.-J., Padawitz P., 1977 a. Stepwise Specification and Implementation of Abstract Data Types. TU Berlin, FB Informatik, Bericht + Proc. 5th ICALP, LNCS 62, pp. 205–226. ZfM:383.68026 - MR: 80d. 68026
Ehrig H., Kreowski H.-J., Padawitz P., 1977 b. Some Remarks Concerning Correct Specification and Implementation of Abstract Data Types. TU Berlin, FB Informatik, Bericht Nr. 77–13.
Ehrig H., Kreowski H.-J., Padawitz P., 1977 c. Spezifikation, Korrektheit und Implementierung von Abstrakten Datenstrukturen. TU Berlin, FB Informatik, Skriptum zur Lehrveranstaltung ’Theorie von Datenstrukturen1.
Ehrig H., Kreowski H.-J., Padawitz P., 1979 a. Algebraische Implementierung Abstrakter Datentypen. TU Berlin, FB Informatik, Bericht Nr. 79–03.
Ehrig H., Kreowski H.-J., Padawitz P., 1979 b. Algebraic Implementation of Abstract Data Types: An Announcement. Sigact News, vol. 11, no. 2, pp. 25–29. ZfM: 418. 68018
Ehrig H., Kreowski H.-J., Padawitz P., 1979 c. Algebraic Implementation of Abstract Data Types: Concept, Syntax, Semantics and Correctness. TU Berlin, FB Informatik, Bericht Nr. 79-23 + short version in: Proc. ICALP180, LNCS 85, pp. 142–156. ZfM:412.68018/457.68019 - MR:81j.68029 - CMP:13. 03. 197
Ehrig H., Kreowski H.-J., PADAWÏTZ P., 1979 d. Completeness in Algebraic Specifications. TU Berlin, FB Informatik, Bericht + EATCS Bulletin No. 11, pp. 2–9.
Ehrig H., Kreowski H.-J., Padawitz P., 1980. A Case Study of Abstract Implementations and their Correctness. Proc. 4th Int. Symp. on Programming, LNCS 83, pp. 108–122. ZfM:435.68023 - MR:81m.68016 - CMP:13. 06. 429
Ehrig H., Kreowski H.-J., Padawitz P., 1981. Algebraic Implementation of Abstract Data Types. TCS, vol. 20, no. 3, pp. 209–263. CA: 26. 10. 2919
Ehrig H., Kreowski H.-J., Thatcher J.W., Wagner E.G., Wright J.B., 1979. Parameterized Data Types in Algebraic Specification Languages. Proc. 7th ICALP, LNCS 85, pp. 157–168. MR:81j.68029 - CMP:13. 06. 429
Ehrig H., Kreowski H.-J., Thatcher J.W., Wagner E.G., Wright J.B., 1980. Parameter Passing in Algebraic Specification Languages. Proc. Workshop ’Program Specification’, Aarhus, Denmark, LNCS 134, pp. 322–369 + TCS.
Ehrig H., Kreowski H.-J., Weber H., 1978. Algebraic Specification Schemes for Data Base Systems. TU Berlin, Hahn-Meitner-Institut Berlin, Bericht Nr. HMI-B266 + Proc. 4th Conf. on VLDB. ZfM: 388. 68014
Ehrig H., Kreowski H.-J., Weber H., 1979 a. New Aspects of Algebraic Specification Schemes for Data Base Systems. TU Berlin, FB Informatik, Interner Bericht.
Ehrig H., Kreowski H.-J., Weber H., 1979 b. Neue Aspekte algebraischer Spezifikationsschemata für Datenbanksysteme. Proc. Workshop ’Formale Modelle für Informationssysteme’, IFB 21, pp. 181–198.
Ehrig H., Kreowski H.-J., 1980. Kategorien und Funktoren. TU Berlin, FB Informatik, Vorlesungsskriptum.
Ehrig H., Kreowski H.-J., 1981. Example: KWIC-Index Generation. Proc. Workshop ’Program Specification’, LNCS 134, pp. 78–83.
Ehrig H., Kreowski H.-J., 1982. Parameter Passing Commutes with Implementation of Parameterized Data Types. Proc. 9th ICALP’82, LNCS 140, pp. 197–211.
Ehrig H., Mähr B., 1980 a. Complexity of Implementations on the Level of Algebraic Specifications. Proc. ACM Symp. ’Theory of Computing’, pp. 281–293. CMP:13. 08. 588
Ehrig H., Mahr B., 1980 b. Solvability and Complexity of Algebraic Implementation Problems. TU Berlin, FB Informatik, Bericht Nr. 80–09.
Ehrig H., Mahr B., 1981. Complexity of Algebraic Implementations for Abstract Data Types. TU Berlin, FB Informatik, Bericht Nr. 80–33 + JCSS, vol. 23, pp. 223–253. ZfM:474.68021 - CA:26. 02. 319
Ehrig H., Thatcher J.W., Lucas P., Zilles S.N., 1982. Denotational and Initial Algebra Semantics of the Algebraic Specification Language LOOK. IBM Report.
Ehrig H., Wagner E.G., Thatcher J.W., 1982. Algebraic Constraints for Specifications and Canonical Form Results. Univ. Berlin, FB Informatik, Bericht Nr. TU82-09.
Ehrig H., 1981. Algebraic Theory of Parameterized Specifications with Requirements. Proc. 6th CAAP’81, LNCS 112, pp. 1–24. ZfM:465.68006 - MR:82h.68020 - CMP: 13. 23. 1830
Eigenmeier H., Knabe Ch., Raulefs P., Tramer K., 1979 a. Automatic Implementation of Algebraic Specifications of Abstract Data Types. Univ. Bonn, Inst. f. Informatik, MEMO SEKI-BN-79-11.
Eigenmeier H., Knabe Ch., Raulefs P., Tramer K., 1979 b. ADTCOMP - Manual. Univ. Bonn, Inst. f. Informatik, MEMO SEKI-BN-79-13.
Eigenmeier H., Knabe Ch., Raulefs P., Tramer K., 1980. An Expert System for Automatic Coding of Abstract Data Type Specifications. Proc. Jahrestagung Gl’80.
Elliott W.D., Thompson D.H., 1978. EUCLID and MODULA. Sigplan Notices, vol. 13, no. 3.
Engels G., Pletat U., Ehrich H.-D., 1981. Handling Errors and Exceptions in the Algebraic Specification of Data Types. Univ. Osnabrück, Osnabrücker Schriften zur Mathematik, Reihe Informatik, Heft 3.
Engels G., Pletät U., 1980. Analyse von Regel Schemata für Unterbaum-Ersetzungssysteme. Univ. Dortmund, Inst. f. Informatik, Diplomarbeit.
Erickson R.W., 1982. Complete AFFIRM Bibliography. Software Research Associates, Technical Note.
Ernst G.W., Ogden W.F., 1980. Specification of Abstract Data Types in MODULA. ACM T0PLAS\ vol. 2, no. 4, pp. 522–543. ZfM: 468. 68020
Fasel J.H., 1980. Programming Languages as Abstract Data Types: Definition and Implementation. Univ. Perdue, Ph.D. Thesis.
Feldman J.A., Williams G.J., 1978. Some Remarks on Data Types. Univ. of Rochester, DCS, TR-28.
Feldman M.B., 1980. Data Abstraction, Structured Programming, and the Practicing Programmer. Software Practice Experience, vol. 11, no. 7, pp. 697–710.
Fey W., Kortekamp F., Kreowski H.-J., 1980. Korrektheitsbeweise: Eine Verbindung zwischen Anforderungsdefinition und Schnittstellenspezifikation. TU Berlin, FB Informatik, Bericht.
Fey W., 198x. Syntax, Semantik und Korrektheit eines Algebraischen Spezifikationsschemas für ein Stück!isten-Datenbanksystem. TU Berlin, FB Informatik, Dissertation.
Fey W., 1982. Some Examples of Algebraic Specifications, Parameterizations and Implementations, Part 4 (Param. Spec, of Strings, Binary Trees and 2x2 Matrices with Corr. Proofs.). TU Berlin, FB Informatik, Bericht Nr. 82 - 02.
Finance J.-P., 1978. De la spécification abstraite d’une donnée a sa représentation en mémoire: les états successifs d’une information. Univ. of Nancy, CRIN, Report no. 78-P-022 + Proc. AFCET, pp. 423–433.
Fischer H.L., Raulefs P., 1979. Design Rationale for the Interactive Programming Language CSSA for Asynchronous Multiprocessor Systems. Univ. Bonn, Inst. f. Informatik, MEMO SEKI-BN-79-09.
Fleck A.C., 1978. Recent Developments in the Theory of Data Structures. Computer Languages, vol. 3, pp. 37–52, pergamon press.
Fleck A.C., 1979. Verifying Abstract Data Types with SNOBOL 4. Software Practice Experience, vol. 12, pp. 627–640. ZfM: 484. 68015
Flon L., Haberman A.N., 1976. Towards the Construction of Verifiable Software Systems. Proc. ’Data: Abstraction, Definition and Structure1, Sigplan Notices, vol. II, 76 Special Issue and Sigmod FDT, vol. 8, no. 2.
Flon L., Misra J., 1979. A Unified Approach to the Specification and Verification of Abstract Data Types. USC, DCS, TR 79-2 + Proc. IEEE Conf. ’Specification of Reliable Software’, Cambridge, MA, pp. 162–169.
Flon L., 1974. A Survey of Some Issues Concerning Abstract Data Types. CMU, DCS, TR + Review in Sigplan Notices, vol. 10, no. 7, p. 8.
Flon L., 1975. Program Design with Abstract Data Types. CMU, DCS, TR + Review in Sigplan Notices, vol. 11, no. 2, p. 14.
Foster J., Foster P., 1977. Abstract Data and Functors. Sigplan Notices, vol. 12, no. 6, pp. 161–167 + Proc. ’ALGOL 68 Conference’, Strathclyde.
Francez N., Katz S., 1980. Distributed Implementation and Verification of Abstract Data Types. IBM Israel Scientific Center, TR no. 79.
Francez N., Rodeh M., 1980. A Distributed Abstract Data Type Implemented by a Probabilistic Communication Scheme. IBM Israel Scientific Center, TR no. 80 + Proc. 21st Symp. FCS.
Furtado A.L., Maibaum T.S.E., Veloso P.A.S., 1981. Especi ficacoes Abstratos (de Bancos de Dados) Via Niveis de Traco. RBC, Rio de Janeiro, vol. 1, no. 3, pp. 179–193.
Furtado A.L., Maibaum T.S.E., 1982. An Informal Approach to Formal Specifications. PUC, Depto. de Informatica.
Furtado A.L., Veloso P.A.S., 1981. Procedural Specifications and Implementations for Abstract Data Types. Sigplan Notices, vol. 16, no. 3, pp. 53–62.
Futatsugi K., et al, 1982 a. HISP Manual, planned
Futatsugi K., et al, 1982 b. A Fully Parameterized and Modularized Semantics of a Programming Language in HISP. planned
Futatsugi K., Okada K., 1980. Specification Writing as Construction of Hierarchically Structured Clusters of Operators. Proc. IFIP’80, pp. 287–292, North Holland. ZfM:443.68012 - CA:25. 02. 468
Futatsugi K., Okada K., 1981. Structuring Mechanisms in HISP. IECE, TR AL81-60 (in Japanese).
Futatsugi K., Okada K., 1982. A Hierarchical Structuring Method for Functional Software Systems. Proc. 6th Int. Conf. ’Software Engineering’, pp. 313–402, Tokyo, IEEE Computer Society Press.
Futatsugi K., 1980. Algebraic Programming. JIPDEC, Research Report on 5th Generation Computer Systems, no. 4, pp. 53–68 (in Japanese).
Futatsugi K., 1982. Hierarchical Software Development in HISP. Kitagawa (ed.). Kitagawa (ed.): ’Computer Science & Technologies 1982’ (Japan Annual Reviews in Electronics, Computers & Telecommunications), pp. 151–174, North-Holland. CA:26.05. 1417
Gamm M., Schneider R., 1980. Korrektheitsbeweis von Implementierungen Abstrakter Datentypen. Univ. Dortmund, Abt. Informatik, Diplomarbeit.
Gannon J.D., Mcmullin P.R., Hamlet R.G., Ardis M., 1980. Testing Traversable Stacks. Sigplan Notices, vol. 15, no. 1, pp. 58–65.
Gannon J.D., Mcmullin P.R., Hamlet R.G., 1981. Data Abstraction Implementation, Specification and Testing. ACM TOPLAS, vol. 3, no. 3, pp. 211–223.
Gannon J.D., Rosenberg J., 1978. Data Abstraction Facilities in SIMPL-D. Proc. ACM/NBS 17th Annual Techn. Symp., pp. 55–63.
Gannon J.D., Rosenberg J., 1979. Implementing Data Abstraction Features in a Stack-Based Language. Software Practice Experience, vol. 9, pp. 547–560. ZfM: 402. 68014
Gannon J.D., 1976. Data Types and Programming Reliability: Some Preliminary Evidence. Proc. MRI Symp. ’Computer Software Engineering’, vol. 24, pp. 367–376.
Gannon J.D., 1977. An Expérimental Evaluation of Data Type Conventions. CACM, vol. 20, no. 8, pp. 584–595.
Ganzinger H., 1980 a. Parameterized Specifications: Parameter Passing and Implementation. UC Berkeley, EECS, Internal Report.
Ganzinger H., 1980 b. A Final Algebra Semantics for Parameterized Specifications. UC Berkeley, EECS, Report.
Ganzinger H., 1980 c. Parameterized Data Types: Parameter Passing and Implementation with Respect to Observability. ACM TOPLAS.
Ganzinger H., 1981 a. Parametric Specifications: Parameter Passing and Optimizing Implementation. TU Munchen, Bericht TUM-18110 + TOPLAS.
Ganzinger H., 1981 b. Programs as Transformations of Algebraic Theories. Proc. 11. Jahrestagung der Gl, IFB 50, pp. 32–41.
Ganzinger H., 1982. Denotational Semantics for Languages with Modules. Proc. IFIP Working Conf. ’Formal Description of Programming Concepts II’’, North Holland.
Gaudel M.C., Deschamp P., Mazaud M., 1978. Semantics of Procedures as an Algebraic Abstract Data Type. IRIA, Report no. 334.
Gaudel M.C., Deschamp P., Mazaud M., 1980. Compilers Construction from High Level Specifications. Proc. Int. Workshop ‘Program Construction’, Bonas, France.
Gaudel M.C., Pair C., 1979. Construction de compilateurs basee sur une semantique formelle. Journées Francophones sur la certification du logiciel, Genève.
Gaudel M.C., Terrine G., 1978. Synthèse de la représentation d’un type abstrait par des types concrets. Proc. AFCET, ‘Theories et techniques de l’informatique, homme et technique’, Paris, pp. 434–445.
Gaudel M.C., 1978. Spécifications incomplètes mais suffisantes de la représentation des types abstraits. IRIA, Report no. 320.
Gaudel M.C., 1979. Algebraic Specification of Abstract Data Types. IRIA, Internal Report no. 360.
Gaudel M.C., 1980 a. Specification of Compilers as Abstract Data Type Representations. Proc. Workshop ‘Semantics-Directed Compilers’, Aarhus, LNCS 94.
Gaudel M.C., 1980 b. On the Concepts of State and State Modification in Programming Languages. Proc. IFIP WG 2.2, Copenhagen.
Gehani N., 1975. Data Types for Very High Level Programming Languages. Cornell Univ., DCS, Ph.D. Dissertation.
Gehani N., 1977. More About Abstract Data Types. State Univ. of New York, TR 133.
Gehani N., 1980. Specifications: Formal and Informal - A Case Study. Software Practice Experience, vol. 12, pp. 433–444.
Gerhart S.L., Musser D.R., Thompson D.H., Baker D.A., Bates R.L., Erickson R.W., London R.L., Taylor D.G., Wile D.S., 1980. An Overview of AFFIRM: A Specification and Verification System. Proc. IFIP’80, pp. 343–347. CA:25.02.464 Fundamental Concepts of Program Verification. USC, ISI, AFFIRM-Memo-15-SLG.
Gerhart S.L., 1982. Formal Validation of a Simple Database Application. Proc. 16th Hawaii Int. Conf. on System Sciences, Honolulu, 1983.
Gerstmann H., Ollongren A., 1979. Abstract Objects as Abstract Data Types. Proc. ‘Copenhagen Winterschool on the Abstract Specification of Software’, LNCS 86, pp. 439–450. ZfM: 451. 68020
Geschke C.M., Morris J.H. jr., Satterthwaite E.H., 1975. Early Experience with MESA. CACM, vol. 20, no. 8, pp. 540–553 + Proc. IEEE Int. Conf. ‘Reliable Software’, pp. 138–152.
Giarratana V., Gimona F., Montanari U., 1976. Observability Concepts in Abstract Data Type Specifications. Proc. 5th MFCS, LNCS 45, pp. 576–586.
Giloi W.K., Gueth R., 1982. Concepts and Realization of a High-Performance Data Type Architecture. Int. J. Comput. Inf. Sci., vol. 11, pp. 25–54. ZfM: 478. 68002
Giloi W.K., 1981. Abstract Data Type Based Programming Style and Computer Graphics. Proc. Eurographics’81, pp. 3–11, North Holland. CA: 26. 06. 1712
Gladney H.M., 1982 a. CONCISE Language Reference Manual, Version 1. IBM San Jose, RJ 3408.
Gladney H.M., 1982 b. An Introduction to the CONCISE Programming Language. IBM San Jose, RJ 3455.
Gladney H.M., 1982 c. Towards Modular Programs - A CONCISE Overview. IBM San Jose, RJ 3477.
Gogolla M., Drosten K., Lipeck U., Ehrich H.-D., 1982. Algebraic and Operational Semantics of Specifications Allowing Exceptions and Errors. Univ. Dortmund, Abt. Informatik, Bericht Nr. 140.
Gogollä M., Drosten K., Lipeck U., Ehrich H.-D., 1983. Algebraic and Operational Semantics of Exceptions and Errors. Proc. 6. Gl Fachtagung ‘Theoretische Informatik’, LNCS.
Goguen J.A., Burstall R.M., 1978. Some Fundamental Properties of Algebraic Theories: A Tool for Semantics of Computation. Univ. Edinburgh, UCLA, TR + TCS.
Goguen J.A., Burstall R.M., 1979. Some Fundamental Algebraic Tools for the Semantics of Computation. Univ. Edinburgh/SRI, TR.
Goguen J.A., Burstall R.M., 1980. CAT, A System for the Structured Elaboration of Correct Programs from Structured Specifications. SRI, TR CSL-118.
Goguen J.A., Burstall R.M., 1982. Institutions: Abstract Model Theory for Program Specification. SRI, Report.
Goguen J.A., Meseguer J., Plaisted D., 1982. Programming with Parameterized Abstract Objects in OBJ. SRI, Report.
Goguen J.A., Meseguer J., 1981. OBJ-1, A Study in Executable Algebraic Formal Specification. SRI, AD-A104468/4, 66 p. CA:26. 03. 659
Goguen J.A., Meseguer J., 1982 a. Completeness of Many-Sorted Equational Logic. SRI, TR CSL-135 + Sigplan Notices, vol. 16, no. 7, pp. 17–23.
Goguen J.A., Meseguer J., 1982 b. Universal Realization, Persistent Interconnection and Implementation of Abstract Modules. Proc. 9th ICALP’82, LNCS 140, pp. 265–281.
Goguen J.A., Meseguer J., 1982 c. An Initiality Primer. SRI, Report.
Goguen J.A., Meseguer J., 198x. Rapid Prototyping in the OBJ Executable Specification Language. SRI, Report.
Goguen J.A., Nourani C.F., 1978. Son Algebraic Techniques for Proving Correctness of Data Type Implementations. UCLA, DCS, Report.
Goguen J.A., Parsaye-Ghomi K., 1981. Algebraic Denotational Semantics Using Parameterized Abstract Modules. SRI, TR CSL-119 + Proc. ‘Formalization of Programming Concepts’, LNCS 107, pp. 292–309. ZfM: 467. 68014
Goguen J.A., Tardo J.J., Williamson N., Zamfir M., 1978. A Practical Method for Testing Algebraic Specifications. UCLA, DCS, Semantics and Theory of Computation Report + UCLA Computer Science Quarterly, vol. 7, no. 1, pp. 59–80.
Goguen J.A., Tardo J.J., 1977. OBJ-O, Preliminary Users Manual. UCLA, DCS, Semantics and Theory of Computation Report no. 10.
Goguen J.A., Tardo J.J., 1978. An Introduction to OBJ: A Language for Writing and Testing Formal Algebraic Program Specifications. UCLA, DCS, TR + Proc. Conf. ‘Specification of Reliable Software’, pp. 170–189.
Goguen J.A., Thatcher J.W., Wagner E.G., Wright J.B., 1973. A Junction Between Computer Science and Category Theory I: Basic Concepts and Examples (Part 1). IBM Yorktown, RC 4526.
Goguen J.A., Thatcher J.W., Wagner E.G., Wright J.B., 1975 a. An Introduction to Categories, Algebraic Theories and Algebras. IBM Yorktown, RC 5369.
Goguen J.A., Thatcher J.W., Wagner E.G., Wright J.B., 1975 b. Abstract Data Types as Initial Algebras and the Correctness of Data Representations. Proc. Conf. ‘Computer Graphics, Pattern Recognition and Data Structure’, pp. 89–93.
Goguen J.A., Thatcher J.W., Wagner E.G., Wright J.B., 1975 c. Initial Algebra Semantics and Continuous Algebras. IBM Yorktown, RC 5701 + JACM, vol. 24, no. 1, pp. 68–95. MR:58#25071
Goguen J.A., Thatcher J.W., Wagner E.G., Wright J.B., 1976. A Junction Between Computer Science and Category Theory I: Basic Concepts and Examples (Part 2). IBM Yorktown, RC 5908.
Goguen J.A., Thatcher J.W., Wagner E.G., 1976. An Initial Algebra Approach to the Specification, Correctness and Implementation of Abstract Data Types. IBM Yorktown, RC 6487 + Yeh (ed.): ‘Current Trends in Programming Methodology, Vol. 4: Data Structuring’, pp. 80–149.
Goguen J.A., Thatcher J.W., 1974. Initial Algebra Semantics. IBM Yorktown, RC 4865 + Proc. 15th IEEE Symp. ‘Switch, and Aut. Theory’, pp. 63–77.
Goguen J.A., 1975. Correctness and Equivalence of Data Types. Proc. Conf. ‘Algebraic Systems’, Lecture Notes in Econ. and Math. Systems, vol. 131, pp. 352–358. ZfM: 387. 68013
Goguen J.A., 1977 a. Abstract Errors for Abstract Data Types. UCLA, DCS, Semantics and Theory of Computation Report no. 6 + Proc. IFIP Conf. ‘Formal Description of Programming Concepts’, pp. 491–525. ZfM: 373. 68024
Goguen J.A., 1977 b. Algebraic Specification. UCLA, DCS, Semantics and Theory-of Computation Report no. 9 + Wegner (ed.): ‘Research Directions in Software Technology’, pp. 370–376, MIT Press.
Goguen J.A., 1978 a. Some Design Principles and Theory for OBJ-O, A Language to Express and Execute Algebraic Specifications of Programs. UCLA, DCS, TR + Proc. Conf. ‘Mathematical Studies of Information Processing’, LNCS 75, pp. 425–473. ZfM: 456. 68011
Goguen J.A., 1978 b. Order Sorted Algebras: Exceptions and Error Sorts, Coercions and Overloaded Operators. UCLA, DCS, Semantics and Theory of Computation Report no. 14 + JCSS.
Goguen J.A., 1978 c. Some Ideas in Algebraic Semantics. Proc. 4th IBM Symp. MFCS, Kobe, Japan.
Goguen J.A., 1979. Evaluating Expressions and Proving Inductive Hypothesis about Equationally Defined Data Types and Programs. UCLA, DCS, Semantics and Theory of Computation Report no. 16.
Goguen J.A., 1980 a. How to Prove Algebraic Inductive Hypotheses without Induction: With Applications to the Correctness of Data Type Implementations. Proc. 5th Conf. ‘Automated Deduction’, LNCS 87, pp. 356–373.
Goguen J.A., 1980 b. On Proving Inductive Hypotheses without Induction with Applications to the Correctness of Data Type Implementations. Proc. 5th Workshop ‘Automated Deduction’, Les Arcs, France.
Goguen J.A., 1980 c. Thoughts on Specification, Design, and Verification. Sigsoft SEN, vol. 5, no. 3, pp. 29–33.
Goguen J.A., 1981 a. Research in Specification Languages. Working Notes.
Goguen J.A., 1981 b. ORDINARY Specification of Some Construction in Plane Geometry. Proc. Workshop ‘Program Specification’, LNCS’134, pp. 31–46.
Goguen J.A., 1981 c. ORDINARY Specification of KWIC-Index Generation. Proc. Workshop ‘Program Specification’, LNCS 134, pp. 114–117.
Goguen J.A., 1981 d. Two ORDINARY Specifications. SRI, TR CSL-128. ZfM: 477. 68024
Goguen J.A., 198x. Proving Inductive Hypotheses without Induction and Evaluating Expressions with Non-Terminating Rules. SRI, Report.
Good D.I., Cohen R.M., Hunter L.W., 1978. A Report on the Development of GYPSY. Proc. ACM Ann. Conf. 1978, pp. 116–122.
Goodwin J.W., 1981. Why Programming Environments Need Dynamic Data Types. IEEE-SE, vol. SE-7, no. 5, pp. 451–457. CA:25. 11. 3203
Gotlieb C.C., Gotlieb L.R., 1978. Data Types and Structures. Prentice Hall, Inc., Englewood Cliffs, New Yersey: XII, 444p, ISBN-0-13-197095-X. ZfM:411.68019 - MR: 81j. 68001
Gotlieb C-C., 1974. Data Types and Structures. Univ. of Toronto, DCS, TR 61.
Greiter G., 1981. On Data Types and their Specification Problem — Part 2: A Specification Method. Softlab GmbH, Bericht.
Greiter G., 1982 a. A Data Type Theory. Sigplan Notices, vol. 17, no. 5, pp. 47–53.
Greiter G., 1982 b. Nochmals: Was ist ein abstrakter Datentyp ?. Angewandte Informatik, vol. 3, p. 204, Leserbrief.
Gries D., Gehani N., 1977. Some Ideas on Data Types in High-Level Languages. CACM, vol. 20, no. 6, pp. 414–420 + Abstract in Sigplan Notices, vol. 8, no. 2, p. 120.
Gries D., 1978. Programming Methodology - A Collection of Articles by Members of IFIP WG 2.3. Springer Verlag, Texts and Monographs in Computer Science, ISBN 0-387-90329-1.
Grigas G., Kupchyunas G., 1977. Some Data Abstraction Possibilities in PL/I (Subset DOS/ES). Avtom. Processov Planirovanja Upr. 5, pp. 139–146, (Russian with English summary). ZfM:397.68027 - CMP:13. 08. 587
Grigas G., Kupchyunas G., 1980. Abstract Data Types. Programmirovanie EhVM no. 3, pp. 9–47 (Russian with English summary). ZfM:469.68029 - MR: 81k. 68015
Gueth R., 1980. Eine Rechnerarchitektur zur Unterstützung abstrakter Datentypen. ACM German Chapter Reports, vol. 6: ‘Hardware für Software’, Teubner Verlag, pp. 170–187.
Guiho G., Boisson F., Pavot D., 1982. Multitargets Operators Algebras. Univ. Paris-Sud, LRI, Research Report.
Guntram U., 1980. Korrekte Implementierung abstrakter Datentypen durch Moduln in höheren Programmi ersprachen. Univ. Bonn, Inst. f. Informatik, MEMO SEKI-BN-80-09.
Guttag J.V., Horning J.J., Williams G.J., 1981. FP with Data Abstraction and Strong Typing. Proc. Conf. ‘Functional Programming Languages and Computer Architecture’, pp. 11 - 24.
Guttag J.V., Horning J.J., Wing J.M., 1982. On Putting Formal Specifications to Productive Use. Xerox PARC, TR CSL-82-3 + Science of Computer Programming, vol. 2, no. 1.
Guttag J.V., Horning J.J., 1978. The Algebraic Specification of Abstract Data Types. Acta Informatica, vol. 10, pp. 27–52 + Gries (ed.): ‘Programming Methodology’, pp. 282–308. ZfM:369.68010/379.68020/395.68020
Guttag J.V., Horning J.J., 1980. Formal Specification as a Design Tool. Xerox PARC, Report CSL-80-1 + Proc. 7th POPL, pp. 251–261.
Guttag J.V., Horowitz E., Musser D.R., 1976 a. The Design of Data Type Specifications. USC, ISI, Report RR-76-49 + Yeh (ed.): ‘Current Trends in Programming Methodology, Vol. 4: Data Structuring’, pp. 60–79 + 2nd Int. ACM/IEEE Conf. ‘Software Engi neering’.
Guttag J.V., Horowitz E., Musser D.R., 1976 b. Abstract Data Types and Software Validation. USC, ISI, TR RR-76-68 + CACM, vol. 21, no. 12, pp. 1048-1064 + Abstract in Sigplan Notices, vol. 12, no. 4, p. 17. ZfM:387.68012 - MR:80b.68030 - CA: 23. 06. 1550
Guttag J.V., Horowitz E., Musser D.R., 1977. Some Extensions to Algebraic Specifications. Proc. ACM Conf. ‘Language Design for Reliable Software’, Sigplan Notices, vol. 12, no. 3, pp. 63–67.
Guttag J.V., Kapur D., Musser D.R., 1981. On Proving Uniform Termination and Restricted Termination of Rewriting Systems. GEC Research and Development Schenectady, Report no. 81CRD272 + SIAM Journal of Computing, vol. 12, no. 1.
Guttag J.V., Kapur D., Musser D.R., 1982. Derived Pairs, Overlap Closures, and Rewrite Dominoes: New Tools for Analyzing Term Rewriting Systems. Proc. 9th ICALP’82, LNCS 140, pp. 300–312.
Guttag J.V., Staunstrup J., 198x. Algebraic Axioms, Classes, and P Guttag J.V., 1974. The Use of Type for the Definition of Abstract Data Objects. Univ. of Toronto, DCS.
Guttag J.V., 1975. The Specification and Application to Programming of Abstract Data Types. Univ. of Toronto, DCS, Ph.D. Thesis, TR CSRG-59.
Guttag J.V., 1976. Abstract Data Types and the Development of Data Structures. CACM, vol. 20, no. 6, pp. 396–404 + Proc. Conf. ‘Data Abstraction, Definition,and Structure’, Sigplan Notices, vol. 8, no. 2, p. 62 (abstract only).
Guttag J.V., 1978. Notes on Data Abstraction. Proc. Int. Summer School on Program Construction, LNCS 69, pp. 593–616. ZfM: 399. 68031
Guttag J.V., 1980. Notes on Type Abstraction (Version 2). IEEE-SE, vol. SE-6, no. 1, pp. 13–23. CA: 24. 05. 1296
Guttag J.V., 1981. A Few Remarks on Putting Formal Specifications to Productive Use. Proc. Workshop ‘Program Specification’, LNCS 134, pp. 370–380.
Hagino T., Koga A., Nakajima R., Shibayama E., Yuasa T., Honda M., 1982. IOTA on DECSystem 20 - KWIC Example. Kyoto Univ., RIMS Preprint no. 419.
Hammer M.M., 1976. Data Abstractions for Data Bases. Proc. Conf. ‘Data Abstraction, Definition and Structure’, Sigplan Notices, vol. 8, no. 2, pp. 58–59.
Harm D., 1977 a. An Abstract Specification of Programming Language. UCLA, DCS, Semantics and Theory of Computation Report no. 11.
Harm D., 1977 b. SCHEMER: An Initial Implementation. UCLA, DCS, Aritfical Intelligence Memo no. 8.
Harrison M.A., Lipton R.J., 1979. Implementation of Abstract Data Types. UC Berkeley, DCS. Program Verification. Unpublished Manuscript.
Hasler K.-P., Löwe M., Reisin M., 1981. Spezifikation und Korrektheit eines universieilen Interpreters für algebraische Spezifikationen. TU Berlin, FB Informatik, Diplomarbeit.
Hayes P.J., Hendrix G.G., 1980. A Logical View of Types. Proc. Workshop ‘Data Abstraction, Databases and Conceptual Modelling’, ACM Special Issue, pp. 128–130.
Herlihy M., Liskov B., 1980. A Value Transmission Method for Abstract Data Types. MIT, Computation Structures Group Memo 200-1. CA:26. 12. 3665
Herzog H., 198x. Bedingungen für die Konsistenz von ORS-Spezifikationen. Univ. Karlsruhe, Inst. f. Informatik, Diplomarbeit.
Higashino T., Kudo T., Sugiyama Y., Nawata S., 1982. A Verification Support System for Algebraic Specifications. IECE Japan, Paper of Technical Group no. AL82-27 (in Japanese).
Higashino T., MORI M., Sugiyama Y., Taniguchi K., Kasami T., 1980. Algebraic Specification of HDLC and its Verification. IECE Japan, Paper of Technical Group no. AL80-7 (in Japanese).
Higashino T., MORI M., Sugiyama Y., Taniguchi K., Kasami T., 1982. An Algebraic Specification of HDLC Procedures and its Verification, subm. to IEEE-SE.
Higashino T., Nawata S., Mori M., Taniguchi K., Kasami T., 1981. A Framework for Verifying HDLC Procedures. IECE Japan, Paper of Technical Group no. AL81-71 (in Japanese).
Hilfinger P.N., Feldman G., Fitzgerald R., Kimura I., London R.L., Prasad K.V.S., Prasad V.R., Rosenberg J., Shaw M., Wulf W.A., 1978. An Informal Definition of ALPHARD. CMU, DCS, Report CMU-CS-78-105 + Shaw (ed.): ‘ALPHARD: Form and Content’, pp. 195–252.
Hilfinger P.N., 1978. Letter to the editor. Sigplan Notices, vol. 13, no. 1, pp. 11–12.
Hilfinger P.N., 1983. Abstraction Mechanisms and Language Design. MIT, Ph.D. Thesis, MIT Press.
Hoare C.A.R., 1972. Proof of Correctness of Data Representation. Acta Informatica 1, pp. 271–281 + Gries (ed.): ‘Programming Methodology’, pp. 269–281. ZfM:395.68019
Hoare C.A.R., 1975. Recursive Data Structures. Stanford Univ., Artificial Intelligence Laboratory, Report STAN-CS-73-400 + Int. Journal of Computer and Information Sciences, vol. 4, no. 2, pp. 105–132.
Hoffmann C.M., O’Donnel M.J., 1979. An Interpreter Generator Using Tree Pattern Matching. Proc. 6th POPL’79, pp. 169–179.
Hoffmann C.M., O’Donnel M.J., 1982. Programming with Equations. ACM TOPLAS, vol. 4, no. 1, pp. 83–112. ZfM: 481. 68008
Hohlfeld B., 1982. Implementierung und Verifikation eines abstrakten Datentyps. AEG-Telefunken, Germany, Working Notice.
Honda M., Nakahara H., Nakajima R., 1977. Rigorous Proof of a Program with User-Defined Abstract Types - A Case Study. RIMS (superseded by Hagino/etal 82 ).
Hookway R.J., 1980. Verification of Abstract Types whose Representations Share Storage. CWRU, Institute of Technology, Report no. CES-80-2.
Horning J.J., 1976. Some Desirable Properties of Data Abstraction Facilities. Proc. Conf. ‘Data: Abstraction, Definition and Structure’, Sigplan Notices, vol. 8, no. 2, (special issue), pp. 60–62.
Hornung G., Raulefs P., 1980. Terminal Algebra Semantics and Retractions for Abstract Data Types. Univ. Bonn, Inst. f. Informatik, MEMO SEKI-BN-79-06 + Proc. 7th ICALP, LNCS 85, pp. 310–323. ZfM:446.68010 - MR:81j.68033 - CMP:13. 03. 197
Hornung G., Raulefs P., 1981 a. Initial and Terminal Algebra Semantics of Parameterized Abstract Data Type Specifications with Inequalities. Proc. 6th CAAP’81, LNCS 112, pp. 224–237. ZfM:472.68010 - MR:82j.68011 - CMP: 13. 23. 1830
Hornung G., Raulefs P., 1981 b. A Uniform Algebra Semantics of Parameterized Data Type Specifications with Inequalities. Univ. Bonn, Inst. f. Informatik, MEMO SEKI-BN-81-01.
Hornung G., 1979. Einige Probleme der AIgebraSemantik abstrakter Datentypen. Univ. Bonn, Inst. f. Informatik, MEMO SEKI-BN-79-07.
Horowitz E., Sahni S., 1976. Fundamentals of Data Structures., Academic Press Woodland Hills, California. ZfM: 408. 68003
Huet G., Hullot Ü.M., 1980. Proofs by Induction in Equational Theories with Constructors. INRIA, Research Report no$128 + Proc. 21st FOCS, pp. 96 - 107.
Huet G., Oppen D.C., 1980. Equations and Rewrite Rules: A Survey. Stanford Univ., DCS, Research Report STAN-CS-80-785 + Book (ed.): ’Formal Languages: Perspectives and Open Problems’, Academic Press.
Huet G., 1978. Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems. JACM, vol. 27, no. 4, pp. 797 - 821.
Huet G., 1981. A Complete Proof of Correctness of the Knuth-Bendix Algorithm. JCSS, vol. 23, no. 1, pp. 11 - 21.
Hullot Ü.M., 1980. Compilation de formes canoniques dans des theories equationnelles. Univ. Paris-Sud, thèse de 3eme cycle.
Hupbach U.L., REICHEL H., 1983. On Behavioural Equivalence of Data Types. EIK.
Hupbach U.L., 1979. A Uniform Mathematical Framework for Initial Algebraic Specifications. VEB Robotron, Zentrum für Forschung u. Technik.
Hupbach U.L., 1980 a. Abstract Implementation of Abstract Data Types. Proc. 9th MFCS, LNCS 88, pp. 291-304. ZfM:467.68008 - CMP:13. 09. 674
Hupbach U.L., 1980 b. Abstract Implementation and Parameter Substitution. VEB Robotron, Zentrum für Forschung und Technik, Bericht + Proc. 3rd Hungarian Computer Science Conf. Budapest.
Hupbach U.L., 1981. Modelling Data Bases by Abstract Data Types. Proc. 4th Int. Datenbank Seminar, Schwerin.
Ingargiola G.P., 1974. Hierarchies and Relations Among Data Types. Proc. ACM Annual Conf., pp. 622 - 634.
Ingargiola G.P., 1975. Implementations of Abstract Data Types. Proc. Conf. ‘Computer Graphics, Pattern Recognition and Data Structure’, pp. 108 – 113.
Inoue K., Seki H., Sugiyama Y., Kasami T., 1982. Code Optimization at Compilation of Functional Programming Language ASL-F Programs. IECE Japan, Paper of Technical Group no. EC82-18 (in Japanese).
Isner J.F., 1982. A Fortran Programming Methodology Based on Data Abstraction. CACM, vol. 25, no. 10, pp. 686-697. CA:26. 12. 3656
Jacquet P., 1978. La généricité comme outil d’abstraction dans les langages de programmation. Congres AFCET, panorama de 1’informatique (hommes et techniques).
Jacquet P., 1979. Abstraction et généricité en LPG. Bulletin GROPLAN no. 8 (AFCET Informatique).
Jacquet P., 1980. Les types génériques - Proposition pour un mécanisme d’abstraction dans les langages de programmation. USM Grenoble, thèse de 3eme cycle.
Jeanrond H.-J., 1979. A Unique Termination Theorem for a Theory with Generalised Commutative Axioms. Proc. 6th ICALP, LNCS 71, pp. 316-330. CMP: 12. 20. 1333
Jeanrond H.-J., 1980. Deciding Unique Termination of Permutati ve Rewriting Systems: Choose your Term Algebra Carefully. Proc. 5th Conf. ’Automated Deduction’, LNCS 87, pp. 335-343. ZfM:438.68004 - CMP:13. 02. 125
Johnson R.T., Morris J.B., 1976. Abstract Data Types in the MODEL Programming Language. Proc. Conf. ’Data: Abstraction, Definition and Structure’, Sigplan Notices, vol. 8, no. 2, (Special Issue), pp. 36 – 46.
Jones A.K., Liskov B.H., 1976. A Language Extension for Controlling Access to Shared Data. IEEE-SE, vol. SE-2, no. 12, pp. 277 - 285.
Jones A.K., Liskov B.H., 1978. A Language Extension for Expressing Constraints on Data Access. CACM, vol. 21, no. 5, pp. 358 - 367.
Jones C.B., 1979. Constructing a Theory of a Data Structure as an Aid to Program Development. Acta Informatica, vol. 11, pp. 119 - 137.
Jones D.W., 1978. A Note on Some Limits of the Algebraic Specification Method. Sigplan Notices, vol. 13, no. 4, pp. 64 - 67.
Joseph M., Moitra A., 1981. Algebraic Specification of Communicating Processes. NCSDCT, TR no. 66.
Kamin S.N., 1979. Some Definitions for Algebraic Data Type Specifications. Sigplan Notices vol. 14, no. 3, pp. 28 - 37.
Kamin S.N., 1980 a. Final Data Type Specifications: A New Data Type Specification Method. Proc. 7th POPL, pp. 131-138.
Kamin S.N., 1980 b. Final Data Types and their Specification. INRIA, Research Report no. 47 + ACM TOPLAS.
Kanda A., 1977. Data Types as Effective Objects. Univ. of Warwick, Theory of Computation Report no. 22.
Kanda A., 1978. Data Types as Initial Algebras: A Unification of Scottery and ADJery. Proc. 19th IEEE Symp. FOCS’78, pp. 221 - 230.
Kaphengst H., REICHEL H., 1977. Initial Algebra Semantics for Non-Contextfree Languages. Proc. ’Foundations of Computation Theory’, LNCS 56, pp. 120 - 126.
Kaphengst H., 1980. Was ist berechenbar für abstrakte Datentypen?. VEB Robotron Zentrum für Forschung u. Technik, TR.
Kaphengst H., 1981. What is Computable for Abstract Data Types?. Proc. FCT, LNCS 117, pp. 173-181. ZfM:475.68004 - CMP: 14. 16. 1143
Kaplan S., 1981. Puissance relatives de certaines classes de spécification de types abstraits algébrique. Univ. Paris-Sud, Internai Report.
Kaplan S., 1982. Spécification de types abstraits: Puissance de différentes classes d’axiomes a congruence semi-decidable. Proc. AFCET Coll. ’Les mathématiques de l’informatique’, pp. 337 – 346.
Kapur D., Musser D.R., Stepanov A.A., 1981. Operators and Algebraic Structures. General Electric, Automation and Control Laboratory, Report no. 81CRD114 + Proc. Conf. ’Functional Programming Languages and Computer Architecture’, pp. 59 – 63.
Kapur D., SRIVAS M.K., 1979. Expressivness of the Operation Set of a Data Abstraction. MIT, Computation Structures Group Memo no$1179-1 + Proc. 7th POPL, pp. 139 – 153.
Kapur D., 1975. Proving Correctness of Implementation of a Data Abstraction Using the Algebraic Method. MIT, Unpublished Handout, Course 6.891 ’Specification Technique’.
Kapur D., 1979. Specifications of Majster’s Traversable Stack and Veloso’s Traversable Stack. MIT, LCS + Sigplan Notices, vol. 14, no. 5, pp. 46 - 53.
Kapur D., 1980. Towards a Theory for Abstract Data Types. MIT, LCS, TR 237.
Kasami T., Taniguchi K., Sugiyama Y., Hagihara K., Suzuki I., Okui J., 1978. On Algebraic Techniques for Program Specification. IECE Japan, Paper of Technical Group no. AL78-46 (in Japanese).
Kaufman T.M., 1977. TED: A Text Editor Specified in OBJ. UCLA, DCS, M.S. Comprehensive Exam.
Kieburtz R.B., Silberschatz A., 1983. Access Right Expressions. ACM TOPLAS, vol. 5, no. 1, pp. 78 - 96.
Kieburtz R.B., 1983. Precise Typing of Abstract Data Type Specifications. Proc. 10th POPL’83, pp. 109 - 116.
Kimm R., et al., 1979. Einführung in Software Engineering. De Gruyter, Berlin.
Kimura I., Yonezawa A., 1982. Representation of Algorithms. Iwanami Shoten Tokyo (in Japanese).
King P.R., 1977. Towards the Specifications and Synthesis of Abstract Data Types. Univ. Manitoba, DCS, Report no. 85.
King P.R., 1978. On the Specification and Design of Abstract Data Types. Proc. IFIP Working Conf. ’Constructing Quality Software’, pp. 449-468, North Holland.
Klaeren H.A., Petzsch H., 1980. The Development of an Interpreter by Means of Abstract Algebraic Software Specifications. RWTH Aachen, Schriften zur Angewandten Mathematik und Informatik 65 + Proc. ’Formalization of Programming Concepts’, LNCS 107, pp. 335–346. ZfM:463. 68026 /473. 68013
Klaeren H.A., Petzsch H., 1981. Algebraic Software Specification and Compiler Generation - A Case Study. RWTH Aachen, Schriften zur Angew. Math, und Informatik 68.
Klaeren.H.A., Schulz M., 1981. Computable Algebras, Word Problems and Canonical Term Algebras. Proc. 5th GI Conf., LNCS 104, pp. 203 - 213.
Klaeren H.A., 1978. Datenräume mit algebraischer Struktur. RWTH Aachen, Schriften zur Angewandten Mathematik und Informatik 43.
Klaeren H.A., 1980 a. Eine Klasse von Algebren mit struktureller Rekursion und ihre Anwendung bei der abstrakten Software-Spezifikation. RWTH Aachen, Dissertation. ZfM: 476. 68021
Klaeren H.A., 1980 b. A Simple Class of Algorithmic Specifications for Abstract Software Modules. RWTH Aachen, Schriften zur Angewandten Mathematik und Informatik 58 + Proc. 9th MFCS, LNCS 88, pp. 362-374. ZfM:451.68021/461.68024 - CMP:13. 09. 674
Klaeren H.A., 1980 c. An Abstract Software Specification Technique based on Structural Recursion. RWTH Aachen, Interner Bericht + Sigplan Notices, vol. 15, no. 3, pp. 28 - 34.
Klaeren H.A., 1980 d. Bibliography on Algebraic Software Specification. EATCS Bulletin no. 12, pp. 76 – 87.
Klaeren H.A., 1981. The SRDL Specification Experiment. Proc. Workshop ’Program Specification’, LNCS 134, pp. 282 – 293.
Klaeren H.A., 1982 a. Bibliography on Algebraic Software Specification. RWTH Aachen, Inst. f. Informatik, Working Paper.
Klaeren H.A., 1982 b. On Parameterized Abstract Software Modules Using Inductively Specified Operations. Proc. Coll. AFCET ’Les mathématiques et l’informatique’, pp. 289 - 300.
Klaeren H.A., 1982 c. A Constructive Method for Abstract Algebraic Software Specification. RWTH Aachen, Schriften zur Angewandten Mathematik und Informatik 78 + TCS.
Klaeren H.A., 1982 d. Einführung in die abstrakte Software-Spezifikation. RWTH Aachen, Schriften zur Angewandten Mathematik und Informatik 75.
Klaeren H.A., 1983. Algebraische Spezifikation - Eine Einführung. Springer Lehrbuchreihe Informatik.
Knuth D.E., Bendix P.B. s 1970. Simple Word Problems in Universal Algebras. Leech (ed.): ’Computational Problems in Abstract Algebra’, pp. 263–297, Pergamon Press.
Koch W., 1979. SPEZI - Eine Sprache zur Formulierung von Spezifikationen. TU Berlin, FB Informatik, Bericht Nr. 79-22 + Proc. 9. Jahrestagung der Gl, IFB 19, pp. 132 – 138.
Kortekamp F., 1979. Syntax, Semantik und Korrektheit eines Algebraischen Spezifikations-Schemas 1Ai rport-Schedule’. TU Berlin, FB Informatik, Bericht.
Koster C.H.A., 1976. Visibility and Types. Proc. Conf. ’Data: Abstraction, Definition and Structure’, Sigplan Notices, vol. 8, no. 2, (special issue), pp. 179 – 190.
Kozma L., 1982. Proving the Correctness of Implementations of Shared Data Abstractions. Proc. 5th Coll. on Programming, LNCS 137, pp. 227–241. ZfM: 482. 68018
Kraus T., Wiegand J., 1980. Entwurf und Implementierung einer Spezifikationssprache. für abstrakte Datentypen. Univ. Dortmund, Abt. Informatik, Diplomarbeit.
Kreowski H.-J., 1978. Algebra für Informatiker. TU Berlin, FB Informatik, Vorlesungsskriptum.
Kreowski H.-J., 1979. Notes on the Power of Equational Specification: An Example. TU Berlin, FB Informatik.
Kreowski H.-J., 1980. Algebraische Spezifikation von Software-Systemen. Proc. 2nd German Chapter of the ACM ’Software Engineering — Entwurf und Spezifikation’, Teubner-Verlag.
Kreowski H.-J., 1981. Ein Teil vom Ganzen - Ein Sammelsurium über partielle Spezifikation. TU Berlin, FB Informatik, Unveröffentlichte Notizen.
Kutzler B., Lichtenberger F., 1983. Annotated Bibliography on Abstract Data Types (First Draft). Univ. Linz, Inst. f. Mathematik, Bericht CAMP-Publ.-Nr. 82 - 9. 0
Lampson B.W., Horning J.J., London R.L., Mitchell J.G., POPEK G.J., 1977. Report on the Programming Language EUCLID. Sigplan Notices, vol. 12, no. 2.
Lampson B.W., Horning J.J., London R.L., Mitchell J.G., POPEK G.J., 1978. Revised Report on the Programming Language EUCLID. Xerox PARC, TR CSL78-2.
Landwehr C.E., 1980. An Abstract Type for Statistics Collection in SIMULA. Naval Research Laboatory, Report no. 8373 + ACM TOPLAS, vol. 2, no. 4, pp. 544-563. CA:24. 11. 3176
Larsen K.G., 1982. Specification of Datatypes. Univ. Aalborg, Report IR 82 - 6.
Laut A., Möller B., 1979. Mutual Development of the Abstract Data Type Tree and the Function Preorder. TU München, Interner Bericht TUM-INF0-06-79-00-150/1-FBMA.
Laut A., Partsch H., 1982. Tuning Algebraic Specifications by Type Merging. Proc. Int. Symp. on Programming, LNCS 137, pp. 283–304. ZfM: 482. 68019
Laut A., 1980. Safe Procedural Implementations of Algebraic Types. I PL, vol. 11, no. 4,5, pp. 147-151. CA: 25. 05. 1282
Laut A., 1981. b Developing Algebraic Specifications of Threaded Data Structure Implementations. Goos (ed.): ’Werkzeuge der Programmiertechnik’, IFB 43, p. 28 - 40.
Lauterbach C.H., et al, 1975. Abstract Data Types in MADCAP-VI. UCLA, DCS.
Lauterbach C.H., STAA A., 1976. On the Tree Organization of Abstract Types. PUC, Monographs in Computer Science and Computer Applications 5 /76.
Laventhal M.S., 1978. Synthesis of Synchronization Code for Data Abstraction. MIT, LCS, TR-203, Ph.D. Thesis.
Laventhal M.S., 1979. Synchronization Specifications for Data Abstractions. Proc. Conf. ‘Specification of Reliable Software’, IEEE Comp. Society.
Leavenworth B.M., 1979. The Use of Data Abstraction in Program Design. IBM Yorktown, RC 7637.
Leavenworth B.M., 1981 a. Database Views Using Data Abstraction. IBM Yorktown, RC 8722.
Leavenworth B.M., 1981 b. Database Programming with Data Abstractions. IBM Yorktown.
Leavenworth B.M., 1982. ADAPT: A Tool for the Design of Reusable Software. IBM Yorktown, RC 9728.
Ledgard H.F., Taylor R.W., 1977. Two Views of Data Abstraction. CACM, vol. 20, no. 6, pp. 382 – 384.
Lehmann D.J., Smyth M.B., 1977. Data Types. Univ. of Warwick, DCS, Theory of Computation Report no$119 + Proc. 18th IEEE FOCS, pp. 7 – 12.
Lehmann D.J., Smyth M.B., 1978. Algebraic Specification of Data Types: A Synthetic Approach. Univ. of Leeds, DCS, Report no. 115 + Math. Systems Theory, vol. 14, no. 2, pp. 97 – 139. MR:82j.68013 - CMP:13.19. 1525
Lehmann D.J., 1978. On the Algebra of Order. JCSS, vol. 21, no. 1 + Extended Abstract in Proc. 19th Ann. IEEE Symp. FOCS, pp. 214 – 220.
Lescanne P.J 1979. Etude algebrique et relationnelle des types abstraits et de leurs représentations. Univ. of Nancy, CRIN, thèse de doctorat, rapport CRIN-79-T-059.
Lescanne P., 1982. Quelques propriétés de Tordre de decomposition - un ordre de simplification pour prouver la termination des systèmes de reecriture. Proc. Coll. ÄFCET ’Les mathématiques de l‘informatique’, pp. 301 – 312.
Leszak M., 1978. Erstellung, Untersuchung und Verwendung von Typkonzepten. Univ. Karlsruhe, Inst. f. Informatik, Diplomarbeit.
Leszczylowski J., Wirsing M., 1982. A System for Reasoning within and about Algebraic Specifications. Proc. 5th Int. Symp. on Programming, LNCS 137, pp. 257 - 282.
Levy M.R., Maibaum T.S.E., 1982. Continuous Data Types. Siam Journal of Computing, vol. 11, no. 2, pp. 201 – 216. ZfM:479.68016 - CA:26.07. 1945
Levy M.R., Maibaum T.S.E., 198x. Continuous Data Types with Sharing and Circularity. Univ. of Waterloo, DCS, TR.
Levy M.R., 1977. Some Remarks on Abstract Data Types. Sigplan Notices vol. 12, no. 7, pp. 126 – 128.
Levy M.R., 1978. Data Types with Sharing and Circularity. Univ. of Waterloo, Ph.D. Dissertation, TR CS-78-26.
Levy M.R., 1982. Programming Languages and the Programming Process. Univ. of Victoria, DCS, TR DCS-18-IR + Proc. C0MPSAL’82.
Levy M.R., 198x. On the Correctness of Abstract Data Type Implementations, in prep.
Lewis C.H., Rosen B.K., 1973. Recursively Defined Data Types - Part 1. IBM, RC 4429 + Proc. POPL’73, pp. 125 - 138.
Lichtenberger F., 1981. PL/ADT - Ein System zur Verwendung algebraisch spezifizierter abstrakter Datentypen in PL/I. Dissertationen der Johannes Kepler Univ. Linz, Nr. 30, Verlag Verband der wissenschaftlichen Gesellschaften Österreichs.
Liedtke R.P., 1981. Eignung verschiedener Spezifikationsmethoden für die Definition von Datenmodell en. Univ. Karlsruhe, Inst. f. Informatik, Diplomarbeit.
Linden N.M., Berry D.M., 198x. Parameterization and Abstract Data Types in a Program Design Language: The Design of Software Development Processor. UCLA, DCS, Report.
Linden T.A., 1976. The Use of Abstract Data Types to Simplify Program Modifications. Proc. Conf. ’Data: Abstraction, Definition and Structure’, Sigplan Notices, vol. 8, no. 2, (Special Issue), pp. 12 - 23.
Linden T.A., 1978. Specifying Abstract Data Types by Restriction. Sigsoft SEN, vol. 3, no. 2, pp. 7 - 13.
Lings B.J., Salzman E.J., 1981. An Exercise in Language Design for Secure Programming. Proc. 4th Australian Computer Science Conf.: ’Australian Computer Science Communications’, vol. 3, no. 1, pp. 106 - 116.
Lings B.J., Salzman E.J., 1982. A Generalized Model for Data Abstraction. Univ. of Exeter, DCS, TR.
Lipeck U., 1979. Zum Begriff der Implementierung in der Theorie der abstrakten Datentypen. Univ. Dortmund, Abt. Informatik, Diplomarbeit.
Lipeck U., 1980. Literatur zu: Theorie und Anwendung abstrakter Datentypen. Univ. Dortmund, Abt. Informatik, Working paper.
Lipeck U,, 1982. Ein algebraischer Kalkül für einen strukturierten Entwurf von Datenabstrakt i onen. Univ. Dortmund, Abt. Informatik, Dissertation.
Liskov B.H., Atkinson R.R., Bloom T., Moss J.E.B., Schaffert J.C., Scheifler R., Snyder A., 1979. CLU Reference Manual. MIT, LCS, TR 255 + LNCS 114, 190 p. ZfM:463.68009 - CA: 24. 04. 1029
Liskov B.H., Berzins V.A., 1977. An Appraisal of Program Specifications. MIT, LCS, Computation Structures Group Memo no. 141-1 + Wegner (ed.): ’New Directions in Software Technology’, pp. 276-301, MIT Press.
Liskov B.H., Moss J.E.B., Schaffert J.C., Scheifler R.W., Snyder A., 1978. CLU Reference Manual. MIT, LCS, Computation Structures Group Memo no. 161.
Liskov B.H., Snyder A., Atkinson R.R., Schaffert J.C., 1977. Abstraction Mechanisms in CLU. MIT, LCS, Computation Structures Group Memo no. 144-1 + CACM, vol. 20, no. 8, pp. 564 - 576.
Liskov B.H., Snyder A., 1977. Structured Exception Handling. MIT, LCS, Computation Structures Group Memo no. 155.
Liskov B.H., Snyder A., 1979. Exception Handling in CLU. MIT, LCS, Computation Structures Group Memo no. 155-2 + IEEE-SE, vol. SE-5, no. 6, pp. 546 - 558.
Liskov B.H., Zilles S.N., 1974. Programming with Abstract Data Types. Proc. ACM Sigplan Symp. ’Very High Level Languages’, Sigplan Notices, vol. 9, no. 4, pp. 50 - 59.
Liskov B.H., Zilles S.N., 1975. Specification Techniques for Data Abstractions. IEEE-SE, vol. SE-1, no. 1, pp. 7-19 + Proc. Int. Conf. ’Reliable Software’.
Liskov B.H., Zilles S.N., 1977. An Introduction to Formal Specification of Data Abstraction. Yeh (ed.): ’Current Trends in Programming Methodology, Vol. 1, Software Specification and Design’, pp. 1-32.
Liskov B.H., 1974. A Note on CLU. MIT, LCS, Computation Structures Group Memo no. 112 - 1.
Liskov B.H., 1975. Data Types and Program Correctness. Sigplan Notices, vol. 10, no. 7, pp. 16-17 + Proc. AFIPS, pp. 285 - 286.
Liskov B.H., 1976. An Introduction to CLU. MIT, LCS, Computation Structures Group Memo no. 136.
Liskov B.H., 1979. Modular Program Construction Using Abstractions. MIT, LCS, Computation Structures Group Memo no. 184 + Proc. ’Copenhagen Winter School on Abstract Software Specification’, LNCS 86, pp. 355 - 389.
Liskov B.H., 1980 a. Techniques for Using Data Abstractions in Languages that Don’t Support them. MIT, LCS, Report.
Liskov B.H., 1980 b. Implementing and Using Data Abstractions in Multics PL/I. MIT, LCS, Report.
Lockemann P.C., Mayr H.C., Dittrich K.R., 1979. A Pragmatic Approach to Algebraic Specification of Software Modules. Univ. Karlsruhe, Inst. f. Informatik, Bericht Nr. 1 /79.
Lockemann P.C., Mayr H.C., Weil W.H., Wohlleber W.H., 1979. Data Abstractions for Database Systems. ACM TODS, vol. 4, no. 1, pp. 60 - 75. CA:23.05. 1294
Lockemann P.C., Wohlleber W.H., 1979. Constraints and Transactions: Extensions to the Algebraic Specification Method. Univ. Karlsruhe, Inst. f. Informatik, Interner Bericht Nr. 5 /79.
Loeckx J., 1980 a. Algorithmic Specifications of Abstract Data Types. Univ. Saarbrücken, FB 10, Bericht A 80/12 + Proc. 8th ICALP’81, LNCS 115, pp. 129-147. CMP:14. 05. 278
Loeckx J., 1980 b. Proving Properties of Algorithmic Specifications of Abstract Data Types in AFFIRM. USC, ISI, AFFIRM Memo 29-JL.
Loeckx J., 1980 c. Some Properties of Implementations of Abstract Data Types. Univ. Saarbrücken, FB 10, Interner Bericht A 80/14.
Loeckx J., 1980 d. Implementations of Abstract Data Types and their Correctness Proofs. Univ. Saarbrücken, FB 10, Bericht A 80/13.
Loeckx J., 1981 a. Implementations of Abstract Data Types and their Verification. Proc. 11. Jahrestagung der GI, IFB 50, pp. 96-108. ZfM:476.68022 - CMP: 14. 19. 1394
Loeckx J., 1981 b. Using Abstract Data Types for the Definition of Programming Languages and the Verification of their Compilers. Univ. Saarbrücken, FB 10, Bericht A 81/13.
Loeckx J., 1981 c. Algorithmic Specifications: A New Specification Method for Abstract Data Types. Univ. Saarbrücken, FB 10, Bericht A 81/14.
London R.L., Guttag J.V., Horning J.J., Lampson B.W., Mitchell J.G., Popek G.J., 1978. Proof Rules for the Programming Language EUCLID. Acta Informatica, vol. 10, pp. 1–26.
London R.L., Shaw M., Wulf W.A., 1976. Abstraction and Verification in ALPHARD: A Symbol Table Example. USC, ISI, TR RR-76–51 + Hibbard/Schumann (eds.): ‘Constructing Quality Software’, pp. 319–351, North Holland + Shaw (ed.): ‘ALPHARD: Form and Content’, pp. 161–190 + Abstract in Sigplan Notices, vol. 12, no. 8, p. 18.
Loos R., 1980. Algorithmen und Datenstrukturen. Teil I: Abstrakte Datentypen. Univ. Karlsruhe, Inst. f. Informatik, Vorlesungsskriptum.
Low J.R., 1978. Automatic Data Structure Selection: An Example and Overview. CACM, vol. 21, no. 5, pp. 376–385.
Löwe M., Reisin M., Hasler K.-P., 1982. Algebraic Specification of a User-Controlled Interpreter for Algebraic Specifications. TU Berlin, FB Informatik, Bericht.
Lucena C.J.P., Pequeno T.H.C., 1977. A View of the Program Derivation Process Based on Incompletely Defined Data Types: A Case Study. PUC, Depto. de Informatica, TR no. 5.
Lucena C.J.P., Pequeno T.H.C., 1979. Program Derivation Using Data Types: A Case Study. IEEE-SE, vol. SE-5, pp. 586–592. ZfM:428.68023 - CA:24. 03. 769
Lucena C.J.P., Schwabe D., Berry D.M., 1975. Issues in Data Type Construction Facilities. PUC, Depto. de Informatica, TR no. 475.
Luft Ä.L., Steinbauer D., 1980. Vom Konzept zur abstrakten Spezifikation: Bemerkungen zur Bedeutung konstruktiver abstrakter Datentypen. Proc. German Chapter of ACM: Workshop ‘Entwurf und Spezifikation’, Berlin.
Luft A.L., Wedekind H., 1982. A Pragmatic Approach to the Theory of Abstract Data Types and Related Specification Methods. Univ. Erlangen/Nürnberg, Inst. f. Informatik.
Luft A.L., 1980. Anwendungsbezogene Spezifikationen und Abstraktionen beim Software Engineering. Mitteilungsblatt der Gl-Fachgruppe ‘Methoden und Modelle für die Entwicklung von Informationssysteme’, Nr. 5, pp. 4–29.
Luft A.L., 1981. Rationaler Sprachgebrauch und orthosprachliche Standardisierung als Grundlagen zuverlässiger Software-Entwicklung und Dokumentation. Univ. Erlangen/Nürnberg, Arbeitsberichte des Instituts für Mathem. Maschinen und Datenverarbeitung, vol. 14, no. 7.
Luft Ä.L., 1982 a. Zur Bedeutung formaler Spezifikationsmethoden beim Software Engineering. Angewandte Informatik, vol. 4, pp. 215–224. CA: 26. 10. 2299
Luft Ä.L., 1982 b. Rationaler Sprachgebrauch und orthosprachliche Standardisierung als Grundlagen des Software-Engineering. Informatik Spektrum, vol. 5, no. 4.
Macqueen D.B., Sannellä D.T., 198x. Completeness of Proof Systems for Equational Specifications, in prep.
Madelaine E., Senesi S., 1980. Etude de l’utilisation de LCF et PROLOG pour prtiuver la representation de types abstraits. INRIA, ecole polytechnique, rapport de stage.
Madelaine E., 1982. Le systeme PERLUETTE et les preuves de représentation de types abstraits. INRIA, rapport de recherche no. 133.
Mahr B., Makowski J.A., 1982 a. Characterizing Specification Languages which Admit Initial Semantics. Haifa, Technion, TR no. 232 + TCS.
Mahr B., Makowski J.A., 1982 b. An Axiomatic Approach to Semantics of Specification Languages. Proc. 6. Gl Fachtagung ‘Theoretische Informatik’, 1983, LNCS.
Mahr B., 1980. Complexity of Algebraic Implementations for Abstract Data Types: A Summary. Proc. 3rd Workshop ‘Meeting Categorical and Algebraic Methodologies in Computer Science and Systems Theory’.
Mahr B., 1981. Some Examples of Algebraic Specifications and Implementations, Part 2 ( Specification of Arithmetic, Equality and Ordering on Numbers). TU Berlin, FB Informatik, Bericht Nr. 81–1.
Maibaum T.S.E., Lucena C.J.P., 1977. Higher Order Data Types. PUC, Depto. de Informatica, TR + Int. Journal of Computer & Information Science, vol. 9, no. 1, pp. 31–53. ZfM:425.68026 - MR:81d.68034 - CMP:12.21.1405 - CA:24.09. 2505
Maibaum T.S.E., Pequeno T.H.C., VELOSO P.A.S., 1982. Minimal Models, Logic and Abstract Data Types, Part I and II. Imperial College, Dept. of Computing.
Maibaum T.S.E., VELOSO P.A.S., 1981 a. A Logical Theory of Data Types Motivated by Programming. Imperial College, Dept. of Computing, TR DOC 81/28.
Maibaum T.S.E., VELOSO P.A.S., 1981 b. A Logical Approach to Data Types. Imperial College, Dept. of Computing, Research Report no. 27.
Maibaum T.S.E., 1979. Abstract Data Types and a Semantics for the ANSI/SPARC Architecture. Univ. of Waterloo, DCS, Research Report CS-02-79.
Maibaum T.S.E., 1980. Data Base Instances, Abstract Data Types and Data Base Specification. Imperial College, Dept. of Computing.
Maibaum T.S.E., 1982 a. Logical Specification. Imperial College, Dept. of Computing.
Maibaum T.S.E., 1982 b. Non-Termination, Implicit Definitions, and Abstract Data Types. Imperial College, Dept. of Computing.
Maibaum T.S.E., 1982 c. Data Bases, Data Types and Semantics. Imperial College, Dept. of Computing.
Majster M.E., 1977 a. Limits of the Algebraic Specification of Abstract Data Types. Sigplan Notices, vol. 12, no. 10, pp. 37–41.
Majster M.E., 1977 b. Extended Directed Graphs, a Formalism for Structured Data and Data Structures. Acta Informatica, vol. 8, pp. 37–59.
Majster M.E., 1978 a. Letter to the Editor. Sigplan Notices, vol. 13, no. 1, pp. 8–10.
Majster M.E., 1978 b. Letter to the Editor. Sigplan Notices, vol. 13, no. 4, pp. 22–23.
Majster M.E., 1979 a. Data Types, Abstract Data Types and their Specification Problem. TU München, Bericht TUM-INFO-7740 + TCS, vol. 8, no. 1, pp. 89–127. ZfM:393.68022 - MR:80c.68015 - CA:24. 01. 13
Majster M.E., 1979 b. Treatment of Partial Operations in Algebraic Specification Technique. Proc. ‘Specification of Reliable Software’, MIT, pp. 190–197.
Malgren W.R., 1982. Formai Spécification of Graphie Data Types. ACM TOPLAS, vol. 4, pp. 687–710. CA:26. 12. 3655
Manola F., 1977. Abstract Data Types in Data Base Models and Architecture. Computer Corp. of America.
Martin J.J., 1977. Critique of Mila E. Majster’s Paper “Limits of the Algebraic Specification of Abstract Data Types”. Sigplan Notices, vol. 12, no. 12, pp. 28–29.
Mayoh B.H., 1978. Data Types as Functions. Aarhus Univ., DCS, Report DAIMI PB-89 + Proc. 7th MFCS’78, LNCS 64, pp. 56–70. ZfM: 379. 68019
Mayr H.C., Lockemann P.C., Dittrich K.R., 1980. Operational Replacement Schemes - A Practice Oriented Approach to the Specification of Abstract Data Types. Univ. Karlsruhe, Inst. f. Informatik, Bericht Nr. 11 /80.
Mayr H.C., 1980 a. Make More of Data Types. Proc. Workshop ‘Data Abstraction, Databases and Conceptual Modelling’, ACM Special Issue, pp. 128–130.
Mayr H.C., 1980 b. Zur Spezifikation von Datentypen. Floyd/Kopetz (eds.): ‘ACM German Chapter Berichte’ 51, pp. 290–292, Teubner- Verlag.
Mayr H.C., 1982. Literatur Uber Spezifikation. Univ. Karlsruhe, Inst. f. Informatik, Working Paper.
Mcmullin P.R., Gannon J.D., Weiser M.D., 1982. Implementing a Compiler-Based Test Tool. Software Practice Experience, vol. 12, pp. 971–979.
Mcmullin P.R., Gannon J.D., 1980. Evaluating a Data Abstraction Testing System Based on Formal Specifications. Univ. of Maryland, DCS, TR 962, AD-A097231/5. CA: 25. 09. 2610
Mcmullin P.R., 1982. DAISTS - A System for Using Specifications to Test Implementations. Univ. of Maryland, Ph.D. Thesis.
Melkanoff M.A., Zamfir M., 1978. The Axiomatization of Data Base Conceptual Models by Abstract Data Types. UCLA, DCS, Report ENG-7785.
Merzenich W., 1979. A Binary Operation on Trees and an Initial Algebra Characterization for Finite Tree Types. Acta Informatica, vol. 11, pp. 149–168.
Meyer J.Ü.C., 1981. A Note on Arnold-Karpinski’s Seven Equations Bound for Data Specifications. EATCS Bulletin no. 13, pp. 42–44.
Miller J., Rus T., 1979. Abstract Data Types in Communication System Languages. Math., Rev. Anal. Numer. Theor. Approximation, Math 21(44) pp. 43–56. ZfM:421.68023 - MR:82a.68024 - CMP:13. 07. 510
Minot R., 1979. ATM: Un système de fabrication de programme base sur les concepts de modularité et de type abstrait. Univ. of Nancy, CRIN, thèse 3ème cycle, Report CRIN-79-5-031.
Mitchell J.G., Mäybury W., Sweet R., 1979. MESA Language Manual, Version 5.0. Xerox PARC, Report CSL-79–3.
Mitchell J.G., Wegbreit B., 1976. A Next Step in Data Structuring for Programming Languages. Proc. Conf. ‘Data: Abstraction, Definition and Structure’ in Sigplan Notices, vol. II 1976 Special Issue and in Sigmod FDT, vol. 8, no. 2.
Mitchell J.G., Wegbreit B., 1977. SCHEMES: A High-Level Data Structuring Concept. Xerox PARC, Report CSL-77-1 + Yeh (ed.): ‘Current Trends in Programming Methodology, Vol. 4: Data Structuring’, pp. 150-184.
Moitra A., Joseph M., 1979. Completeness and Consistency of Abstract Data Types. NCSDCT, TR no. 49.
Moitra A., Joseph M., 1980. Complexity of the Algebraic Specification of Abstract Data Types. NCSDCT, TR no. 54.
Moitra A., 1981 a. The Composition of Algebraic Specification for Abstract Data Types. NSCDCT, TR no. 62.
Moitra A., 1981 b. Algebras with Hidden Functions: Formalization and Power. Univ. of Bombay, Ph.D. Thesis.
Moitra A., 1981 c. Relation between Algebraic Specifications and Turing Machines. Proc. 1st Conf. ‘Foundations of Software Technology and Theoretical Computer Science’, Bagalore, India.
Moitra A., 1982 a. Direct Implementation of Algebraic Specification of Abstract Data Types. NCSDCT, TR no. 48 + IEEE-SE, vol. SE-8, no. 1, pp. 12-20. ZfM:469.68028 - CA:26. 03. 776
Moitra A., 198x. A Note on Algebraic Specification of Binary Trees. Sigplan Notices, vol. 15, no. 6, pp. 64–67.
Moitra A., 198y. Formalization of Algebraic Specifications with Hidden Functions. NCSDCT + JCSS.
Moor I.W., Darlington J., 1979. Formal Synthesis of an Efficient Implementation for an Abstract Data Type. Imperial College, Dept. of Computing, Internal Report.
Moore D.J., Rüssel B., 1981. Axiomatic Data Type Specifications: A First Order Theory of Linear Lists. Acta Informatica, vol. 15, no. 3, pp. 193–207. ZfM:463.68025 - MR:82j.68007 - CMP:13.24. 1903
Mori M., Higashino T., Sugiyama Y., Taniguchi K., Kasami T., 1981. An Algebraic Specification of HDLC Procedures. Trans, of IECE Japan, vol. J.4-D, no. 2, pp. 124–131. Morris J.B., 1973. Types are not Sets. Proc. POPL’73, pp. 120–124.
Morris J.B., 1979 a. Programming by Successive Refinement of Data Abstractions. Software Practice Experience, 10, pp. 249–263. ZfM: 429. 68019
Morris J.B., 1979 b. Data Abstraction: A Static Implementation Strategy. Sigplan Notices, vol. 14, no. 8.
Morris J.B., 198x. Synapsis of Data Type Abstraction in Programming Languages. Los Alamos, Scientific Lab., + Review in Sigplan Notices, vol. 12, no. 12, (era citation 02:028238).
Moss J.E.B., 1978. Abstract Data Types in Stack Based Languages. MIT, LCS, TR no. 190. + Abstract in Sigplan Notices, vol. 13, no. 9, p. 16.
Musser D.R., 1977. A Data Type Verification System Based on Rewrite Rules. USC, ISI, Report + Proc. 6th Conf. ‘Computing Systems’.
Musser D.R., 1978. Convergent Set of Rewriting Rules for Abstract Data Types. USC, ISI, Report (superseded by Musser 80b ).
Musser D.R., 1980 a. Abstract Data Type Specification in the AFFIRM System. IEEE-SE, vol SE-6, no. 1, pp. 24–32 + Proc. Conf. ‘Reliable Software’, MIT. ZfM: 431.68022 - CA: 24. 05. 1280
Musser D.R., 1980 b. On Proving Inductive Properties of Abstract Data Types. Proc. 7th POPL’80, pp. 154–162.
Nakahara H., 1977. A Logical Basis for Data Abstraction. Kyoto Univ., Master Thesis (in Japanese).
Nakahara H., 1978. Data Type Logic - A Logical Basis for Hierarchical Programming with Abstract Data Types. Proc. 3rd IBM Symp. MFCS, Academic & Scientific Programs, IBM Japan.
Nakajima R., Honda M., Nakahara H., 1977 a. Proving Abstract Specifications to be Valid for their Program Implementations. Univ. of Oslo, Inst, of Informatics, Research Report no. 20.
Nakajima R., Honda M., Nakahara H., 1977 b. Programming and Verification Scheme in the IOTA System - Integration of Verification and Data Abstraction. Kyoto Univ., RIMS, Report RIMS-218 (superseded by Nakajima/etal 80a).
Nakajima R., Honda M., Nakahara H., 1978. Describing and Verifying Programs with Abstract Data Types. Proc. IFIP ‘Formal Descriptions of Programming Concepts’, pp. 527–556, North-Holland. ZfM: 373. 68025
Nakajima R., Honda M., Nakahara H., 1980. Hierarchical Program Specification and Verification - A Many-Sorted Logical Approach. Kyoto Univ., RIMS, Report RIMS-TR-265 + Acta Informatica, vol. 14, pp. 135–155.
Nakajima R., Yuasa T., Kojima K., 1980. The IOTA Programming System - A Support System for Hierarchical and Modular Programming. Proc. IFIP’80, pp. 299–304, North-Holland.
Nakajima R., 1977. Sypes - Partial Types - for Program and Specification Structuring and a First Order System IOTA Logic. Univ. of Oslo, Inst, of Informatics, Report.
Németi I., 197x. Some Universal Algebraic arid Model Theoretic Results in Computer Science. Proc. 3rd Hungarian Computer Science Conf.
Nielsen E.R., 1981. A Survey of Literature on Modularization in Programming. Univ. of Copenhagen, Inst, of Datalogy, Report no. 82 /7.
Nolan G.J., 1980. DASIM1: A Practical Exercise in Data Abstraction. LNCS 79, pp. 143–150.
Nordstrom B., 1978 a. Assignments and High Level Data Types. Proc. 1978 ACM Annual Conf., pp. 630–638.
Nordstrom B., 1978 b. Programming with Abstract Data Types, Some Examples. Proc. 1978 ACM Annual Conf., pp. 646–654.
Nourani C.F., 1978 a. A Note on Logic Oriented Approaches to Data Abstraction. UCLA, DCS, Semantics and Theory of Computation Report no. 12 + Sigsoft SEN, vol. 3, no. 3.
Nourani C.F., 1978 b. On Data Types Specification by Stepwise Extension. UCLA, DCS, Report.
Nourani C.F., 1979 a. Constructive Extension and Implementation of Abstract Data Types and Algorithms. UCLA, Ph.D. Thesis, Report UCLA-ENG-7945.
Nourani C.F., 1979 b. Construction of Data Types Through Extensions of Equations of Equational Theories. Univ. of Michigan, Syst. Eng. Lab. Report.
Nourani C.F., 1979 c. Inductive Extensions of Equational Theories of Data Types (Working Outline). Univ. of Michigan, EECS, TR.
Nourani C.F., 1979 d. A Model-Theoretic Approach to Specification, Extension and Implementation. Proc. 4th Int. Symp. on Programming, LNCS 83, pp. 282–297. ZfM:435.68021 - CMP:13. 06. 429
Nourani C.F., 1979 e. Abstract Implementations and Their Correctness Proofs. Univ. of Pennsylvania, TR + JACM.
Nourani C.F., 1980 a. Equational Specifications and Structured Correctness Proofs of Algorithms. Univ. of Pennsylvania, DCS, TR.
Nourani C.F., 1980 b. On Induction for Programming Logic: Syntax, Semantics, and Inductive Closure. Univ. of Pennsylvania, TR + EATCS Bulletin 82–02, pp. 51–63.
Nourani C.F., 1981. Positive Forcing, Inductive Closure, and Equational Genericity. Univ. of Pennsylvania, DCS, TR.
Nourani C.F., 1982 a. Type Extension: Part I - First Order Extension and Implementation of Abstract Data Types. Univ. of Pennsylvania, DCS, TR.
Nourani C.F., 1982 b. Type Extension: Part II - Type Extension with Equational Theories and Tree Rewriting of Implementations. Univ. of Pennsylvania, DCS, TR.
Nourani C.F., 1982 c. Forcing with Universal Sentences and Genericity of Inductive Closure. Univ. of Pennsylvania, DCS, TR.
0’Donnell M.J., 1977. Computing in Systems Described by Equations. LNCS 58.
Okada K., Futatsugi K., Torii K., 1980. Reliable Program Derivation in Functional Languages by Applying Jackson’s Design Method. Proc. 10th Int. Symp. ‘Fault-Tolerant Computing’, pp. 91–96 (IEEE Catalog no. 80CH/604-8).
Okada K., Futatsugi K., Torii K., 1981. Program Transformations Based on a Hierarchical Specification Language. IECE, TR EC81-76 (in Japanese).
Okada K., Futatsugi K., Torii K., 1982. Transformational Programming in a Hierarchical Specification Language. IECE, TR AL82-XX, (in Japanese).
Okui J., Suzuki I., Sugiyama Y., Hagihara K., Taniguchi K., Kasami T., 1979. Algebraic specifications of programs and their correctness. IECE Japan, Paper of Technical Group no. AL78-79 (in Japanese).
Ollongren A., 1979. Multilevel Arrays as Datatypes. Univ. Dortmund, Abt. Informatik, Bericht Nr. 91.
Orejas F., 1979. On the Power of Conditional Specifications. Sigplan Notices, vol. 14, no. 7, pp. 78–81.
Orejas F., 1981. On the Representation of Data Types. Proc. Int. Coll. Coll. ‘Formalization of Programming Concepts’, LNCS 107, pp. 419–431. ZfM:467.68021 - MR:82h.68024 - CMP: 13. 22. 1758
Orejas F., 1982. Characterizing Composability of Abstract Implementations. Univ. of Barcelona, Report no. 82 /08.
Owicki S.S., 1977. Specifications and Proofs for Abstract Data Types in Concurrent Programms. Proc. Int. Summer School on Program Construction, LNCS 69, pp. 174–197. ZfM: 399. 68032
Padawitz P., 1979. Proving the Correctness of Implementations by Exclusive Use of Term Algebras. TU Berlin, FB Informatik, Forschungsbericht Nr. 79–8.
Padawitz P., 1980. New Results on Completeness and Consistency of Abstract Data Types. Proc. 9th MFCS, LNCS 88, pp. 460–473. ZfM: 441.68015 - CMP:13. 09. 674
Padawitz P., 1981. Some Examples of Algebraic Specifications: Part 3 (An Implementation of Histograms by Hash-Addressed Arrays and its Correctness Proof). TU Berlin, FB Informatik, Bericht Nr. 81–5.
Padawitz P., 1982. Equational Data Type Specifications and Recursive Program Schemes. Proc. IFIP TC-2 Working Conf. ‘Formal Description of Programming Concepts II’, Garmisch, Germany.
Pair C., 1980 a. Sur les modèles des types abstraits algébriques. Univ. of Nancy, CRIN, Research Report CRIN-80-P-052.
PAIR C., 1980 b. Abstract Data Types and Algebraic Semantics of Programming Languages. Univ. of Nancy, CRIN, Research Report CRN-81-R-043 + TCS, vol. 18, no. 1, pp. 1–32. CMP:14.14.988 - CA:26.05. 1268
PAIR C., 1980 c. Types abstraits et semantique algébrique des langages de programmation. Univ. of Nancy, CRIN, Report CRIN-80-R-011.
PAIR C., 1981. Application of Abstract Data Types to the Definition of the Semantics of Programming Languages. Univ. of Nancy, CRIN, Report CRIN-81-P-025 + Proc. Int. Coll. ‘Formalization of Programming Concepts’, LNCS 107.
PAOLINI P., 1979. Abstract Data Types for Database Management Systems Architecture. UCLA, DCS, Ph.D. Dissertation.
PAOLINI P., 1980. Abstract Data Types and Data Bases. Proc. Workshop ‘Data Abstraction, Databases and Conceptual Modelling’, ACM Special Issue, pp. 171–173.
PARNAS D.L., SHORE J.E., WEISS D., 1976. Abstract Types Defined as Classes of Variables. Proc. Conf. ‘Data: Abstraction, Definition and Structure’, Sigplan Notices, vol. 11, special issue, pp. 149–154.
PARNAS D.L., 1970. A Technique for the Specification of Software Modules with Examples. CACM, vol. 15, no. 5, pp. 330–336.
PARSAYE-GH0MI K., 1981. Higher Order Data Types. UCLA, DCS, Ph.D. Thesis.
PARTSCH H., BROY M., 1978. Examples for Change of Types and Object Structures. Proc. Symp. ‘Program Construction ’, LNCS 69, pp. 421–463. ZfM: 399. 68030
PARTSCH H., LAUT A., 1981. From Requirements to their Formalization - A Case Study on the Stepwise Development of Algebraic Specifications. Wössner (ed.): ‘Programmiersprachen u. Programmentwicklung’, IFB 53, pp. 117–132.
PEPPER P., BROY M., BAUER F.L., PARTSCH H., DOSCH W., WIRSING M., 198x. Abstrakte Datentypen: Die algebraische Spezifikation von Rechenstrukturen. Informatik Spektrum, vol. 5, no. 2, pp. 107–119.
PEPPER P., PARTSCH H., 1980. On the Feedback between Specifications and Implementations: An Example. TU München, Inst. f. Informatik, Bericht TUM-I8011.
PEQUENO T.H.C., LUCENA C.J.P., 1978. An Approach for Data Type Specification and its Use in Program Verification. PUC, Depto. de Informatica, TR + IPL, vol. 8, no. 2. pp. 98–103. ZfM:428.68026 - MR:80d.68023 - CA:23. 02. 493
PEQUENO T.H.C., 1981. Uno descricao formal dos processos de especificacao & implementacao de tipos abstratos de dados. PUC, Thesis.
Peter R., 1961. Ober die Verallgemeinerung der Theorie der rekursiven Funktionen für abstrakte Mengen mit geeigneter Struktur als Definitionsbereiche. Acta Math. Acad. Sci. Hung., vol$112, pp. 271–314/vol. 13, pp. 1–24.
PETZSCH H., 1981. INTAS - Ein System zur Interpretation algebraischer Spezifikationen. RWTH Aachen, Inst. f. I, Bericht Nr. 5.
PLASSER K., 1976. Axiome für Speicherfunktionen. Univ. Linz, Inst. f. Mathematik, Bericht Nr. 69.
PLETAT U., ENGELS G., EHRICH H.-D., 1981. Operational Semantics of Algebraic Specifications with Conditional Equations. Univ. Dortmund, Inst. f. Informatik, Forschungsbericht Nr. 118 /81.
PLETAT U., ENGELS G., EHRICH H.-D., 1982. An Operational Approach to Conditional Algebraic Specifications. Proc. 7th CAAP, France.
PLETAT U., 1982. Graph Grammars as an Aid for the Development of Algebraic Specifications. Univ. Stuttgart, Bericht 9 /82.
PNUELI A., (SHERMAN-)ZARHI R., 1981. Realizing an Equational Specification. Proc. 8th ICAPL’81, LNCS 115, PP. 459–478.
POHLMANN K.-H., 1977. Entwurf eines symbolischen Interpreters für abstrakte Datentypen. Univ. Dortmund, Inst. f. Informatik, Diplomarbeit.
POLAJNAR J., 1978. An Algebraic View of Protection and Extendibility in Abstract Data Types. USC, DCS, Ph.D. Thesis.
POPEK G.J., HORNING J.J., LAMPSON B.W., MITCHELL J.G., LONDON R.L., 1977. Notes on the Design of EUCLID. Proc. ACM Conf. ‘Language Design for Reliable Software’, Sigplan Notices, vol. 12, no. 3, pp. 11–18.
RAOULT J.C., 1982. Finiteness Results on Rewriting Systems. RAIRO Informatique Theorique, vol. 15, no. 4, pp. 373–391.
REICHEL H., HUPBACH U.L., KAPHENGST H., 1980. Initial Algebraic Specification of Data Types, Parameterized Data Types, and Algorithms. VEB Robotron, Zentrum für Forschung u. Technik, Bericht Nr. 15.
REICHEL H., 1978. Algebraic Specifications of Abstract Data Types. Banach Center Semester, Algebra and Applications.
REICHEL H., 1979. Theorie der Aequoide. Humboldt-Univ. Berlin, Dissertation.
REICHEL H., 1980. Initially-Restricting Algebraic Theories. Proc. 9th MFCS, LNCS 88, pp. 504–514. ZfM: 469. 68026
REICHEL H., 1981 a. Behavourial Equivalence - A Unifying Concept for Initial and Final Specification Methods. Proc. 3rd Hungarian Computer Science Conference, Springer Verlag. ZfM: 479. 68017
REICHEL H., 1981 b. Algebraische Induktion als mathematisches Hilfsmittel in der Computer Science. Mitteilungen der Mathematischen Gesellschaft der DDR, Sonderdruck Heft 2/4–81.
REMY J.L., VELOSO P.A.S., 1981 a. An Economical Method for Comparing Data Type Specifications. Sigplan Notices, vol. 16, no. 5, pp. 39–42.
REMY J.L., VELOSO P.A.S., 1981 b. Comparing Abstract Data Type Specifications via their Normal Forms. PUC, Series: Monografías en Ciencia da Computacao 1/81.
REMY J.L., 1982. Etude des systèmes de réécriture conditionnels et applications aux types abstraits algébriques. Univ. of Nancy, CRIN, thèse de doctorat.
REYNOLDS J.C., 1975. User-Defined Types and Procedural Data Structures as Complementary Approaches to Data Abstraction. Gries (ed.): ‘Programming Methodology’, pp. 309–317 + Proc. Conf. ‘New Directions in Algorithmic Languages’, pp. 157–168. ZfM:395.68021
REYNOLDS J.C., 1980. ROWE L.A., SHOENS K.A., 1979. Data Abstractions, Views and Updates in RIGEL. Proc. ACM Sigmod’79 Int. Conf. ‘Management of Data1, Boston.
ROWE L.A., 1980 a. Data Abstraction from a Programming Language Viewpoint. Proc. Workshop ‘Data Abstraction, Databases and Conceptual Modelling’, ACM Special Issue, pp. 29–35.
ROWE L.A., 1980 b. Discussion: ‘Types’. Proc. Workshop ‘Data Abstraction, Databases and Conceptual Modelling’, ACM Special Issue, pp. 43–52.
RÖMER W., 1980. Ein Experimenteller Interpreter für algebraische Spezifikationen abstrakter Datentypen. TU Berlin, FB Informatik, Diplomarbeit.
SADO K., YONEZAWA A., 1981. A Tutorial on Abstract Data Type Oriented Languages. Joho Shori, vol. 22, no. 6, pp. 525–530 (in Japanese).
SADO K., 1981. A Practical Processor of CLU and Experience with Using it. Trans, of Information Processing Society of Japan, vol. 22, no. 4, pp. 295–303 (in Japanese).
SALWICKI A., 1982. Algorithmic Theories of Data Structures. Proc. 9th ICALP’82, LNCS 140, pp. 458–472.
SANCHIS L.E., 1977. Data Types as Lattices: Retractions, Closures and Projections. RAIRO Informatique Theorique, vol. 11, no. 4, pp. 329–344.
SANDERS A.F., GELERNTER H.L., 1977. Data Metastructures. Software Practice Experience, vol. 9, pp. 795–811.
SANNELLA D.T., WIRSING M., 1982. Implementations of Parameterized Specifications. Univ. of Edinburgh, DCS, Report CST-103-82 + Proc. 9th ICALP’82, LNCS 140, pp. 473–488.
SANNELLA D.T., 1981. A New Semantics of CLEAR. Univ. of Edinburgh, DCS, Report CSR-78-81. Using Category Theory to Design Implicit Conversions and Generic Operators. Proc. Workshop ‘Semantics-Directed Compiler Generation’, Aarhus, LNCS.
RIDJANOVIC D., BRODIE M.L., 1981. Specification Versus Implementation. Univ. of Maryland, DCS + Proc. COMPCON’81, Washington.
ROBINET B.J., 1976. About the Logical Foundations of Data Types. IFIP Working Group ‘New Directions in Algorithmic Languages’, pp. 63–79. ZfM: 383. 68024
ROME E., 1981. Implementierungen abstrakter Datentypen in terminaler Algebrasemantik. Univ. Bonn, Inst. f. Informatik, MEMO SEKI-BN-81-05.
ROSEN B.K., LEWIS C.H., 1974. Recursively Defined Data Types, Part 2. IBM Yorktown, RS 4713.
ROSEN B.K., 1973. Tree Manipulating Systems and Church-Rosser Theorems. JACM, vol. 20, no. 1, pp. 160–187.
ROSS D.T., 1976. Toward Foundations for the Understanding of Type. Proc. Conf. ‘Data: Abstraction, Definition and Structure’, Sigplan Notices, vol. 8, no. 2, (Special Issue), pp. 63–65.
ROUSSOPOULOS N., 1977. ADD: Algebraic Data Definition. Proc. 6th Texas Conf. ‘Computing Systems’, Austin.
ROWE L.A., SHOENS K.A., 1979. Data Abstractions, Views and Updates in RIGEL. Proc. ACM Sigmod’79 Int. Conf. ‘Management of Data1, Boston.
ROWE L.A., 1980 a. Data Abstraction from a Programming Language Viewpoint. Proc. Workshop ‘Data Abstraction, Databases and Conceptual Modelling’, ACM Special Issue, pp. 29–35.
ROWE L.A., 1980 b. Discussion: ‘Types’. Proc. Workshop ‘Data Abstraction, Databases and Conceptual Modelling’, ACM Special Issue, pp. 43–52.
RÖMER W., 1980. Ein Experimenteller Interpreter für algebraische Spezifikationen abstrakter Datentypen. TU Berlin, FB Informatik, Diplomarbeit.
SADO K., YONEZAWA A., 1981. A Tutorial on Abstract Data Type Oriented Languages. Joho Shori, vol. 22, no. 6, pp. 525–530 (in Japanese).
SADO K., 1981. A Practical Processor of CLU and Experience with Using it. Trans, of Information Processing Society of Japan, vol. 22, no. 4, pp. 295–303 (in Japanese).
SALWICKI A., 1982. Algorithmic Theories of Data Structures. Proc. 9th ICALP’82, LNCS 140, pp. 458–472.
SANCHIS L.E., 1977. Data Types as Lattices: Retractions, Closures and Projections. RAIRO Informatique Theorique, vol. 11, no. 4, pp. 329–344.
SANDERS A.F., GELERNTER H.L., 1977. Data Metastructures. Software Practice Experience, vol. 9, pp. 795–811.
SANNELLA D.T., WIRSING M., 1982. Implementations of Parameterized Specifications. Univ. of Edinburgh, DCS, Report CST-103-82 + Proc. 9th ICALP’82, LNCS 140, pp. 473–488.
SANNELLA D.T., 1981. A New Semantics of CLEAR. Univ. of Edinburgh, DCS, Report CSR-78-81.
SCHAFFERT J.C., SNYDER A., ATKINSON R.R., 1975. The CLU Reference Manual. MIT, Project MAC, Report (obsolete).
SCHEIFLER R.W., SNYDER A., 1977. CLU Information Package. MIT, LCS, Computation Structures Group Memo no. 154.
SCHINDLER S., 1979. The OSA Project: Specification of Data Types for Distributed Systems. TU Berlin, FB Informatik, Forschungsbericht Nr. 79–13.
SCHMIDT J.W., 1979. Some High Level Language Constructs for Data of Type Relation. ACM TODS, vol. 2, no. 3, pp. 247–261.
SCHNABEL U., SCHUBERT W., 1975. Ein Modell zur Beschreibung von Datenstrukturen. Wiss. Z. Techn. Univ. Dresden, vol. 24, pp. 973–980. ZfM: 425. 68027
SCHOETT O., 1981. Ein Modulkonzept in der Theorie Abstrakter Datentypen. Univ. Hamburg, FB Informatik, Bericht IfI-HH-B-81/81.
SCHORRE V., 1976. A Program Verifier with Assertions in Terms of Abstract Data. Proc. Symp. ‘Computer Software Engineering’, pp. 267–280, Polytechnic Press
SCHULZ M., 1981. Berechenbare Algebren, Wortprobleme und kanonische Term-Algebren. RWTH Aachen, Diplomarbeit.
SCHWABE D., LUCENA C.J.P., 1976. Design and Implementation of a Data Abstraction Definition Facility. PUC, Depto. de Informatica, TR + Software Practice Experience, vol. 8 709–719. ZfM: 385. 68018
SCHWARZ P.M., SPECTOR A.Z., 1982. Synchronizing Shared Abstract Types. CMU, DCS, TR CMU-CS-82–128.
Scott D., 1972 a. Data Types as Lattices or the Study of the Logical Types of Structured Data Amsterdam, Lectures.
SCOTT D., 1972 b. Lattice Theory, Data Types and Semantics. Raistin (ed.): ‘Formal Semantics of Programming Languages’, Prentice Hall.
SCOTT D., 1974. Data Types as Lattices. DVMLG, Philosophisches Seminar der Univ. Kiel + SIAM Journal of Computing, vol. 5, pp. 522–587 + Proc. Logic Conf., Lecture Notes in Mathematics.
SENKO M.E., 1977. Conceptual Schemes, Abstract Data Structures, Enterprise Descriptions. Proc. ACM Int. Computing Symp., Belgium, pp. 85–110. ZfM: 367. 68030
SETHI R., 1974. Testing for the Church-Rosser Property. JACM, vol. 21, no. 4, pp. 671–679.
SHAMIR A., WADGE W.W., 1977. Data Types as Objects. Proc. 4th ICALP’77, LNCS 52, pp. 465–479.
SHAW M., FELDMAN G., FITZGERALD R., HILFINGER P.M., KIMURA I., LONDON R.L.,
ROSENBERG J., WULF W.A., 1978. Validating the Utility of Abstraction Techniques. Shaw (ed.): ‘ALPHARD: Form and Content’, pp. 285–294 + Proc. 1978 ACM Annual Conf., Washington, pp. 106–110.
SHAW M., WULF W.A., LONDON R.L., 1976. Abstraction and Verification in ALPHARD: Iteration and Generators. CMU, DCS, TR + USC, ISI + Shaw (ed.): ‘ALPHARD: Form and Content’, pp. 73–116.
SHAW M., WULF W.A., LONDON R.L., 1977. Abstraction and Verification in ALPHARD: Defining and Specifying Iteration and Generators. CACM, vol. 20, no. 8, pp. 553–564. ZfM: 362. 68061
SHAW M., WULF W.A., 1980. Toward Relaxing Assumptions in Languages and their Implementations. Shaw (ed.): ‘ALPHARD: Form and Content’, pp. 295–314.
SHAW M., 1976 a. Research Directions in Abstract Data Structures. Proc. Conf. ‘Data: Abstraction, Definition and Structure’, Sigplan Notices, vol. 8, no. 2, (Special Issue), pp. 66–68.
SHAW M., 1976 b. Abstraction and Verification in ALPHARD: Design and Verification of a Tree Handler. CMU, DCS, Research Report + Shaw (ed.): ‘ALPHARD: Form and Content’, pp. 139–160 + Proc. 5th Texas Conf. on Computing Systems, pp. 86–94.
SHAW M., 1980 a. Abstraction, Data Types and Models for Software. Proc. Workshop ‘Data Abstraction, Databases and Conceptual Modelling’, ACM Special Issue, pp. 189–191.
SHAW M., 1980 b. The Impact of Abstraction Concerns on Modern Programming Languages. CMU, DCS, TR CMU-CS-80-116 + Proc. IEEE 68, pp. 1119–1130.
SHAW M., 1981. ALPHARD: Form and Content. Springer Verlag, ISBN 3-540-90663-0. ZfM: 477. 68012
SHORT K.W., 1979. Protection in Data Type Abstractions Using Constraints on Data Values. The Computer Journal, vol. 24. no. 2, pp. 118–124.
SHORT K.W., 1980. Data Type Interfaces in Ad Hoc Decision Support Systems. Univ. of East Anglia, Ph.D. Thesis.
SILBERSCHATZ A., KIEBURTZ R.B., 1978. The External Consistency of Abstract Data Types. Sigplan Notices, vol. 15, no. 2, pp. 64–73 + Proc. Workshop ‘Reliable Software’, pp. 145–154. ZfM: 407. 68014
SMYTH M.B., 1980. Computability in Categories. Proc. 7th ICALP, pp. 609–620.
SOLER R., 1978. Description des étapes de compilation d’une bibliothèque de types generiques. Report DEA.
SOLOMON M., 1978. Type Definitions with Parameters. Proc. 5th POPL, pp. 31–38.
SPITZEN J.M., LEVITT K.N., ROBINSON L., 1978. An Example of Hierarchical Design and Proof. CACM, vol. 21, no. 12, pp. 1064–1075.
SPITZEN Ü.M., WEGBREIT B., 1975. The Verification and Synthesis of Data Structures. Acta Informatica, vol. 4, pp. 127–144.
SRIVAS M.K., 1978. Automatic Synthesis of Implementations for Abstract Data Types from Algebrai Specifications. MIT, LCS, TR no. 276, Ph.D. Thesis.
STANDISH T.A., 1973. Data Structures - An Axiomatic Approach. Bolt Beranek and Newman, Report no. 2639 + Yeh (ed.): ‘Current Trends i Programming Methodology, Vol. 4: Data Structuring’, pp. 30–59.
STAUNSTRUP J., 1978. Specification, Verification and Implementation of Concurrent Programs. USC, DCS, Dissertation.
STAUNSTRUP J., 1979. Specification and Verification of Concurrent Programs. Aarhus Univ., DCS, Report no. DAIMI PB–94.
STEENSGAARD-MADSEN J., 1981. A Statement-Oriented Approach to Data Abstraction. ACM TOPLAS, vol. 3, no. 1, pp. 1–10. ZfM: 452. 68025
SUBRAHMANYAM P.A., 1978 a. Compatibility Measures for Data Type Definitions. Proc. 5th Johns Hopkins Conf. on Information and Systems Science.
SUBRAHMANYAM P.A., 1978 b. On a Finite Axiomatization of the Data Type L. Sigplan Notices, vol. 13, no. 4, pp. 80–84.
SUBRAHMANYAM P.A., 1979. On Proving the Correctness of Data Type Implementations. Univ. of Utah, DCS, TR.
SUBRAHMANYAM P.A., 1980 a. A New Method for Specifying and Handling Exceptions. Univ. of Utah, DCS, TR.
SUBRAHMANYAM P.A., 1980 b. Computability Issues in Algebraic Data Types and Program Synthesis. Univ. of Utah, DCS, Internal Report.
SUBRAHMANYAM P.A., 1980 c. Experience Using Abstract Data Types. Univ. of Utah, DCS, Internal Report.
SUBRAHMANYAM P.A., 1981. Nondeterminism in Abstract Data Types. Proc. 8th ICALP’81, LNCS 115, pp. 148–164. ZfM:468.68017 - CMP:14. 05. 278
SUBRAHMANYAM P.A., 1982. An Algebraic Basis for VLSI Design. Univ. of Utah, DCS, Draft of a Research Monograph.
SUGIYAMA Y., INOUE K., KASAMI T., 1982. Transformation of a Class of Term Rewriting Systems into Standard Systems. IECE Japan, Paper of Technical Group no. AL81-95 (in Japanese).
SUGIYAMA Y., OKUI J., KASAMI T., 1982. On Algebraic Specifications of a File Management System–Representation Synchronization Mechanisms. Trans, of IECE Japan (in Japanese).
SUGIYAMA Y., SUZUKI I., TANIGUCHI K., KASAMI T., 1981. On Efficient Execution of a Class of Term Rewriting Systems. IECE Japan, Paper of Technical Group no. AL81-12 (in Japanese).
SUGIYAMA Y., SUZUKI I., TANIGUCHI K., KASAMI T., 1982. Efficient Execution in a Class of Term Rewriting Systems. Trans, of IECE Japan, vol. J65-D, no. 7, pp. 858–865 (in Japanese).
SUGIYAMA Y., TANIGUCHI K., KASAMI T., 1979. .
SUGIYAMA Y., TANIGUCHI K., KASAMI T., 1980. An Algebraic Specification Language and its Functional Programs. IECE Japan, Paper of Technical Group no. AL79-99 (in Japanese).
SUGIYAMA Y., TANIGUCHI K., KASAMI T., 1981. A Specification Defined as an Extension of a Base Algebra. Trans, of IECE Japan, vol. J64-D, no. 4, pp. 324–331 (in Japanese).
SUGIYAMA Y., TANIGUCHI K., KASAMI T., 1982. Algebraic Specification Language ASL/1 - The Syntax and its Semantics. IECE Japan, Paper of Technical Group (in Japanese).
SUNSHINE C.A., THOMPSON D.H., ERICKSON R.W., GERHART S.L., SCHWABE D., 1981. Specification and Verification of Communication Protocols in AFFIRM Using State Transition Models. IEEE-SE, vol. SE-8, no. 5, pp. 460–489.
SUZUKI I., SUGIYAMA Y., HAGIHARA K., TANIGUCHI K., KASAMI T., 0KUI J., 1978. Algebraic Specifications of a File Management Program. IECE Japan, Paper of Technical Group no. AL78-46 (in Japanese).
TARDO J.J., 1980. Domains and Data Types in the ERA Model. Chen (ed.): ‘Entity Relationship Approach to Systems Analysis and Design’, North Holland.
TARDO J.J., 1981. The Design, Specification, and Implementation of 0BJ-T: A Language for Writing and Testing Abstract Algebraic Program Specifications. UCLA, DCS, Ph.D. Thesis.
TENNENT R., 1977. On a New Approach to Representation-Independent Data Classes. Acta Informatica 8, pp. 315–324.
THATCHER J.W., LUCAS P., ZILLES S.N., 1982. A Proposal for a Type Specification System. IBM.
THATCHER J.W., WAGNER E.G., WRIGHT J.B., 1976. Specification of Abstract Data Types Using Conditional Axioms. IBM Yorktown, RC 6214.
THATCHER J.W., WAGNER E.G., WRIGHT J.B., 1978. Data Type Specification: Parameterization and the Power of Specification Techniques. IBM Yorktown, RC 7757 + Proc. 4th T0PLAS, pp. 711–733. MR:80d.68028 - CA:26. 12. 3647
THATCHER J.W., WAGNER E.G., WRIGHT J.B., 1978. Notes on Algebraic Foundations for Theoretical Computer Science. Math. Centrum Amsterdam Rep. 109 + F0CS III, Part 2, pp. 83–164 + Summer School on Foundations of Artificial Intelligence and Computer Science, Pisa. MR:81g.68035 - CMP:12. 12. 642
THATCHER J.W., 1981. Data Abstraction, Data Bases, and Conceptual Modelling. Sigplan Notices, vol. 16, no. 1, pp. 196–197.
THOMPSON D.H., GERHART S.L., et al., 1981. The AFFIRM Reference Library. USC, ISI
TIURYN J., 1978. Algebraic Aspects of Logic Based on Term Algebra of R.E. Trees. Warsaw Univ., Research Report.
TOMPA F.W., 1980. A Practical Example of the Specification of Abstract Data Types. Acta Informatica, vol. 13, no. 3, pp. 205–224. ZfM:409.68004/417.68013–CMP:12. 15. 968
TUCKER J.V., 1980. Computing in Algebraic Systems. Math. Centre Amsterdam Rep. 130/80 + Drake/Wainer (eds.): ‘Recursion Theory, Its Generalisations and Applications’, Cambridge University Press.
UNGEHEUER R., 1978. Abstrakte Beschreibung von Datenmodellen. Univ. Karlsruhe, Inst. f. Informatik, Diplomarbeit.
VAN EMDEN M.H., MAIBAUM T.S.E., 1979. Equations Compared with Clauses for Specification of Abstract Data Types. Proc. Workshop ‘Advances in Data Base Theory’, pp. 159–193, Plenum Press. CMP:13. 11. 834
VELOSO P.A.S., MAIBAUM T.S.E., 1982. On Multi-Level Specifications for Abstract Data Types.PUC, Depto. de Informatica.
VELOSO P.A.S., PEQUEÑO H.C., 1979. Don’t Write More Axioms than you Have to: A Methodology for the Specification of Abstract Data Types. PUC, Series: Monografías en Ciencia do Computacas no. 10 /79.
VELOSO P.A.S., PESSOA F.E.P., MAIBAUM T.S.E., 1982. Teoria de tipos abstratos de dados para programacao. Proc. 9th Conf. ‘Latino Americano de Informatica’, Lima.
VELOSO P.A.S., 1979 a. Traversable Stack with Fewer Errors. PUC, Depto. de Informatica + Sigplan Notices, vol. 14, no. 2, pp. 55–59.
VELOSO P.A.S., 1979 b. Traversable Stack with Fewer Errors: Addenda and Corrigenda. Sigplan Notices, vol. 14, no. 10, p. 76.
VELOSO P.A.S., 1981. Methodical Specification of Abstract Data Types via Rewriting Systems. PUC, Depto. de Informatica, Report no. MCC 7 /81.
VON HENKE F.W., 1975. Ori Generating Programs from Data Types: An Approach to Automatic Programming. Huet/Kahn (eds.): ‘Proving and Improving Programs’, pp. 57–69.
VON HENKE F.W., 1976. An Algebraic Approach to Data Types, Program Verification and Program Systhesis. Proc. 5th MFCS’76, LNCS 45, pp. 330–336. ZfM: 384. 68018
WADGE W.W., 1978. Why Data Types are not (just) many Sorted Algebras. Univ. of Warwick, DCS (superseded by Wadge 82 ).
WADGE W.W., 1982. Classified Algebras. Univ. of Warwick, DCS, Theory of Computation Report no. 46.
WAGNER E.G., 1981. Lecture Notes on the Algebraic Spécification of Data Types. IBM Yorktown, RC 9203.
WALLIS P.J.L., 1980. External Representation of Objects of User-Defined Types. ACM TOPLAS, vol. 2, no. 2, pp. 137–152.
WAND M., 1975 a. Efficient Axioms for Algebra Semantics. Indiana Univ., DCS, TR no. 42 (superseded by Wand 77).
WAND M., 1975 b. On the Recursive Specification of Data Types. Proc. 1st Int. Coll. ‘Category Theory Applied to Computation and Control’, LNCS 25, pp. 214–217.
WAND M., 1976. First-Order Identities as a Defining Language. Indiana Univ., DCS, Report 29 + Acta Informatica, vol. 14, pp. 337–357.
WAND M., 1977. Algebraic Theories and Tree Rewriting Systems. Indiana Univ., TR no. 66.
WAND M., 1978. Final Algebra Semantics and Data Type Extensions. Indiana Univ., TR no. 65 + JCSS, vol. 19, no. 1, pp. 27–44. ZfM:418.68020 - MR:81h.68015 - CMP:12.03.131 - CA:23.11. 2774
Wand M., 1981. Specifications, Models, and Implementations of Data Abstractions. TCS, vol. 20, no. 1, pp. 3–32. ZfM:478.68021 - CMP:14.16.1143 - CA:26.06. 1615
WASSERMAN A.I., SHERETZ D.D., HANDA E.F., 1978. Report on the Programming Language PLAIN. Univ. of California, Lab. of Medical Information Science, TR no. 34.
WASSERMAN A.I., 1979. The Extension of Abstract Data Types to Database Management. Univ. of California.
WEBER D., 1979. Transformation Programs for Data Graphs, a Tool for Specifying, Verifying and Implementing Data Types. Appi. Comput. Sci. Ber. Prakt. Inf. 13, pp. 245–263. ZfM: 406. 68018
WEBER H., 1976. The D-Graph Model of Large Shared Data Bases: A Representation of Integrity Constraints, and Views as Abstract Data Types. IBM San Jose, RJ 1875.
WEBER H., 1977. Extending the Concept of Abstract Data Types to Represent Data Base Integrity Constraints and Views. Proc. IEEE-CS Conf. ‘Operating Systems and Data Base Systems’.
WEBER H., 1978. A Software Engineering View of Database Systems. Proc. 4th Int. Conf. on VLDB, West Berlin, Germany.
WEBER H., 1979. The Representation of Data Base Concepts in Terms of Abstract Data Types. Int. Sem. ‘Teaching of Computer Science’, Univ. of Newcastle.
WEBER H., 1980. Are Data Types Universal Modelling Concepts for Data Base Systems ?. Proc. Workshop ‘Data Abstraction, Databases and Conceptual Modelling’, ACM Special Issue, pp. 201–202.
WEDEKIND H.H., 1980 a. Konstruktive Abstrakte Datentypen. IFB 33, pp. 813–824.
WEDEKIND H.H., 1980 b. Constructive Abstract Data Types. Proc. Workshop ‘Data Abstraction, Databases and Conceptual Modelling’, ACM Special Issue, pp. 203–206.
WEGBREIT B., 1974. The Treatment of Data Types in ELI. CACM, vol. 17, no. 5, pp. 251–264.
WEICKER R., 1978. Neuere Konzepte und Entwürfe für Programmiersprachen. Informatik Spektrum, vol. 1, no. 2, pp. 101–112.
WEIHL W., LISKOV B.H., 1982. Specification and Implementation of Resilient, Atomic Data Types. MIT, EECS, Computation Structures Group Memo 223.
WELLS M.B., CORNWELL F., 1976. A Data Type Encapsulation Scheme Utilizing Base-Language Operators. Proc. Conf. ‘Data: Abstraction, Definition and Structure’, Sigplan Notices, 8, no. 2, (Special Issue), pp. 170–178.
WELLS M.B., HUG M., 1978. Practicable Theory of Data Types. Los Alamos Scientific Lab., Report LA-UR-78-3037, + Sigplan Notices, vol. no. 11, p. 10. CA: 23. 09. 2386
WELLS M.B., 1980. The MODCAP Programming Lanugage. Los Alamos Scientific Lab., Report LA-UR-80-898.
WERNER G., 1981. Representation of Effectively Computable Limits. Univ. Lille, TR IT-30-81.
WILE D.S., 1981. Type Transformations. IEEE-SE, vol. SE-7, no. 1, pp. 32–39. ZfM:447.68011 - CA: 25. 04. 1091
WILLIAMS G.J., 1979. Program Checking. Univ. of Rochester, Ph.D. Thesis, TR no. 57.
WING J.M., 1982. Bridging Algebraic Specifications via Interfaces. MIT, DCS, Ph.D. Thesis.
WIRSING M., BROY M., 1980. Abstract Data Types as Lattices of Finitely Generated Models. Proc. 9th MFCS, LNCS 88, pp. 673-685. ZfM:441.68014–CMP:13. 09. 674
WIRSING M., BROY M., 1981. An Analysis of Semantic Models for Algebraic Specifications. Proc. Int. Summer School on Theoretical Foundations of Programming Methodology, Marktoberdorf, pp. 351–413.
WIRSING M., PEPPER P., PARTSCH H., DOSCH W., BROY M., 1980. On Hierarchies of Abstract Data Types. TU München, Inst. f. Informatik, Bericht TUM-18007 + Acta Informatica.
WIRSING M., 1982. Structured Algebraic Spécifications. Proc. AFCET Coll. ‘Les mathématiques de l’informatique’, pp. 93 - 108.
WIRTH N., 1977. MODULA: A Language for Modular Multiprogramming. Software Practice Experience, vol$17, no. 1., pp. 3–35.
WOJDYLO B., 1977. Many Sorted Algebras and their Application in Computer Science. N. Copernicus Univ., Inst, of Mathematics, TR.
WULF W.A., et al, 1978. An Informal Definition of ALPHARD. CMU, DCS, Report CMU-CS-78-105.
WULF W.A., LONDON R.L., SHAW M., 1976. Abstraction and Verification in ALPHARD: Introduction to Language and Methodology. CMU, DCS, TR + USC, ISI + IEEE-SE, vol. SE-2, no. 4, pp. 253-264 + Shaw (ed.): ‘ALPHARD: Form and Content’, pp. 15-60.
WULF W.A., 1974. ALPHARD: Toward a Language to Support Structured Programs. CMU, DCS, Report.
WULF W.A., 1980. Abstract Data Types. A Retrospective and Prospective View. Proc. 9th MFCS, LNCS 88, pp. 94–112. MR:82a.68039 - CMP:13. 09. 674
WYCKOFF M.P., 1980. A Comparison of a Constructive and a Non-Constructive Approach to Data Type Specification. Univ. South Carolina, Masters Thesis.
YEH R.T., 1977. Current Trends in Programming Methodology, Vol. 1: Software Specification and Design. Prentice Hall, Englewood Cliffs, ISBN 0-13-195701-5.
YEH R.T., 1978. Current Trends in Programming Methodology, Vol. 4: Data Strucutring. Prentice Hall, Engelwood Cliffs, ISNB 0-13-195735-X. ZfM: 484. 68003
YEH R.T., 1983. Specification and Verification of Distributed Systems. Proc. 3rd Int. Conf. on Distributed Computing, Florida.
YONEZAWA A., 1978. A Formal Specification Technique for Abstract Data Types with Parallelism. Proc. Int. Conf. ‘Mathematical Studies of Information Processing’, LNCS 75, pp. 127–150. ZfM: 457. 68020
ZELKOWITZ M.V., LARSEN H.J., 1978. Implementation of a Capability-Based Data Abstraction. IEEE-SE, vol. SE-4, no. 1, pp. 56–64. ZfM: 369. 68011
ZELKOWITZ M.V., LYLE J.R., 1981. Implementation of Language Enhancements. Computer Languages, vol. 6, pp. 139–153.
ZELKOWITZ M.V., 1982. What Has Happened to Data Abstractions ? - Experience with one Implementation. Proc. 6th Conf. ‘Software Engineering’, Tokyo.
ZIEGERHOFER A., 1980. PL/ADT: Eine Sprache zur Algebraischen Spezifizierung Abstrakter Datentypen. Univ. Linz, Inst. f. Mathematik, Diplomarbeit.
ZILLES S.N., LUCAS P., THATCHER J.W., 1981. A Look at Algebraic Specifications. IBM Yorktown, RJ 3568.
ZILLES S.N., 1973. Procedural Encapsulation: A Linguistic Protection Technique. Proc. ACM Sigplan-Sigops Interface Meeting, Sigplan Notices, vol. 8, no. 9, pp. 142–146.
ZILLES S.N., 1974. Algebraic Specification of Data Types. MIT, Project MAC Progress Report no. 11 + MIT, Computation Structures Group Memo 119.
ZILLES S.N., 1975 a. Abstract Specifications for Data Types. IBM San Jose, Unpublished Working Paper.
ZILLES S.N., 1975 b. Modularization Around a Suitable Abstraction. Proc. AFIPS Conf., vol. 44, AFIPS Press.
ZILLES S.N., 1980. An Introduction to Data Algebras. IBM San Jose + Proc. Winter School Copenhagen on Abstract Software Specification, LNCS 86, pp. 248–272. ZfM:469.68027 - CMP:13. 09. 674
ZILLES S.N., 1981 a. Types, Algebras and Modelling. Proc. Workshop ‘Data Abstraction, Databases and Conceptual Modelling’, Sigplan Notices, vol. 16, no. 1, pp. 207–209.
ZILLES S.N., 1981 b. A Look at Algebraic Specifications. Proc. 6th IBM Symp. MFCS ‘Logic Aspect of Programs’, Hakona, Japan, pp. 17-40 + Kyoto Univ., RIMS.
ZILLES S.N., 1983. Types, Algebras and Modelling. Brodie/Mylopoulos/Schmidt (eds.): ‘On Conceptual Modelling: Perspectives from Artificial Intelligence, Database and Conceptual Modelling’, Springer Verlag.
ZOLLER P., 1981. Abstrakte Datentypen. Angewandte Informatik 10 /81, pp. 429–431.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1983 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kutzler, B., Lichtenberger, F. (1983). Bibliography. In: Bibliography on Abstract Data Types. Informatik-Fachberichte, vol 68. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-69032-7_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-69032-7_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-12312-5
Online ISBN: 978-3-642-69032-7
eBook Packages: Springer Book Archive