{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T08:59:37Z","timestamp":1758272377357,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":41,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642548062"},{"type":"electronic","value":"9783642548079"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-54807-9_2","type":"book-chapter","created":{"date-parts":[[2014,3,21]],"date-time":"2014-03-21T09:34:10Z","timestamp":1395394450000},"page":"18-39","source":"Crossref","is-referenced-by-count":7,"title":["Parameterized Construction of Program Representations for Sparse Dataflow Analyses"],"prefix":"10.1007","author":[{"given":"Andr\u00e9","family":"Tavares","sequence":"first","affiliation":[]},{"given":"Benoit","family":"Boissinot","sequence":"additional","affiliation":[]},{"given":"Fernando","family":"Pereira","sequence":"additional","affiliation":[]},{"given":"Fabrice","family":"Rastello","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","unstructured":"Ananian, S.: The static single information form. Master\u2019s thesis. MIT (September 1999)"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Appel, A.W., Palsberg, J.: Modern Compiler Implementation in Java, 2nd edn. Cambridge University Press (2002)","DOI":"10.1017\/CBO9780511811432"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Biggar, P., de Vries, E., Gregg, D.: A practical solution for scripting language compilers. In: SAC, pp. 1916\u20131923. ACM (2009)","DOI":"10.1145\/1529282.1529709"},{"key":"2_CR4","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":"2_CR5","doi-asserted-by":"crossref","unstructured":"Boissinot, B., Hack, S., Grund, D., de Dinechin, B.D., Rastello, F.: Fast liveness checking for SSA-form programs. In: CGO, pp. 35\u201344. IEEE (2008)","DOI":"10.1145\/1356058.1356064"},{"issue":"3","key":"2_CR6","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1145\/177492.177575","volume":"16","author":"P. Briggs","year":"1994","unstructured":"Briggs, P., Cooper, K.D., Torczon, L.: Improvements to graph coloring register allocation. TOPLAS\u00a016(3), 428\u2013455 (1994)","journal-title":"TOPLAS"},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/978-3-642-33182-4_5","volume-title":"Programming Languages","author":"V.H.S. Campos","year":"2012","unstructured":"Campos, V.H.S., Rodrigues, R.E., de Assis Costa, I.R., Pereira, F.M.Q.: Speed and precision in range analysis. In: de Carvalho Junior, F.H., Barbosa, L.S. (eds.) SBLP 2012. LNCS, vol.\u00a07554, pp. 42\u201356. Springer, Heidelberg (2012)"},{"issue":"7","key":"2_CR8","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_CR9","doi-asserted-by":"crossref","unstructured":"Choi, J.-D., Cytron, R., Ferrante, J.: Automatic construction of sparse data flow evaluation graphs. In: POPL, pp. 55\u201366. ACM (1991)","DOI":"10.1145\/99583.99594"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/3-540-61053-7_66","volume-title":"Compiler Construction","author":"F. Chow","year":"1996","unstructured":"Chow, F., Chan, S., Liu, S.-M., Lo, R., Streich, M.: Effective representation of aliases and indirect memory operations in SSA form. In: Gyim\u00f3thy, T. (ed.) CC 1996. LNCS, vol.\u00a01060, pp. 253\u2013267. Springer, Heidelberg (1996)"},{"key":"2_CR11","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":"2_CR12","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":"2_CR13","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_CR14","doi-asserted-by":"crossref","unstructured":"de Ferri\u00e8re, F.: Improvements to the \u03c8-SSA representation. In: SCOPES, pp. 111\u2013121. ACM (2007)","DOI":"10.1145\/1269843.1269859"},{"key":"2_CR15","unstructured":"Teixeira, D.C., 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":"2_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-540-45099-3_9","volume-title":"Static Analysis","author":"S.J. Fink","year":"2000","unstructured":"Fink, S.J., Knobe, K., Sarkar, V.: Unified analysis of array and object references in strongly typed languages. In: SAS 2000. LNCS, vol.\u00a01824, pp. 155\u2013174. Springer, Heidelberg (2000)"},{"key":"2_CR17","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":"2_CR18","doi-asserted-by":"crossref","unstructured":"George, L., Matthias, B.: Taming the IXP network processor. In: PLDI, pp. 26\u201337. ACM (2003)","DOI":"10.1145\/780822.781135"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"An, J.H., Chaudhuri, A., Foster, J.S., Hicks, M.: Dynamic inference of static types for ruby. In: POPL, pp. 459\u2013472. ACM (2011)","DOI":"10.1145\/1925844.1926437"},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"Johnson, R., Pearson, D., Pingali, K.: The program tree structure. In: PLDI, pp. 171\u2013185. ACM (1994)","DOI":"10.1145\/773473.178258"},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"Johnson, R., Pingali, K.: Dependence-based program analysis. In: PLDI, pp. 78\u201389. ACM (1993)","DOI":"10.1145\/173262.155098"},{"key":"2_CR22","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":"2_CR23","doi-asserted-by":"crossref","unstructured":"Lo, R., Chow, F., Kennedy, R., Liu, S.-M., Tu, P.: Register promotion by sparse partial redundancy elimination of loads and stores. In: PLDI, pp. 26\u201337. ACM (1998)","DOI":"10.1145\/277652.277659"},{"issue":"11","key":"2_CR24","first-page":"1355","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. TCAD\u00a020(11), 1355\u20131371 (2001)","journal-title":"TCAD"},{"key":"2_CR25","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s10990-006-8609-1","volume":"19","author":"A. Min\u00e9","year":"2006","unstructured":"Min\u00e9, A.: The octagon abstract domain. Higher Order Symbol. Comput.\u00a019, 31\u2013100 (2006)","journal-title":"Higher Order Symbol. Comput."},{"key":"2_CR26","doi-asserted-by":"crossref","unstructured":"Nanda, M.G., Sinha, S.: Accurate interprocedural null-dereference analysis for java. In: ICSE, pp. 133\u2013143 (2009)","DOI":"10.1109\/ICSE.2009.5070515"},{"key":"2_CR27","unstructured":"Nielson, F., Nielson, H.R., Hankin, C.: Principles of program analysis. Springer (2005)"},{"key":"2_CR28","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":"2_CR29","doi-asserted-by":"crossref","unstructured":"Pingali, K., Bilardi, G.: Optimal control dependence computation and the roman chariots problem. In: TOPLAS, pp. 462\u2013491. ACM (1997)","DOI":"10.1145\/256167.256217"},{"key":"2_CR30","unstructured":"Plevyak, J.B.: Optimization of Object-Oriented and Concurrent Programs. PhD thesis, University of Illinois at Urbana-Champaign (1996)"},{"issue":"1-2","key":"2_CR31","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/S0304-3975(00)00315-7","volume":"277","author":"G. Ramalingam","year":"2002","unstructured":"Ramalingam, G.: On sparse evaluation representations. Theoretical Computer Science\u00a0277(1-2), 119\u2013147 (2002)","journal-title":"Theoretical Computer Science"},{"key":"2_CR32","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., Quint\u00e3o Pereira, F.M.: Tainted flow analysis on e-SSA-form programs. In: Knoop, J. (ed.) CC 2011. LNCS, vol.\u00a06601, pp. 124\u2013143. Springer, Heidelberg (2011)"},{"key":"2_CR33","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.scico.2013.03.012","volume":"80","author":"A.A. Rimsa","year":"2014","unstructured":"Rimsa, A.A., D\u2019Amorim, M., Pereira, F.M.Q., Bigonha, R.: Efficient static checker for tainted variable attacks. Science of Computer Programming\u00a080, 91\u2013105 (2014)","journal-title":"Science of Computer Programming"},{"key":"2_CR34","doi-asserted-by":"crossref","unstructured":"Rodrigues, R.E., Campos, V.H.S., Pereira, F.M.Q.: A fast and low overhead technique to secure programs against integer overflows. In: CGO, pp. 1\u201311. ACM (2013)","DOI":"10.1109\/CGO.2013.6494996"},{"key":"2_CR35","unstructured":"Singer, J.: Static Program Analysis Based on Virtual Register Renaming. PhD thesis, University of Cambridge (2006)"},{"key":"2_CR36","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"},{"issue":"1","key":"2_CR37","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_CR38","doi-asserted-by":"crossref","unstructured":"Tobin-Hochstadt, S., Felleisen, M.: The design and implementation of typed scheme. In: POPL, pp. 395\u2013406 (2008)","DOI":"10.1145\/1328897.1328486"},{"key":"2_CR39","doi-asserted-by":"crossref","unstructured":"Wegman, M.N., Zadeck, F.K.: Constant propagation with conditional branches. TOPLAS\u00a013(2) (1991)","DOI":"10.1145\/103135.103136"},{"issue":"2","key":"2_CR40","first-page":"178","volume":"1","author":"M. Weiss","year":"1992","unstructured":"Weiss, M.: The transitive closure of control dependence: The iterated join. TOPLAS\u00a01(2), 178\u2013190 (1992)","journal-title":"TOPLAS"},{"key":"2_CR41","doi-asserted-by":"crossref","unstructured":"Zadeck, F.K.: Incremental Data Flow Analysis in a Structured Program Editor. PhD thesis, Rice University (1984)","DOI":"10.1145\/502874.502888"}],"container-title":["Lecture Notes in Computer Science","Compiler Construction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-54807-9_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T03:45:45Z","timestamp":1746157545000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-54807-9_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642548062","9783642548079"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54807-9_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}