{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,20]],"date-time":"2025-07-20T03:58:51Z","timestamp":1752983931464,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030888053"},{"type":"electronic","value":"9783030888060"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-88806-0_7","type":"book-chapter","created":{"date-parts":[[2021,10,13]],"date-time":"2021-10-13T17:25:06Z","timestamp":1634145906000},"page":"144-165","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Disjunctive Interval Analysis"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1354-431X","authenticated-orcid":false,"given":"Graeme","family":"Gange","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0516-1167","authenticated-orcid":false,"given":"Jorge A.","family":"Navas","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5959-3769","authenticated-orcid":false,"given":"Peter","family":"Schachte","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2352-1883","authenticated-orcid":false,"given":"Harald","family":"S\u00f8ndergaard","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2186-0459","authenticated-orcid":false,"given":"Peter J.","family":"Stuckey","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,10,13]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","unstructured":"Apt, K.: Principles of Constraint Programming, Cambridge University Press, Cambridge (2003). https:\/\/doi.org\/10.1017\/CBO9780511615320","DOI":"10.1017\/CBO9780511615320"},{"issue":"3","key":"7_CR2","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1145\/136035.136043","volume":"24","author":"R Bryant","year":"1992","unstructured":"Bryant, R.: Symbolic Boolean manipulation with ordered binary-decision diagrams. ACM Comput. Surv. 24(3), 293\u2013318 (1992). https:\/\/doi.org\/10.1145\/136035.136043","journal-title":"ACM Comput. Surv."},{"key":"7_CR3","doi-asserted-by":"publisher","unstructured":"Chaki, S., Gurfinkel, A., Strichman, O.: Decision diagrams for linear arithmetic. In: Proceedings of the 9th Conference on Formal Methods in Computer-Aided Design (FMCAD 2009), pp. 53\u201360. IEEE Comp. Soc. (2009). https:\/\/doi.org\/10.1109\/FMCAD.2009.5351143","DOI":"10.1109\/FMCAD.2009.5351143"},{"key":"7_CR4","doi-asserted-by":"publisher","unstructured":"Choi, C.W., Harvey, W., Lee, J.H.M., Stuckey, P.J.: Finite domain bounds consistency revisited. In: Proceedings of the Australian Conference on Artificial Intelligence 2006. LNCS, vol. 4304, pp. 49\u201358. Springer (2006). https:\/\/doi.org\/10.1007\/11941439_9","DOI":"10.1007\/11941439_9"},{"key":"7_CR5","doi-asserted-by":"publisher","unstructured":"Cousot, P., Cousot, R.: Systematic design of program analysis frameworks. In: Proceedings of the Sixth ACM Symposium on Principles of Programming Languages, pp. 269\u2013282. ACM Press (1979). https:\/\/doi.org\/10.1145\/567752.567778","DOI":"10.1145\/567752.567778"},{"key":"7_CR6","doi-asserted-by":"publisher","unstructured":"Cousot, P., Cousot, R., Mauborgne, L.: A scalable segmented decision tree abstract domain. In: Manna, Z., Peled, D.A. (eds.) Time for Verification: Essays in Memory of Amir Pnueli, LNCS, vol. 6200, pp. 72\u201395. Springer (2010). https:\/\/doi.org\/10.1007\/978-3-642-13754-9_5","DOI":"10.1007\/978-3-642-13754-9_5"},{"key":"7_CR7","doi-asserted-by":"publisher","unstructured":"Cousot, P., Halbwachs, N.: Automatic discovery of linear restraints among variables of a program. In: Proceedings of the Fifth ACM Symposium on Principles of Programming Languages, pp. 84\u201397. ACM Press (1978). https:\/\/doi.org\/10.1145\/512760.512770","DOI":"10.1145\/512760.512770"},{"key":"7_CR8","doi-asserted-by":"publisher","unstructured":"F\u00e4hndrich, M., Logozzo, F.: Static contract checking with abstract interpretation. In: Beckert, B., March\u00e9, C. (eds.) Formal Verification of Object-Oriented Software. LNCS, vol. 6528, pp. 10\u201330. Springer (2011). https:\/\/doi.org\/10.1007\/978-3-642-18070-5_2","DOI":"10.1007\/978-3-642-18070-5_2"},{"key":"7_CR9","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0167-6423(97)00034-8","volume":"32","author":"R Giacobazzi","year":"1998","unstructured":"Giacobazzi, R., Ranzato, F.: Optimal domains for disjunctive abstract interpretation. Sci. Comput. Prog. 32, 177\u2013210 (1998). https:\/\/doi.org\/10.1016\/S0167-6423(97)00034-8","journal-title":"Sci. Comput. Prog."},{"key":"7_CR10","doi-asserted-by":"publisher","unstructured":"Groote, J.F., van de Pol, J.: Equational binary decision diagrams. In: Parigot, M., Voronkov, A. (eds.) Logic for Programming and Automated Reasoning, LNCS, vol. 1955, pp. 161\u2013178. Springer (2000). https:\/\/doi.org\/10.1007\/3-540-44404-1_11","DOI":"10.1007\/3-540-44404-1_11"},{"key":"7_CR11","doi-asserted-by":"publisher","unstructured":"Gurfinkel, A., Chaki, S.: Boxes: A symbolic abstract domain of boxes. In: Cousot, R., Martel, M. (eds.) Static Analysis: Proceedings of the 17th International Symposium, LNCS, vol. 6337, pp. 287\u2013303. Springer (2010). https:\/\/doi.org\/10.1007\/978-3-642-15769-1_18","DOI":"10.1007\/978-3-642-15769-1_18"},{"key":"7_CR12","doi-asserted-by":"publisher","unstructured":"Handjieva, M., Tzolovski, S.: Refining static analyses by trace-based partitioning using control flow. In: Levi, G. (ed.) Static Analysis, LNCS, vol. 1503, pp. 200\u2013214. Springer (1998). https:\/\/doi.org\/10.1007\/3-540-49727-7_12","DOI":"10.1007\/3-540-49727-7_12"},{"key":"7_CR13","unstructured":"Jeannet, B.: The BddApron logico-numerical abstract domains library (2009). http:\/\/www.inrialpes.fr\/pop-art\/people\/bjeannet\/bjeannet-forge\/bddapron\/"},{"key":"7_CR14","doi-asserted-by":"publisher","unstructured":"Jeannet, B., Min\u00e9, A.: A library of numerical abstract domains for static analysis. In: Bouajjani, A., Maler, O. (eds.) Computer Aided Verification, LNCS, vol. 5643, pp. 661\u2013667. Springer (2009). https:\/\/doi.org\/10.1007\/978-3-642-02658-4_52","DOI":"10.1007\/978-3-642-02658-4_52"},{"key":"7_CR15","doi-asserted-by":"publisher","unstructured":"Jensen, T.P.: Disjunctive strictness analysis. In: Proceedings of the 7th Annual IEEE Symposium of Logic in Computer Science, pp. 174\u2013185. IEEE Computer Society (1992). https:\/\/doi.org\/10.1109\/LICS.1992.185531","DOI":"10.1109\/LICS.1992.185531"},{"issue":"3","key":"7_CR16","first-page":"271","volume":"6","author":"KG Larsen","year":"1999","unstructured":"Larsen, K.G., Pearson, J., Weise, C., Yi, W.: Clock difference diagrams. Nordic J. Comput. 6(3), 271\u2013298 (1999)","journal-title":"Nordic J. Comput."},{"issue":"1\u20134","key":"7_CR17","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1145\/176454.176519","volume":"2","author":"K Marriott","year":"1993","unstructured":"Marriott, K., S\u00f8ndergaard, H.: Precise and efficient groundless analysis for logic programs. ACM Lett. Prog. Lang. Syst. 2(1\u20134), 181\u2013196 (1993). https:\/\/doi.org\/10.1145\/176454.176519","journal-title":"ACM Lett. Prog. Lang. Syst."},{"issue":"1","key":"7_CR18","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/s0167-6423(96)00042-1","volume":"31","author":"L Mauborgne","year":"1998","unstructured":"Mauborgne, L.: Abstract interpretation using typed decision graphs. Sci. Comput. Prog. 31(1), 91\u2013112 (1998). https:\/\/doi.org\/10.1016\/s0167-6423(96)00042-1","journal-title":"Sci. Comput. Prog."},{"key":"7_CR19","doi-asserted-by":"publisher","unstructured":"Mauborgne, L., Rival, X.: Trace partitioning in abstract interpretation based static analyzers. In: Sagiv, M. (ed.) Programming Languages and Systems: Proceedings of the 14th European Symposium, LNCS, vol. 3444, pp. 5\u201320. Springer (2005). https:\/\/doi.org\/10.1007\/978-3-540-31987-0_2","DOI":"10.1007\/978-3-540-31987-0_2"},{"key":"7_CR20","doi-asserted-by":"publisher","unstructured":"Min\u00e9, A.: A new numerical abstract domain based on difference-bound matrices. In: Danvy, O., Filinski, A. (eds.) Programs as Data Objects, LNCS, vol. 2053, pp. 155\u2013172. Springer (2001). https:\/\/doi.org\/10.1007\/3-540-44978-7_10","DOI":"10.1007\/3-540-44978-7_10"},{"key":"7_CR21","doi-asserted-by":"publisher","unstructured":"Min\u00e9, A.: The Octagon abstract domain. In: Burd, E., Aiken, P., Koschke, R. (eds.) Proceedings of the Eighth Working Conference on Reverse Engineering, pp. 310\u2013319. IEEE Computer Society (2001). https:\/\/doi.org\/10.1109\/WCRE.2001.957836","DOI":"10.1109\/WCRE.2001.957836"},{"key":"7_CR22","doi-asserted-by":"publisher","unstructured":"Min\u00e9, A.: Symbolic methods to enhance the precision of numerical abstract domains. In: Emerson, E.A., Namjoshi, K.S. (eds.) Verification, Model Checking, and Abstract Interpretation, LNCS, vol. 3855, pp. 348\u2013363. Springer (2006). https:\/\/doi.org\/10.1007\/11609773_23","DOI":"10.1007\/11609773_23"},{"key":"7_CR23","doi-asserted-by":"publisher","unstructured":"M\u00f8ller, J., Lichtenberg, J., Andersen, H.R., Hulgaard, H.: Difference decision diagrams. In: Flum, J., Rodriguez-Artalejo, M. (eds.) Computer Science Logic, LNCS, vol. 1683, pp. 111\u2013125. Springer (1999). https:\/\/doi.org\/10.1007\/3-540-48168-0_9","DOI":"10.1007\/3-540-48168-0_9"},{"key":"7_CR24","doi-asserted-by":"publisher","unstructured":"Srinivasan, A., Kam, T., Malik, S., Brayton, R.K.: Algorithms for discrete function manipulation. In: Computer-Aided Design: Proceedings of the IEEE International Conference, pp. 92\u201395. IEEE Computer Society (1990). https:\/\/doi.org\/10.1109\/ICCAD.1990.129849","DOI":"10.1109\/ICCAD.1990.129849"},{"key":"7_CR25","doi-asserted-by":"publisher","unstructured":"Strehl, K., Thiele, L.: Symbolic model checking of process networks using interval diagram techniques. In: International Conference on Computer-Aided Design, pp. 686\u2013692. ACM Press (1998). https:\/\/doi.org\/10.1145\/288548.289117","DOI":"10.1145\/288548.289117"},{"key":"7_CR26","doi-asserted-by":"publisher","unstructured":"Urban, C., Min\u00e9, A.: A decision tree abstract domain for proving conditional termination. In: M\u00fcller-Olm, M., Seidl, H. (eds.) Static Analysis, LNCS, vol. 8723, pp. 302\u2013318. Springer (2014). https:\/\/doi.org\/10.1007\/978-3-319-10936-7_19","DOI":"10.1007\/978-3-319-10936-7_19"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-88806-0_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,13]],"date-time":"2021-10-13T17:28:39Z","timestamp":1634146119000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-88806-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030888053","9783030888060"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-88806-0_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"13 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Static Analysis Symposium","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chicago, IL","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sas2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/staticanalysis.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"40","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":"18","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":"4","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":"45% - 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)"}}]}}