{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:15:25Z","timestamp":1742912125853,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319681665"},{"type":"electronic","value":"9783319681672"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-68167-2_7","type":"book-chapter","created":{"date-parts":[[2017,9,25]],"date-time":"2017-09-25T23:50:53Z","timestamp":1506383453000},"page":"91-108","source":"Crossref","is-referenced-by-count":4,"title":["Loop Quasi-Invariant Chunk Detection"],"prefix":"10.1007","author":[{"given":"Jean-Yves","family":"Moyen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Rubiano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Seiller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,9,27]]},"reference":[{"issue":"1","key":"7_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1017\/S0956796801004191","volume":"12","author":"A Abel","year":"2002","unstructured":"Abel, A., Altenkirch, T.: A predicative analysis of structural recursion. J. Funct. Program. 12(1), 1\u201341 (2002)","journal-title":"J. Funct. Program."},{"issue":"1","key":"7_CR2","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.ic.2008.08.005","volume":"201","author":"P Baillot","year":"2009","unstructured":"Baillot, P., Terui, K.: Light types for polynomial time computation in lambda calculus. Inf. Comput. 201(1), 41\u201362 (2009)","journal-title":"Inf. Comput."},{"key":"7_CR3","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01201998","volume":"2","author":"S Bellantoni","year":"1992","unstructured":"Bellantoni, S., Cook, S.: A new recursion-theoretic characterization of the poly-time functions. Comput. Complex. 2, 97\u2013110 (1992)","journal-title":"Comput. Complex."},{"key":"7_CR4","unstructured":"Cobham, A.: The intrinsic computational difficulty of functions. In: Bar-Hillel, Y. (ed.) CLMPS (1962)"},{"issue":"7","key":"7_CR5","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1145\/390013.808480","volume":"5","author":"J Cocke","year":"1970","unstructured":"Cocke, J.: Global common subexpression elimination. SIGPLAN Not. 5(7), 20\u201324 (1970)","journal-title":"SIGPLAN Not."},{"key":"7_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J-Y Girard","year":"1987","unstructured":"Girard, J.-Y.: Linear logic. Theor. Comput. Sci. 50, 1\u2013110 (1987)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Hofmann, M.: Linear types and non-size increasing polynomial time computation. In: LICS, pp. 464\u2013473 (1999)","DOI":"10.1109\/LICS.1999.782641"},{"key":"7_CR8","unstructured":"Kristiansen, L.: Notes on code motion. Private communication"},{"issue":"3","key":"7_CR9","first-page":"28","volume":"10","author":"L Kristiansen","year":"2009","unstructured":"Kristiansen, L., Jones, N.D.: The flow of data and the complexity of algorithms. Trans. Comput. Log. 10(3), 28 (2009)","journal-title":"Trans. Comput. Log."},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Kuck, D.J., Kuhn, R.H., Padua, D.A., Leasure, B., Wolfe, M.: Dependence graphs and compiler optimizations. In: POPL (1981)","DOI":"10.1145\/567532.567555"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Laird, J., McCusker, G., Manzonetto, G., Pagani, M.: Weighted relational models of typed lambda-calculi. In: IEEE\/ACM LICS (2013)","DOI":"10.1109\/LICS.2013.36"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Lee, C.S., Jones, N.D., Ben-Amram, A.M.: The size-change principle for program termination. In: POPL (2001)","DOI":"10.1145\/360204.360210"},{"key":"7_CR13","first-page":"29","volume":"10","author":"J-Y Moyen","year":"2009","unstructured":"Moyen, J.-Y.: Resource control graphs. ACM Trans. Comput. Log. 10, 29 (2009)","journal-title":"ACM Trans. Comput. Log."},{"key":"7_CR14","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/j.apal.2015.10.001","volume":"167","author":"T Seiller","year":"2016","unstructured":"Seiller, T.: Interaction graphs: additives. Ann. Pure Appl. Log. 167, 95\u2013154 (2016)","journal-title":"Ann. Pure Appl. Log."},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Seiller, T.: Interaction graphs: full linear logic. In: IEEE\/ACM LICS (2016)","DOI":"10.1145\/2933575.2934568"},{"key":"7_CR16","unstructured":"Song, L., Futamura, Y., Gl\u00fcck, R., Hu, Z.: A loop optimization technique based on quasi-invariance (2000)"}],"container-title":["Lecture Notes in Computer Science","Automated Technology for Verification and Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-68167-2_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,10,3]],"date-time":"2017-10-03T03:50:14Z","timestamp":1507002614000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-68167-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319681665","9783319681672"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-68167-2_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}