{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:00:02Z","timestamp":1725570002797},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642171635"},{"type":"electronic","value":"9783642171642"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-17164-2_20","type":"book-chapter","created":{"date-parts":[[2010,11,19]],"date-time":"2010-11-19T10:54:39Z","timestamp":1290164079000},"page":"287-303","source":"Crossref","is-referenced-by-count":4,"title":["Live Heap Space Bounds for Real-Time Systems"],"prefix":"10.1007","author":[{"given":"Martin","family":"Kero","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pawe\u0142","family":"Pietrzak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johan","family":"Nordlander","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Albert, E., Arenas, P., Genaim, S., Puebla, G., Zanardini, D.: Cost Analysis of Java Bytecode. In: 16th European Symposium on Programming (2007)","DOI":"10.1007\/978-3-540-71316-6_12"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Albert, E., Genaim, S., G\u00f3mez-Zamalloa, M.: Live heap space analysis for languages with garbage collection. In: ISMM (2009)","DOI":"10.1145\/1542431.1542450"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Albert, E., Genaim, S., G\u00f3mez-Zamalloa, M.: Parametric inference of memory requirements for garbage collected languages. In: ISMM (2010)","DOI":"10.1145\/1806651.1806671"},{"key":"20_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1007\/3-540-48683-6_3","volume-title":"Computer Aided Verification","author":"R. Alur","year":"1999","unstructured":"Alur, R.: Timed automata. In: Halbwachs, N., Peled, D.A. (eds.) CAV 1999. LNCS, vol.\u00a01633, pp. 8\u201322. Springer, Heidelberg (1999)"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Alur, R., Dill, D.: A theory of timed automata. Journal of Theoretical Computer Science\u00a0126(2) (1994)","DOI":"10.1016\/0304-3975(94)90010-8"},{"issue":"1","key":"20_CR6","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/BF00365393","volume":"3","author":"T.P. Baker","year":"1991","unstructured":"Baker, T.P.: Stack-based scheduling for realtime processes. Real-Time Syst.\u00a03(1), 67\u201399 (1991)","journal-title":"Real-Time Syst."},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Bengtsson, J., Yi, W.: Timed automata: Semantics, algorithms and tools. In: Lectures on Concurrency and Petri Nets (2003)","DOI":"10.1007\/978-3-540-27755-2_3"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Benoy, F., King, A.: Inferring argument size relationships with CLPR. In: Workshop on Logic-based Program Synthesis and Transformation (1997)","DOI":"10.1007\/3-540-62718-9_12"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Chin, W.N., Nguyen, H.H., Popeea, C., Qin, S.: Analysing memory resource bounds for low-level programs. In: ISMM (2008)","DOI":"10.1145\/1375634.1375656"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"Courcoubetis, C., Yannakakis, M.: Minimum and maximum delay problems in real-time systems. Formal Methods in System Design\u00a01(4) (1992)","DOI":"10.1007\/BF00709157"},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Cousot, P., Halbwachs, N.: Automatic discovery of linear restraints among variables of a program. In: POPL (1978)","DOI":"10.1145\/512760.512770"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Jaffar, J., Maher, M., Marriott, K., Stuckey, P.: The semantics of constraint logic programs. Journal of Logic Programming\u00a037 (1\u20133) (1998)","DOI":"10.1016\/S0743-1066(98)10002-X"},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"Jaffar, J., Maher, M.J.: Constraint logic programming: A survey. Journal of Logic Programming\u00a019 & 20 (1994)","DOI":"10.1016\/0743-1066(94)90033-7"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Jost, S., Loid, H.W., Hammond, K., Hofmann, M.: Static determination of quantitative resource usage for higher-order programs. In: POPL (2010)","DOI":"10.1145\/1706299.1706327"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"Kero, M., Aittamaa, S.: Scheduling garbage collection in real-time systems. In: CODES (2010)","DOI":"10.1145\/1878961.1878971"},{"key":"20_CR16","volume-title":"Real-Time Systems","author":"C.M. Krishna","year":"1997","unstructured":"Krishna, C.M., Shin, K.G.: Real-Time Systems. McGraw-Hill, New York (1997)"},{"key":"20_CR17","unstructured":"Nordlander, J., Carlsson, M., Gill, A., Lindgren, P., von Sydow, B.: The Timber home page (2008), http:\/\/timber-lang.org"},{"key":"20_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/3-540-36384-X_9","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"L. Unnikrishnan","year":"2002","unstructured":"Unnikrishnan, L., Stoller, S.D., Liu, Y.A.: Optimized live heap bound analysis. In: Zuck, L.D., et al. (eds.) VMCAI 2003. LNCS, vol.\u00a02575, pp. 70\u201385. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17164-2_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T11:18:23Z","timestamp":1559819903000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17164-2_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642171635","9783642171642"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17164-2_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}