{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,6]],"date-time":"2025-01-06T05:10:09Z","timestamp":1736140209708,"version":"3.32.0"},"publisher-location":"Berlin\/Heidelberg","reference-count":12,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354010027X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0022525","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T05:49:12Z","timestamp":1132724952000},"page":"460-473","source":"Crossref","is-referenced-by-count":6,"title":["New results on completeness and consistency of abstract data types"],"prefix":"10.1007","author":[{"given":"Peter","family":"Padawitz","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"5","key":"34_CR1","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1016\/0020-0190(79)90071-1","volume":"9","author":"N. Dershowitz","year":"1979","unstructured":"Dershowitz, N.: A Note on Simplification Orderings, Inform. Process. Letters 9, No. 5, 1979, 212\u2013215","journal-title":"Inform. Process. Letters"},{"doi-asserted-by":"crossref","unstructured":"\u2014: Orderings for Term-Rewriting Systems, Proc. 20th IEEE Symp. on FOCS, 1979, 123\u2013131","key":"34_CR2","DOI":"10.1109\/SFCS.1979.32"},{"issue":"8","key":"34_CR3","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1145\/359138.359142","volume":"22","author":"N. Dershowitz","year":"1979","unstructured":"Dershowitz, N., Manna, Z.: Proving Termination With Multiset Orderings, Comm. ACM, Vol. 22, No. 8, 1979, 465\u2013476","journal-title":"Comm. ACM"},{"doi-asserted-by":"crossref","unstructured":"Ehrig, H., Kreowski, H.-J., Padawitz, P.: Stepwise Specification and Implementation of Abstract Data Types, Proc. 5th ICALP, Udine, 1978, Springer Lect. Not. in Comp. Sci. 62, 205\u2013226","key":"34_CR4","DOI":"10.1007\/3-540-08860-1_16"},{"unstructured":"\u2014: Completeness in Algebraic Specifications, to appear in Bull. EATCS, No. 11, 1980","key":"34_CR5"},{"unstructured":"Guttag, J.V.: The Specification and Application to Programming of Abstract Data Types, Ph.D.Thesis, University of Toronto,1975","key":"34_CR6"},{"key":"34_CR7","first-page":"80","volume-title":"An Initial Algebra Approach to the Specification, Correctness and Implementation of Abstract Data Types, in: Current Trends in Programming Methodology, IV: Data Structuring (R.Yeh Ed.)","author":"J.A. Goguen","year":"1978","unstructured":"Goguen, J.A., Thatcher, J.W., Wagner, E.G.: An Initial Algebra Approach to the Specification, Correctness and Implementation of Abstract Data Types, in: Current Trends in Programming Methodology, IV: Data Structuring (R.Yeh Ed.), Prentice Hall, New Jersey, 1978, 80\u2013144"},{"doi-asserted-by":"crossref","unstructured":"Huet, G.: Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems, Proc. 18th IEEE Symp. on FOCS, Providence, RI., 1977, 30\u201345","key":"34_CR8","DOI":"10.1109\/SFCS.1977.9"},{"key":"34_CR9","first-page":"263","volume-title":"Computational Problems in Abstract Algebra","author":"D. Knuth","year":"1970","unstructured":"Knuth, D., Bendix, P.: Simple Word Problems in Universal Algebras, in: Computational Problems in Abstract Algebra (J. Leech Ed.), Pergamon Press, Oxford, 1970, 263\u2013297"},{"unstructured":"Lankford, D.S., Ballantyne, A.M.: Decision Procedures for Simple Equational Theories with Permutative Axioms: Complete Sets of Permutative Reductions, Report ATP-3: Dept. of Math. and Comp. Sci., University of Texas at Austin, 1977","key":"34_CR10"},{"unstructured":"Nourani, F.: Constructive Extension and Implementation of Abstract Data Types and Algorithms, Ph.D.Thesis, University of California at LA, 1979","key":"34_CR11"},{"unstructured":"Padawitz, P.: Proving the Correctness of Implementations by Exclusive Use of Term Algebras, Forschungsbericht Nr. 79-8, TU Berlin, FB 20, 1979","key":"34_CR12"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1980"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0022525","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T21:25:51Z","timestamp":1736112351000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0022525"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354010027X"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/bfb0022525","relation":{},"subject":[]}}