{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:47:28Z","timestamp":1725662848189},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540108436"},{"type":"electronic","value":"9783540387459"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1981]]},"DOI":"10.1007\/3-540-10843-2_11","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:26:58Z","timestamp":1330190818000},"page":"129-147","source":"Crossref","is-referenced-by-count":8,"title":["Algorithmic specifications of abstract data types"],"prefix":"10.1007","author":[{"given":"Jacques","family":"Loeckx","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,25]]},"reference":[{"issue":"3","key":"11_CR1","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/0304-3975(79)90034-3","volume":"9","author":"R. Aubin","year":"1979","unstructured":"R. Aubin, \"Mechanizing structural induction, part 1\", Theoretical Computer Science 9, 3, pp. 329\u2013345 (1979)","journal-title":"Theoretical Computer Science"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"M. Broy, W. Dosch, H. Partsch, P. Pepper, M. Wirsing, \"Existential quantifiers in abstract data types\", Proc. ICALP, Lect. Notes in Comp. Sc. 71, Springer-Verlag, pp. 71\u201387 (1979)","DOI":"10.1007\/3-540-09510-1_7"},{"key":"11_CR3","unstructured":"M. Broy, M. Wirsing, \"Partial recursive functions and abstract data types\", EATCS Bull. no 11, pp. 34\u201341 (June 1980)"},{"key":"11_CR4","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1093\/comjnl\/12.1.41","volume":"12","author":"R. M. Burstall","year":"1969","unstructured":"R. M. Burstall, \"Proving properties of programs by structural induction\", Comp. J. 12, pp. 41\u201348 (1969)","journal-title":"Comp. J."},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"R. Cartwright, \"A constructive alternative to axiomatic data type definitions\", Internal Report TR 80\u2013427, Cornell University, June 1980","DOI":"10.1145\/800087.802789"},{"key":"11_CR6","first-page":"203","volume":"62","author":"H. Ehrig","year":"1978","unstructured":"H. Ehrig, H. J. Kreowski, P. Padawitz, \"Stepwise specification and implementation of abstract data types\", Proc. ICALP, Lect. Notes in Comp. Sc. 62, pp. 203\u2013226, Springer-Verlag, 1978","journal-title":"Proc. ICALP, Lect. Notes in Comp. Sc."},{"key":"11_CR7","unstructured":"J. A. Goguen, J. W. Thatcher, E. G. Wagner, \"An initial algebra approach to the specification, correctness and implementation of abstract data types\", in \"Current Trends in Programming Methodology IV\" (R. Yeh, ed.), pp. 80\u2013149, Prentice-Hall, 1978"},{"key":"11_CR8","unstructured":"J. A. Goguen, \"Abstract errors for abstract data types\" in E. J. Neuhold (ed.), \"Formal description of programming concepts\", North-Holland, 1978"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"M. Gordon, R. Milner, C. Wadsworth, \"Edinburgh LCF\", Lecture Notes in Computer Science 78, Springer-Verlag, 1979","DOI":"10.1007\/3-540-09724-4"},{"issue":"1","key":"11_CR10","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF00260922","volume":"10","author":"J. V. Guttag","year":"1978","unstructured":"J. V. Guttag, J. J. Horning, \"The algebraic specifications of abstract data types\", Acta Informatica 10, 1, pp. 27\u201352 (1978)","journal-title":"Acta Informatica"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"J. V. Guttag, E. Horowitz, D. R. Musser, \"Abstract data types and software validation\", Comm. ACM 21, 12, pp. 1048\u20131064","DOI":"10.1145\/359657.359666"},{"issue":"1","key":"11_CR12","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1109\/TSE.1980.230209","volume":"SE-6","author":"J. V. Guttag","year":"1980","unstructured":"J. V. Guttag, \"Notes on type abstraction\", IEEE Trans. on Softw. Eng. SE-6, 1, pp. 13\u201323 (1980)","journal-title":"IEEE Trans. on Softw. Eng."},{"issue":"5","key":"11_CR13","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1145\/988090.988096","volume":"14","author":"D. Kapur","year":"1979","unstructured":"D. Kapur, \"Specifications of Majster's traversable stack and Veloso's traversable stack\", SIGPLAN Notices 14, 5, pp. 46\u201353 (1979)","journal-title":"SIGPLAN Notices"},{"key":"11_CR14","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1007\/BFb0022517","volume":"88","author":"H. Klaeren","year":"1980","unstructured":"H. Klaeren, \"A simple class of algorithmic specifications for abstract software modules\", Proc. ICALP, Lect. Notes in Comp. Sc. 88, pp. 362\u2013374, Springer-Verlag, 1980","journal-title":"Proc. ICALP, Lect. Notes in Comp. Sc."},{"key":"11_CR15","unstructured":"J. Loeckx, \"Proving properties of algorithmic specifications of abstract data types in AFFIRM\", AFFIRM-Memo-29-JL, USC-ISI, Marina del Rey, 1980"},{"key":"11_CR16","series-title":"Internal Report","volume-title":"Algorithmic specifications of abstract data types","author":"J. Loeckx","year":"1980","unstructured":"J. Loeckx, \"Algorithmic specifications of abstract data types\", Internal Report A 80\/12, Fachbereich 10, Universit\u00e4t des Saarlandes, Saarbr\u00fccken, 1980"},{"key":"11_CR17","series-title":"Internal Report","volume-title":"Implementations of abstract data types and their correctness proofs","author":"J. Loeckx","year":"1980","unstructured":"J. Loeckx, \"Implementations of abstract data types and their correctness proofs\", Internal Report A 80\/13, Fachbereich 10, Universit\u00e4t des Saarlandes, Saarbr\u00fccken, 1980"},{"key":"11_CR18","unstructured":"J. Loeckx, \"Algorithmic specifications of some non-trivial data types\", Internal Report, Fachbereich 10, Universit\u00e4t des Saarlandes, to appear"},{"issue":"1","key":"11_CR19","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0304-3975(79)90059-8","volume":"8","author":"M. E. Majster","year":"1979","unstructured":"M. E. Majster, \"Data types, abstract data types and their specification problem\", Theor. Comp. Sc. 8, 1, pp. 89\u2013127 (1979)","journal-title":"Theor. Comp. Sc."},{"issue":"1","key":"11_CR20","first-page":"1","volume":"7","author":"R. Milner","year":"1972","unstructured":"R. Milner, \"Implementation and application of Scott's logic for computable functions\", Proc. ACM Conf. on Proving Assertions about Programs, SIGPLAN Notices 7, 1, pp. 1\u20136 (1972)","journal-title":"Proc. ACM Conf. on Proving Assertions about Programs, SIGPLAN Notices"},{"key":"11_CR21","doi-asserted-by":"crossref","unstructured":"R. Milner, \"Models of LCF\", Stanford University Memo AIM-186, January 1973","DOI":"10.21236\/AD0758645"},{"issue":"6","key":"11_CR22","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1145\/947658.947666","volume":"15","author":"A. Moitra","year":"1980","unstructured":"A. Moitra, \"A note on algebraic specifications of binary trees\", SIGPLAN Notices 15, 6, pp. 64\u201367 (1980)","journal-title":"SIGPLAN Notices"},{"issue":"1","key":"11_CR23","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1109\/TSE.1980.230459","volume":"SE-6","author":"D. R. Musser","year":"1980","unstructured":"D. R. Musser, \"Abstract data type specification in the AFFIRM System\", IEEE Trans. on Softw. Eng. SE-6, 1, pp. 24\u201332 (1980)","journal-title":"IEEE Trans. on Softw. Eng."},{"key":"11_CR24","volume-title":"Denotational semantics: The Scott-Strachey approach to programming language theory","author":"J. E. Stoy","year":"1977","unstructured":"J. E. Stoy, \"Denotational semantics: The Scott-Strachey approach to programming language theory\", MIT-Press, Cambridge (Mass.) 1977"},{"key":"11_CR25","unstructured":"D. H. Thompson (Ed.), \"AFFIRM Reference Manual\", Internal Report, USC-ISI, Marina del Rey, 1979"},{"key":"11_CR26","unstructured":"M. Wirsing, P. Pepper, H. Partsch, W. Dosch, M. Broy, \"On hierarchies of abstract data types\", Internal Report TUM-I 8007, Technische Universit\u00e4t M\u00fcnchen, Mai 1980"},{"key":"11_CR27","unstructured":"S. N. Zilles, \"Algebraic specifications of data types\", Comp. Struct. Group Memo 119, Lab. for Comp. Sc., MIT, 1974"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-10843-2_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:03:32Z","timestamp":1605643412000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-10843-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981]]},"ISBN":["9783540108436","9783540387459"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/3-540-10843-2_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1981]]}}}