{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,20]],"date-time":"2025-07-20T04:16:35Z","timestamp":1752984995467,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030945824"},{"type":"electronic","value":"9783030945831"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-94583-1_10","type":"book-chapter","created":{"date-parts":[[2022,1,13]],"date-time":"2022-01-13T22:02:34Z","timestamp":1642111354000},"page":"197-218","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A Flow-Insensitive-Complete Program Representation"],"prefix":"10.1007","author":[{"given":"Sol\u00e8ne","family":"Mirliaz","sequence":"first","affiliation":[]},{"given":"David","family":"Pichardie","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,14]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Alpern, B., Wegman, M.N., Zadeck, F.K.: Detecting equality of variables in programs. In: POPL (1988)","DOI":"10.1145\/73560.73561"},{"key":"10_CR2","unstructured":"Andersen, L.O.: Program analysis and specialization for the C programming language. Ph.D. thesis. Datalogisk Institut (1994)"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Bod\u00edk, R., Gupta, R., Sarkar, V.: ABCD: eliminating array bounds checks on demand. In: PLDI. ACM (2000)","DOI":"10.1145\/349299.349342"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Cousot, P., Halbwachs, N.: Automatic discovery of linear restraints among variables of a program. In: Conference of POPL\u201978, pp. 84\u201396. ACM Press (1978)","DOI":"10.1145\/512760.512770"},{"issue":"4","key":"10_CR5","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. ACM Trans. Program. Lang. Syst. 13(4), 451\u2013490 (1991)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/978-3-540-27864-1_17","volume-title":"Static Analysis","author":"S Gulwani","year":"2004","unstructured":"Gulwani, S., Necula, G.C.: A polynomial-time algorithm for global value numbering. In: Giacobazzi, R. (ed.) SAS 2004. LNCS, vol. 3148, pp. 212\u2013227. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-27864-1_17"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Hardekopf, B., Lin, C.: Flow-sensitive pointer analysis for millions of lines of code. In: Proceedings of CGO\u201911. ACM Press (2011)","DOI":"10.1109\/CGO.2011.5764696"},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.entcs.2012.11.003","volume":"289","author":"J Henry","year":"2012","unstructured":"Henry, J., Monniaux, D., Moy, M.: PAGAI: a path sensitive static analyser. Electr. Notes Theor. Comput. Sci. 289, 15\u201325 (2012)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-642-18070-5_7","volume-title":"Formal Verification of Object-Oriented Software","author":"L Hubert","year":"2011","unstructured":"Hubert, L., et al.: Sawja: static analysis workshop for java. In: Beckert, B., March\u00e9, C. (eds.) FoVeOOS 2010. LNCS, vol. 6528, pp. 92\u2013106. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-18070-5_7"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Kildall, G.A.: A unified approach to global program optimization. In: Proceedings of POPL\u201973, pp. 194\u2013206. ACM Press (1973)","DOI":"10.1145\/512927.512945"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-319-26529-2_9","volume-title":"Programming Languages and Systems","author":"J Liu","year":"2015","unstructured":"Liu, J., Rival, X.: Abstraction of optional numerical values. In: Feng, X., Park, S. (eds.) APLAS 2015. LNCS, vol. 9458, pp. 146\u2013166. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-26529-2_9"},{"issue":"9","key":"10_CR12","doi-asserted-by":"publisher","first-page":"796","DOI":"10.1016\/j.scico.2009.04.004","volume":"75","author":"F Logozzo","year":"2010","unstructured":"Logozzo, F., F\u00e4hndrich, M.: Pentagons: a weakly relational abstract domain for the efficient validation of array accesses. Sci. Comput. Program. 75(9), 796\u2013807 (2010)","journal-title":"Sci. Comput. Program."},{"key":"10_CR13","unstructured":"Maroneze, A.O.: Certified compilation and worst-case execution time estimation. Theses, Universit\u00e9 Rennes 1 (2014). https:\/\/hal.archives-ouvertes.fr\/tel-01064869"},{"key":"10_CR14","unstructured":"Min\u00e9, A.: The octagon abstract domain. In: Proceedings of WCRE\u201901, p. 310. IEEE Computer Society (2001)"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Mirliaz, S., Pichardie, D.: A flow-insensitive-complete program representation (2021). https:\/\/hal.archives-ouvertes.fr\/hal-03384612. working paper or preprint","DOI":"10.1007\/978-3-030-94583-1_10"},{"issue":"10","key":"10_CR16","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1145\/2714064.2660205","volume":"49","author":"H Nazar\u00e9","year":"2014","unstructured":"Nazar\u00e9, H., Maffra, I., Santos, W., Barbosa, L., Gonnord, L., Quint\u00e3o Pereira, F.M.: Validation of memory accesses through symbolic analyses. ACM SIGPLAN Not. 49(10), 791\u2013809 (2014)","journal-title":"ACM SIGPLAN Not."},{"key":"10_CR17","unstructured":"Nielson, F., Nielson, H.R., Hankin, C.: Principles of Program Analysis. Springer, Heidelberg (2004). https:\/\/books.google.fr\/books?id=RLjt0xSj8DcC"},{"key":"10_CR18","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: Proceedings of PLDI\u201912. ACM Press (2012)","DOI":"10.1145\/2254064.2254092"},{"key":"10_CR19","unstructured":"Pereira, F., Rastello, F.: Static Single Information form (2018). http:\/\/ssabook.gforge.inria.fr\/latest\/book.pdf. Chapter 11 in the SSA-book"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Wegman, M.N., Zadeck, F.K.: Constant propagation with conditional branches. In: Proceedings of POPL\u201985, pp. 291\u2013299. ACM Press (1985)","DOI":"10.1145\/318593.318659"}],"container-title":["Lecture Notes in Computer Science","Verification, Model Checking, and Abstract Interpretation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-94583-1_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,14]],"date-time":"2022-01-14T00:04:52Z","timestamp":1642118692000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-94583-1_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030945824","9783030945831"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-94583-1_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"14 January 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"VMCAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Verification, Model Checking, and Abstract Interpretation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Philadelphia, PA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 January 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 January 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"vmcai2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/popl22.sigplan.org\/home\/VMCAI-2022","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"63","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"23","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"37% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}