{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T15:47:03Z","timestamp":1764172023658,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642331817"},{"type":"electronic","value":"9783642331824"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33182-4_5","type":"book-chapter","created":{"date-parts":[[2012,9,1]],"date-time":"2012-09-01T21:30:53Z","timestamp":1346535053000},"page":"42-56","source":"Crossref","is-referenced-by-count":6,"title":["Speed and Precision in Range Analysis"],"prefix":"10.1007","author":[{"given":"Victor Hugo Sperle","family":"Campos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raphael Ernani","family":"Rodrigues","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Igor Rafael","family":"de Assis Costa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fernando Magno Quint\u00e3o","family":"Pereira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/978-3-540-72521-3_20","volume-title":"Languages and Compilers for Parallel Computing","author":"R. Barik","year":"2007","unstructured":"Barik, R., Grothoff, C., Gupta, R., Pandit, V., Udupa, R.: Optimal Bitwise Register Allocation Using Integer Linear Programming. In: Alm\u00e1si, G.S., Cascaval, C., Wu, P. (eds.) KSEM 2006. LNCS, vol.\u00a04382, pp. 267\u2013282. Springer, Heidelberg (2007)"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Bertrane, J., Cousot, P., Cousot, R., Feret, J., Mauborgne, L., Min\u00e9, A., Rival, X.: Static analysis and verification of aerospace software by abstract interpretation. In: I@A, pp. 1\u201338. AIAA (2010)","DOI":"10.2514\/6.2010-3385"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Bodik, R., Gupta, R., Sarkar, V.: ABCD: eliminating array bounds checks on demand. In: PLDI, pp. 321\u2013333. ACM (2000)","DOI":"10.1145\/358438.349342"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Cong, J., Fan, Y., Han, G., Lin, Y., Xu, J., Zhang, Z., Cheng, X.: Bitwidth-aware scheduling and binding in high-level synthesis. In: Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC 2005, January 18-21, vol.\u00a02, pp. 856\u2013861 (2005)","DOI":"10.1145\/1120725.1121055"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: POPL, pp. 238\u2013252. ACM (1977)","DOI":"10.1145\/512950.512973"},{"issue":"3","key":"5_CR6","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s10703-009-0089-6","volume":"35","author":"P. Cousot","year":"2009","unstructured":"Cousot, P., Cousot, R., Feret, J., Mauborgne, L., Min\u00e9, A., Rival, X.: Why does astr\u00e9e scale up? Form. Methods Syst. Des.\u00a035(3), 229\u2013264 (2009)","journal-title":"Form. Methods Syst. Des."},{"issue":"4","key":"5_CR7","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., Kenneth Zadeck, F.: Efficiently computing static single assignment form and the control dependence graph. TOPLAS\u00a013(4), 451\u2013490 (1991)","journal-title":"TOPLAS"},{"key":"5_CR8","unstructured":"do Couto Teixeira, D., Pereira, F.M.Q.: The design and implementation of a non-iterative range analysis algorithm on a production compiler. In: SBLP, pp. 45\u201359. SBC (2011)"},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/978-3-642-03456-5_28","volume":"1","author":"T. Gawlitza","year":"2009","unstructured":"Gawlitza, T., Leroux, J., Reineke, J., Seidl, H., Sutre, G., Wilhelm, R.: Polynomial precise interval analysis revisited. Efficient Algorithms\u00a01, 422\u2013437 (2009)","journal-title":"Efficient Algorithms"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1007\/978-3-642-24372-1_38","volume-title":"Automated Technology for Verification and Analysis","author":"L. Lakhdar-Chaouch","year":"2011","unstructured":"Lakhdar-Chaouch, L., Jeannet, B., Girault, A.: Widening with Thresholds for Programs with Complex Control Graphs. In: Bultan, T., Hsiung, P.-A. (eds.) ATVA 2011. LNCS, vol.\u00a06996, pp. 492\u2013502. Springer, Heidelberg (2011)"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Lattner, C., Adve, V.S.: LLVM: A compilation framework for lifelong program analysis & transformation. In: CGO, pp. 75\u201388. IEEE (2004)","DOI":"10.1109\/CGO.2004.1281665"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Lhairech-Lebreton, G., Coussy, P., Heller, D., Martin, E.: Bitwidth-aware high-level synthesis for designing low-power dsp applications. In: ICECS, pp. 531\u2013534. IEEE (2010)","DOI":"10.1109\/ICECS.2010.5724566"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Logozzo, F., Fahndrich, M.: Pentagons: a weakly relational abstract domain for the efficient validation of array accesses. In: SAC, pp. 184\u2013188. ACM (2008)","DOI":"10.1145\/1363686.1363736"},{"issue":"11","key":"5_CR14","doi-asserted-by":"publisher","first-page":"1355","DOI":"10.1109\/43.959864","volume":"20","author":"S. Mahlke","year":"2001","unstructured":"Mahlke, S., Ravindran, R., Schlansker, M., Schreiber, R., Sherwood, T.: Bitwidth cognizant architecture synthesis of custom hardware accelerators. Computer-Aided Design of Integrated Circuits and Systems\u00a020(11), 1355\u20131371 (2001)","journal-title":"Computer-Aided Design of Integrated Circuits and Systems"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Nielson, F., Nielson, H.R., Hankin, C.: Principles of Program Analysis. Springer (1999)","DOI":"10.1007\/978-3-662-03811-6"},{"key":"5_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1007\/978-3-642-18275-4_25","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"H. Oh","year":"2011","unstructured":"Oh, H., Brutschy, L., Yi, K.: Access Analysis-Based Tight Localization of Abstract Memories. In: Jhala, R., Schmidt, D. (eds.) VMCAI 2011. LNCS, vol.\u00a06538, pp. 356\u2013370. Springer, Heidelberg (2011)"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Oh, H., Heo, K., Lee, W., Lee, W., Yi, K.: Design and implementation of sparse global analyses for C-like languages. In: PLDI, pp. 229\u2013238. ACM (2012)","DOI":"10.1145\/2345156.2254092"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Patterson, J.R.C.: Accurate static branch prediction by value range propagation. In: PLDI, pp. 67\u201378. ACM (1995)","DOI":"10.1145\/223428.207117"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Pereira, F.M.Q., Palsberg, J.: Register allocation by puzzle solving. In: PLDI, pp. 216\u2013226. ACM (2008)","DOI":"10.1145\/1379022.1375609"},{"key":"5_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-642-19861-8_8","volume-title":"Compiler Construction","author":"A. Rimsa","year":"2011","unstructured":"Rimsa, A., d\u2019Amorim, M., Pereira, F.M. Q.: Tainted Flow Analysis on e-SSA-Form Programs. In: Knoop, J. (ed.) CC 2011. LNCS, vol.\u00a06601, pp. 124\u2013143. Springer, Heidelberg (2011)"},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"Simon, A.: Value-Range Analysis of C Programs: Towards Proving the Absence of Buffer Overflow Vulnerabilities, 1st edn. Springer (2008)","DOI":"10.1007\/978-1-84800-017-9"},{"key":"5_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/978-3-642-19861-8_2","volume-title":"Compiler Construction","author":"R. Sol","year":"2011","unstructured":"Sol, R., Guillon, C., Pereira, F.M.Q., Bigonha, M.A.S.: Dynamic Elimination of Overflow Tests in a Trace Compiler. In: Knoop, J. (ed.) CC 2011. LNCS, vol.\u00a06601, pp. 2\u201321. Springer, Heidelberg (2011)"},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"Stephenson, M., Babb, J., Amarasinghe, S.: Bitwidth analysis with application to silicon compilation. In: PLDI, pp. 108\u2013120. ACM (2000)","DOI":"10.1145\/358438.349317"},{"key":"5_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-540-24730-2_23","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"Z. Su","year":"2004","unstructured":"Su, Z., Wagner, D.: A Class of Polynomially Solvable Range Constraints for Interval Analysis without Widenings and Narrowings. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol.\u00a02988, pp. 280\u2013295. Springer, Heidelberg (2004)"},{"issue":"1","key":"5_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":"5_CR26","doi-asserted-by":"crossref","unstructured":"Tallam, S., Gupta, R.: Bitwidth aware global register allocation. In: POPL, pp. 85\u201396. ACM (2003)","DOI":"10.1145\/640128.604139"},{"key":"5_CR27","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1145\/996893.996869","volume":"39","author":"A. Venet","year":"2004","unstructured":"Venet, A., Brat, G.: Precise and efficient static array bound checking for large embedded c programs. SIGPLAN Not.\u00a039, 231\u2013242 (2004)","journal-title":"SIGPLAN Not."}],"container-title":["Lecture Notes in Computer Science","Programming Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33182-4_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T18:14:55Z","timestamp":1744049695000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-33182-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642331817","9783642331824"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33182-4_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}