{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:00:05Z","timestamp":1725663605254},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540544159"},{"type":"electronic","value":"9783540476177"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54415-1_58","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:46:23Z","timestamp":1330209983000},"page":"447-458","source":"Crossref","is-referenced-by-count":1,"title":["Polynomial recursion analysis in pascal like programs"],"prefix":"10.1007","author":[{"given":"Dieter","family":"Armbruster","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(86)90003-4","volume":"56","author":"D. Armbruster","year":"1988","unstructured":"D. Armbruster: A Polynomial Determination of the Most-Recent Property. Theoretical Computer Science 56, 3\u201315, 1988.","journal-title":"Theoretical Computer Science"},{"key":"21_CR2","unstructured":"D. Armbruster: Entscheidbarkeit und Bestimmung der Rekursivit\u00e4t von Prozeduren. Dissertation, University of Stuttgart, 1985."},{"key":"21_CR3","unstructured":"ISO\/TC79\/SC5N: Specification for Computer Language Pascal. Third draft proposal, 1981-11-04."},{"key":"21_CR4","first-page":"110","volume":"2","author":"H. Langmaack","year":"1973","unstructured":"H. Langmaack: On Correct Procedure Parameter Transmission in Higher Programming Languages. Acta Informatica 2, 110\u2013142, 1973.","journal-title":"Acta Informatica"},{"key":"21_CR5","unstructured":"A. R. Meyer: Complexity of Program Flow Analysis for Strictness..., private comminication, August 1985."},{"issue":"1","key":"21_CR6","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1145\/2465.214917","volume":"28","author":"D. A. Patterson","year":"1985","unstructured":"D. A. Patterson: Reduced Instruction Set Computers. Comm. of the ACM 28, 1, 8\u201321, 1985.","journal-title":"Comm. of the ACM"},{"issue":"9","key":"21_CR7","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1145\/360336.360341","volume":"19","author":"K. Walter","year":"1976","unstructured":"K. Walter: Recursion Analysis for Compiler Optimization. Comm. of the ACM 19, 9, 514\u2013516, Sept. 1976.","journal-title":"Comm. of the ACM"},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/BF00263196","volume":"18","author":"K. Winklmann","year":"1982","unstructured":"K. Winklmann: On the Complexity of Some Problems Concerning the Use of Procedures I. Acta Informatica 18, 299\u2013318, 1982.","journal-title":"Acta Informatica"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computer Software"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54415-1_58.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:21:28Z","timestamp":1619572888000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54415-1_58"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540544159","9783540476177"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-54415-1_58","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}