{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:12Z","timestamp":1725663372847},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540129257"},{"type":"electronic","value":"9783540388098"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1984]]},"DOI":"10.1007\/3-540-12925-1_35","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:00:02Z","timestamp":1330192802000},"page":"145-154","source":"Crossref","is-referenced-by-count":0,"title":["For statements with restricted enumerations"],"prefix":"10.1007","author":[{"given":"S.","family":"Heilbrunner","sequence":"first","affiliation":[]},{"given":"L.","family":"Schmitz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"issue":"3","key":"13_CR1","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1145\/1067649.801712","volume":"10","author":"K.-H. Chu","year":"1982","unstructured":"K.-H. Chu, K.-S. Fu: VLSI architectures for high speed recognition of context-free languages and finite-state languages, SIGARCH Newsletter 10,3(1982) 43\u201349.","journal-title":"SIGARCH Newsletter"},{"issue":"3","key":"13_CR2","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0020-0190(82)90045-X","volume":"15","author":"E. W. Dijkstra","year":"1982","unstructured":"E.W. Dijkstra, A.J.M. van Gasteren: An introduction to three algorithms for sorting in situ, Inf. Process. Lett. 15,3(1982) 129\u2013133.","journal-title":"Inf. Process. Lett."},{"key":"13_CR3","volume-title":"A discipline of programming","author":"E. W. Dijkstra","year":"1976","unstructured":"E.W. Dijkstra: A discipline of programming, Prentice-Hall, Englewood Cliffs (1976)."},{"key":"13_CR4","unstructured":"U. Furbach, L. Schmitz: Rigorous derivation of a sophisticated algorithm: smoothsort, Techn. Report Nr. 8302, FB Informatik, Hochschule der Bundeswehr M\u00fcnchen (1983)."},{"issue":"6","key":"13_CR5","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1145\/359605.359624","volume":"20","author":"D. Gries","year":"1977","unstructured":"D. Gries, N. Gehani: Some ideas on data types in high-level languages, CACM 20,6(1977) 414\u2013420.","journal-title":"CACM"},{"key":"13_CR6","volume-title":"Introduction to formal language theory","author":"M. Harrison","year":"1978","unstructured":"M. Harrison: Introduction to formal language theory, Addison-Wesley, Reading, Mass. (1978)."},{"key":"13_CR7","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1007\/BF01932305","volume":"12","author":"C. A. R. R. Hoare","year":"1972","unstructured":"C.A.R. Hoare: A note on the for statement, BIT 12(1972) 334\u2013341.","journal-title":"BIT"},{"issue":"1","key":"13_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-6423(82)90002-8","volume":"2","author":"C. Lengauer","year":"1982","unstructured":"C. Lengauer, E.C.R. Hehner: A methodology for programming with concurrency: an informal presentation, Sci. Comput. Programming 2,1(1982) 1\u201318.","journal-title":"Sci. Comput. Programming"},{"issue":"1","key":"13_CR9","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0167-6423(82)90003-X","volume":"2","author":"C. Lengauer","year":"1982","unstructured":"C. Lengauer: A methodology for programming with concurrency: the formalism, Sci. Comput. Programming 2,1(1982) 19\u201352.","journal-title":"Sci. Comput. Programming"},{"issue":"8","key":"13_CR10","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1145\/359763.359789","volume":"20","author":"B. Liskov","year":"1977","unstructured":"B. Liskov, A. Snyder, R. Atkinson, C. Schaffert: Abstraction mechanisms in CLU, CACM 20,8(1977) 564\u2013576.","journal-title":"CACM"},{"issue":"4","key":"13_CR11","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/BF02242140","volume":"30","author":"L. Schmitz","year":"1983","unstructured":"L. Schmitz: An improved transitive closure algorithm, Computing 30,4(1983) 359\u2013371.","journal-title":"Computing"},{"issue":"8","key":"13_CR12","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1145\/359763.359782","volume":"20","author":"M. Shaw","year":"1977","unstructured":"M. Shaw, W. Wulf, R.L. London: Abstraction and verification in Alphard: defining and specifying iteraction and generators, CACM 20,8(1977) 553.","journal-title":"CACM"},{"key":"13_CR13","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R. Tarjan","year":"1972","unstructured":"R. Tarjan: Depth-first search and linear graph algorithms, SIAM J. Comput. 1(1972) 146\u2013160.","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","International Symposium on Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-12925-1_35.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T20:52:21Z","timestamp":1619556741000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-12925-1_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984]]},"ISBN":["9783540129257","9783540388098"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-12925-1_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1984]]}}}