{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:32:33Z","timestamp":1742923953941,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030805142"},{"type":"electronic","value":"9783030805159"}],"license":[{"start":{"date-parts":[[2021,6,12]],"date-time":"2021-06-12T00:00:00Z","timestamp":1623456000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,6,12]],"date-time":"2021-06-12T00:00:00Z","timestamp":1623456000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-80515-9_13","type":"book-chapter","created":{"date-parts":[[2022,12,8]],"date-time":"2022-12-08T20:04:54Z","timestamp":1670529894000},"page":"165-184","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Static Single Information Form"],"prefix":"10.1007","author":[{"given":"Fernando Magno Quint\u00e3o","family":"Pereira","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabrice","family":"Rastello","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,6,12]]},"reference":[{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Allen, F. E. (1970). Control flow analysis. Sigplan Notices, 5(7), 1\u201319 (1970).","DOI":"10.1145\/390013.808479"},{"issue":"3","key":"13_CR4","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1145\/360018.360025","volume":"19","author":"F E Allen","year":"1976","unstructured":"Allen, F. E., & Cocke, J. (1976). A program data flow analysis procedure. Communications of the ACM, 19(3), 137\u2013146.","journal-title":"Communications of the ACM"},{"key":"13_CR123","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., et al. (2009). Polynomial precise interval analysis revisited. Efficient Algorithms, 1, 422\u2013437.","journal-title":"Efficient Algorithms"},{"key":"13_CR125","doi-asserted-by":"crossref","unstructured":"George, L., & Matthias, B. (2003). Taming the IXP network processor. In International Conference on Programming Languages Design and Implementation. PLDI \u201903 (pp. 26\u201337).","DOI":"10.1145\/781131.781135"},{"key":"13_CR154","doi-asserted-by":"crossref","unstructured":"Johnson, R., Pearson, D., & Pingali, K. (1994). The program tree structure. In International Conference on Programming Languages Design and Implementation. PLDI \u201994 (pp. 171\u2013185).","DOI":"10.1145\/178243.178258"},{"key":"13_CR187","doi-asserted-by":"crossref","unstructured":"Lo, R., et al. (1998). Register promotion by sparse partial redundancy elimination of loads and stores. In International Conference on Programming Languages Design and Implementation. PLDI \u201998 (pp. 26\u201337).","DOI":"10.1145\/277652.277659"},{"key":"13_CR224","doi-asserted-by":"crossref","unstructured":"Pingali, K., & Bilardi, G. (1995). APT: A data structure for optimal control dependence computation. In International Conference on Programming Languages Design and Implementation. PLDI \u201995 (pp. 211\u2013222).","DOI":"10.1145\/207110.207114"},{"key":"13_CR225","doi-asserted-by":"crossref","unstructured":"Pingali, K., & Bilardi, G. (1997). Optimal control dependence computation and the roman chariots problem. In ACM Transactions on Programming Language and Systems (pp. 462\u2013491) (1997).","DOI":"10.1145\/256167.256217"},{"key":"13_CR228","unstructured":"Plevyak, J. B. (1996). Optimization of Object-Oriented and Concurrent Programs. PhD Thesis. University of Illinois at Urbana-Champaign."},{"issue":"1","key":"13_CR277","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. (2005). A class of polynomially solvable range constraints for interval analysis without widenings. Theoretical Computeter Science, 345(1), 122\u2013138.","journal-title":"Theoretical Computeter Science"}],"container-title":["SSA-based Compiler Design"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-80515-9_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,8]],"date-time":"2022-12-08T20:05:26Z","timestamp":1670529926000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-80515-9_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,12]]},"ISBN":["9783030805142","9783030805159"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-80515-9_13","relation":{},"subject":[],"published":{"date-parts":[[2021,6,12]]},"assertion":[{"value":"12 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}