{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:24:18Z","timestamp":1725578658865},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642198601"},{"type":"electronic","value":"9783642198618"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-19861-8_2","type":"book-chapter","created":{"date-parts":[[2011,3,14]],"date-time":"2011-03-14T13:39:26Z","timestamp":1300109966000},"page":"2-21","source":"Crossref","is-referenced-by-count":7,"title":["Dynamic Elimination of Overflow Tests in a Trace Compiler"],"prefix":"10.1007","author":[{"given":"Rodrigo","family":"Sol","sequence":"first","affiliation":[]},{"given":"Christophe","family":"Guillon","sequence":"additional","affiliation":[]},{"given":"Fernando Magno","family":"Quint\u00e3o Pereira","sequence":"additional","affiliation":[]},{"given":"Mariza A. S.","family":"Bigonha","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"2_CR1","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1145\/857076.857077","volume":"35","author":"J. Aycock","year":"2003","unstructured":"Aycock, J.: A brief history of just-in-time. ACM Computing Surveys\u00a035(2), 97\u2013113 (2003)","journal-title":"ACM Computing Surveys"},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/349299.349303","volume-title":"PLDI","author":"V. Bala","year":"2000","unstructured":"Bala, V., Duesterwald, E., Banerjia, S.: Dynamo: a transparent dynamic optimization system. In: PLDI, pp. 1\u201312. ACM, New York (2000)"},{"key":"2_CR3","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1145\/349299.349342","volume-title":"PLDI","author":"R. Bodik","year":"2000","unstructured":"Bodik, R., Gupta, R., Sarkar, V.: ABCD: eliminating array bounds checks on demand. In: PLDI, pp. 321\u2013333. ACM, New York (2000)"},{"key":"2_CR4","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1145\/1244381.1244389","volume-title":"PEPM","author":"J. Carette","year":"2007","unstructured":"Carette, J., Kucera, M.: Partial evaluation of maple. In: PEPM, pp. 41\u201350. ACM, New York (2007)"},{"issue":"7","key":"2_CR5","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1145\/74818.74831","volume":"24","author":"C. Chambers","year":"1989","unstructured":"Chambers, C., Ungar, D.: Customization: optimizing compiler technology for self, a dynamically-typed object-oriented programming language. SIGPLAN Not.\u00a024(7), 146\u2013160 (1989)","journal-title":"SIGPLAN Not."},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1145\/1508293.1508304","volume-title":"VEE","author":"M. Chang","year":"2009","unstructured":"Chang, M., Smith, E., Reitmaier, R., Bebenita, M., Gal, A., Wimmer, C., Eich, B., Franz, M.: Tracing for web 3.0: trace compilation for the next generation web applications. In: VEE, pp. 71\u201380. ACM, New York (2009)"},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/978-3-642-11970-5_4","volume-title":"Compiler Construction","author":"M. Chevalier-Boisvert","year":"2010","unstructured":"Chevalier-Boisvert, M., Hendren, L., Verbrugge, C.: Optimizing matlab through just-in-time specialization. In: Gupta, R. (ed.) CC 2010. LNCS, vol.\u00a06011, pp. 46\u201365. Springer, Heidelberg (2010)"},{"key":"2_CR8","unstructured":"ECMA Committe. ECMAScript Language Specification. ECMA, 5th edn. (2009)"},{"issue":"4","key":"2_CR9","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1145\/115372.115320","volume":"13","author":"R. Cytron","year":"1991","unstructured":"Cytron, R., Ferrante, J., Rosen, B.K., Wegman, M.N., Zadeck, F.K.: Efficiently computing static single assignment form and the control dependence graph. TOPLAS\u00a013(4), 451\u2013490 (1991)","journal-title":"TOPLAS"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1007\/978-3-540-39815-8_21","volume-title":"Generative Programming and Component Engineering","author":"D. Elphick","year":"2003","unstructured":"Elphick, D., Leuschel, M., Cox, S.: Partial evaluation of MATLAB. In: Pfenning, F., Macko, M. (eds.) GPCE 2003. LNCS, vol.\u00a02830, pp. 344\u2013363. Springer, Heidelberg (2003)"},{"key":"2_CR11","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1109\/TC.1981.1675827","volume":"30","author":"J.A. Fisher","year":"1981","unstructured":"Fisher, J.A.: Trace scheduling: A technique for global microcode compaction. Trans. Comput.\u00a030, 478\u2013490 (1981)","journal-title":"Trans. Comput."},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Richards, G., Lebresne, S., Burg, B., Vitek, J.: An analysis of the dynamic behavior of javascript programs. In: PLDI, pp. 1\u201312 (2010)","DOI":"10.1145\/1809028.1806598"},{"key":"2_CR13","unstructured":"Gal, A.: Efficient Bytecode Verification and Compilation in a Virtual Machine. PhD thesis, University of California, Irvine (2006)"},{"key":"2_CR14","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1145\/1542476.1542528","volume-title":"PLDI","author":"A. Gal","year":"2009","unstructured":"Gal, A., Eich, B., Shaver, M., Anderson, D., Kaplan, B., Hoare, G., Mandelin, D., Zbarsky, B., Orendorff, J., Ruderman, J., Smith, E., Reitmair, R., Haghighat, M.R., Bebenita, M., Change, M., Franz, M.: Trace-based just-in-time type specialization for dynamic languages. In: PLDI, pp. 465\u2013478. ACM, New York (2009)"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Gal, A., Probst, C.W., Franz, M.: Hotpathvm: an effective jit compiler for resource-constrained devices. In: VEE, pp. 144\u2013153 (2006)","DOI":"10.1145\/1134760.1134780"},{"key":"2_CR16","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1145\/103162.103163","volume":"23","author":"D. Goldberg","year":"1991","unstructured":"Goldberg, D.: What every computer scientist should know about floating-point arithmetic. Comput. Surv.\u00a023, 5\u201348 (1991)","journal-title":"Comput. Surv."},{"issue":"3","key":"2_CR17","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1109\/TSE.1977.231133","volume":"3","author":"W.H. Harrison","year":"1977","unstructured":"Harrison, W.H.: Compiler analysis of the value ranges for variables. IEEE Trans. Softw. Eng.\u00a03(3), 243\u2013250 (1977)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"2_CR18","volume-title":"Partial Evaluation and Automatic Program Generation","author":"N.D. Jones","year":"1993","unstructured":"Jones, N.D., Gomard, C.K., Sestoft, P.: Partial Evaluation and Automatic Program Generation, 1st edn. Prentice Hall, Englewood Cliffs (1993)","edition":"1"},{"issue":"4","key":"2_CR19","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1145\/367177.367199","volume":"3","author":"J. McCarthy","year":"1960","unstructured":"McCarthy, J.: Recursive functions of symbolic expressions and their computation by machine, part i. Communications of ACM\u00a03(4), 184\u2013195 (1960)","journal-title":"Communications of ACM"},{"key":"2_CR20","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1145\/207110.207117","volume-title":"PLDI","author":"J.R.C. Patterson","year":"1995","unstructured":"Patterson, J.R.C.: Accurate static branch prediction by value range propagation. In: PLDI, pp. 67\u201378. ACM, New York (1995)"},{"key":"2_CR21","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1145\/1014007.1014010","volume-title":"PEPM","author":"A. Rigo","year":"2004","unstructured":"Rigo, A.: Representation-based just-in-time specialization and the psyco prototype for python. In: PEPM, pp. 15\u201326. ACM, New York (2004)"},{"issue":"4","key":"2_CR22","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1145\/778559.778561","volume":"25","author":"U.P. Schultz","year":"2003","unstructured":"Schultz, U.P., Lawall, J.L., Consel, C.: Automatic program specialization for java. TOPLAS\u00a025(4), 452\u2013499 (2003)","journal-title":"TOPLAS"},{"issue":"10","key":"2_CR23","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1145\/1103845.1094837","volume":"40","author":"A. Shankar","year":"2005","unstructured":"Shankar, A., Sastry, S.S., Bod\u00edk, R., Smith, J.E.: Runtime specialization with optimistic heap analysis. SIG. Not.\u00a040(10), 327\u2013343 (2005)","journal-title":"SIG. Not."},{"key":"2_CR24","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1145\/349299.349317","volume-title":"PLDI","author":"M. Stephenson","year":"2000","unstructured":"Stephenson, M., Babb, J., Amarasinghe, S.: Bidwidth analysis with application to silicon compilation. In: PLDI, pp. 108\u2013120. ACM, New York (2000)"},{"issue":"1","key":"2_CR25","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.tcs.2005.07.035","volume":"345","author":"Z. Su","year":"2005","unstructured":"Su, Z., Wagner, D.: A class of polynomially solvable range constraints for interval analysis without widenings. Theoretical Computeter Science\u00a0345(1), 122\u2013138 (2005)","journal-title":"Theoretical Computeter Science"},{"key":"2_CR26","volume-title":"POPL","author":"S.y. Guo","year":"2011","unstructured":"Guo, S.y., Palsberg, J.: The essence of compiling with traces. In: POPL. ACM, New York (2011) (page to appear)"},{"key":"2_CR27","doi-asserted-by":"crossref","unstructured":"Zaleski, M.: YETI: a gradually extensible trace interpreter. PhD thesis, University of Toronto (2007)","DOI":"10.1145\/1254810.1254823"}],"container-title":["Lecture Notes in Computer Science","Compiler Construction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19861-8_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,5]],"date-time":"2023-06-05T14:42:15Z","timestamp":1685976135000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19861-8_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642198601","9783642198618"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19861-8_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}