{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T13:07:48Z","timestamp":1773234468306,"version":"3.50.1"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031067723","type":"print"},{"value":"9783031067730","type":"electronic"}],"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-031-06773-0_43","type":"book-chapter","created":{"date-parts":[[2022,5,19]],"date-time":"2022-05-19T11:24:44Z","timestamp":1652959484000},"page":"800-808","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Incremental Transitive Closure for\u00a0Zonal Abstract Domain"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6032-474X","authenticated-orcid":false,"given":"Kenny","family":"Ballou","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4522-9725","authenticated-orcid":false,"given":"Elena","family":"Sherman","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,20]]},"reference":[{"key":"43_CR1","doi-asserted-by":"publisher","unstructured":"Abate, C., et al.: An extended account of trace-relating compiler correctness and secure compilation. ACM Trans. Program. Lang. Syst. 43(4), 1\u201348 (2021). https:\/\/doi.org\/10.1145\/3460860","DOI":"10.1145\/3460860"},{"key":"43_CR2","doi-asserted-by":"publisher","unstructured":"Blanchet, B., et al.: A static analyzer for large safety-critical software. In: Proceedings of the ACM SIGPLAN 2003 Conference on Programming Language Design and Implementation, pp. 196\u2013207. PLDI 2003, Association for Computing Machinery, New York, NY, USA (2003). https:\/\/doi.org\/10.1145\/781131.781153","DOI":"10.1145\/781131.781153"},{"key":"43_CR3","doi-asserted-by":"publisher","unstructured":"Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms, chap.\u00a026.2. Computer science, McGraw-Hill (2009). https:\/\/doi.org\/10.11708\/9446, https:\/\/books.google.com\/books?id=aefUBQAAQBAJ","DOI":"10.11708\/9446"},{"key":"43_CR4","doi-asserted-by":"publisher","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, pp. 238\u2013252. POPL 1977, ACM, New York, NY, USA (1977). https:\/\/doi.org\/10.1145\/512950.512973","DOI":"10.1145\/512950.512973"},{"key":"43_CR5","doi-asserted-by":"publisher","unstructured":"Dill, D.L.: Timing assumptions and verification of finite-state concurrent systems. Lecture Notes in Computer Science, pp. 197\u2013212 (1990). https:\/\/doi.org\/10.1007\/3-540-52148-8_17","DOI":"10.1007\/3-540-52148-8_17"},{"key":"43_CR6","doi-asserted-by":"publisher","unstructured":"Katz, S.: Program optimization using invariants. IEEE Trans. Softw. Eng. 4(05), 378\u2013389 (1978). https:\/\/doi.org\/10.1109\/TSE.1978.233858","DOI":"10.1109\/TSE.1978.233858"},{"key":"43_CR7","doi-asserted-by":"publisher","unstructured":"Kildall, G.A.: A unified approach to global program optimization. In: Proceedings of the 1st Annual ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, pp. 194\u2013206. POPL 1973, ACM, New York, NY, USA (1973). https:\/\/doi.org\/10.1145\/512927.512945","DOI":"10.1145\/512927.512945"},{"key":"43_CR8","doi-asserted-by":"publisher","unstructured":"Larsen, K., Larsson, F., Pettersson, P., Yi, W.: Efficient verification of real-time systems: compact data structure and state-space reduction. In: Proceedings Real-Time Systems Symposium, pp. 14\u201324. IEEE Computer Society (1997). https:\/\/doi.org\/10.1109\/real.1997.641265,https:\/\/doi.org\/10.1109\/REAL.1997.641265","DOI":"10.1109\/real.1997.641265 10.1109\/REAL.1997.641265"},{"key":"43_CR9","doi-asserted-by":"publisher","unstructured":"Min\u00e9, A.: The octagon abstract domain. Higher Order Symbol. Comput. 19(1), 31\u2013100 (2006). https:\/\/doi.org\/10.1007\/s10990-006-8609-1","DOI":"10.1007\/s10990-006-8609-1"},{"key":"43_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/3-540-44978-7_10","volume-title":"Programs as Data Objects","author":"A Min\u00e9","year":"2001","unstructured":"Min\u00e9, A.: A new numerical abstract domain based on difference-bound matrices. In: Danvy, O., Filinski, A. (eds.) PADO 2001. LNCS, vol. 2053, pp. 155\u2013172. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44978-7_10"},{"key":"43_CR11","doi-asserted-by":"publisher","unstructured":"Sherman, E.: Redesigning soot\u2019s data-flow analysis framework for abstract interpretation. In: Companion Proceedings for the ISSTA\/ECOOP 2018 Workshops, pp. 78\u201384. ISSTA 2018, Association for Computing Machinery, New York, NY, USA (2018). https:\/\/doi.org\/10.1145\/3236454.3236506,https:\/\/doi.org\/10.1145\/3236454.3236506","DOI":"10.1145\/3236454.3236506 10.1145\/3236454.3236506"},{"key":"43_CR12","doi-asserted-by":"publisher","unstructured":"Sherman, E., Dwyer, M.B.: Exploiting domain and program structure to synthesize efficient and precise data flow analyses (t). In: 2015 30th IEEE\/ACM International Conference on Automated Software Engineering (ASE), November 2015. https:\/\/doi.org\/10.1109\/ase.2015.41","DOI":"10.1109\/ase.2015.41"},{"key":"43_CR13","doi-asserted-by":"publisher","unstructured":"Tange, O.: Gnu parallel 20210722 (\u2019blue unity\u2019), July 2021. https:\/\/doi.org\/10.5281\/zenodo.5123056,https:\/\/doi.org\/10.5281\/zenodo.5123056, GNU Parallel is a general parallelizer to run multiple serial command line programs in parallel without changing them","DOI":"10.5281\/zenodo.5123056 10.5281\/zenodo.5123056"},{"key":"43_CR14","unstructured":"Vall\u00e9e-Rai, R. Co, P., Gagnon, E., Hendren, L., Lam, P., Sundaresan, V.: Soot - a java bytecode optimization framework. In: Proceedings of the 1999 Conference of the Centre for Advanced Studies on Collaborative Research, p. 13. CASCON 1999, IBM Press (1999)"},{"key":"43_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/3-540-65193-4_20","volume-title":"Lectures on Embedded Systems","author":"S Yovine","year":"1998","unstructured":"Yovine, S.: Model checking timed automata. In: Rozenberg, G., Vaandrager, F.W. (eds.) EEF School 1996. LNCS, vol. 1494, pp. 114\u2013152. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-65193-4_20"},{"key":"43_CR16","doi-asserted-by":"publisher","unstructured":"Zhu, H., Magill, S., Jagannathan, S.: A data-driven CHC solver. In: Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 707\u2013721. PLDI 2018, Association for Computing Machinery, New York, NY, USA (2018). https:\/\/doi.org\/10.1145\/3192366.3192416","DOI":"10.1145\/3192366.3192416"}],"container-title":["Lecture Notes in Computer Science","NASA Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-06773-0_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T11:14:32Z","timestamp":1659352472000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-06773-0_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031067723","9783031067730"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-06773-0_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"20 May 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NFM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"NASA Formal Methods Symposium","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pasadena, CA","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":"24 May 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 May 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"nfm2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/shemesh.larc.nasa.gov\/nfm2022\/","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":"118","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":"33","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":"6","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":"28% - 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.3","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}