{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T02:02:02Z","timestamp":1743127322874,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030549961"},{"type":"electronic","value":"9783030549978"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-54997-8_8","type":"book-chapter","created":{"date-parts":[[2020,8,10]],"date-time":"2020-08-10T20:11:50Z","timestamp":1597090310000},"page":"119-135","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Combination of Boxes and Polyhedra Abstractions for Constraint Solving"],"prefix":"10.1007","author":[{"given":"Ghiles","family":"Ziat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexandre","family":"Mar\u00e9chal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marie","family":"Pelleau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antoine","family":"Min\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Charlotte","family":"Truchet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,8,11]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/S0304-3975(99)00032-8","volume":"221","author":"KR Apt","year":"1999","unstructured":"Apt, K.R.: The essence of constraint propagation. Theor. Comput. Sci. 221, 179\u2013210 (1999)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/3-540-61735-3_4","volume-title":"Algebraic and Logic Programming","author":"F Benhamou","year":"1996","unstructured":"Benhamou, F.: Heterogeneous constraint solving. In: Hanus, M., Rodr\u00edguez-Artalejo, M. (eds.) ALP 1996. LNCS, vol. 1139, pp. 62\u201376. Springer, Heidelberg (1996). \nhttps:\/\/doi.org\/10.1007\/3-540-61735-3_4"},{"key":"8_CR3","unstructured":"Benhamou, F., Goualard, F., Granvilliers, L., Puget, J.-F.: Revisiting hull and box consistency. In: Proceedings of the 16th International Conference on Logic Programming, pp. 230\u2013244 (1999)"},{"issue":"1","key":"8_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0743-1066(96)00142-2","volume":"32","author":"F Benhamou","year":"1997","unstructured":"Benhamou, F., Older, W.J.: Applying interval arithmetic to real, integer and boolean constraints. J. Logic Programm. 32(1), 1\u201324 (1997)","journal-title":"J. Logic Programm."},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"1079","DOI":"10.1016\/j.artint.2009.03.002","volume":"173","author":"G Chabert","year":"2009","unstructured":"Chabert, G., Jaulin, L.: Contractor programming. Artif. Intell. 173, 1079\u20131100 (2009)","journal-title":"Artif. Intell."},{"key":"8_CR6","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: Conference Record of the Fourth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 238\u2013252 (1977)","DOI":"10.1145\/512950.512973"},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1007\/978-3-642-19805-2_31","volume-title":"Foundations of Software Science and Computational Structures","author":"P Cousot","year":"2011","unstructured":"Cousot, P., Cousot, R., Mauborgne, L.: The reduced product of abstract domains and the combination of decision procedures. In: Hofmann, M. (ed.) FoSSaCS 2011. LNCS, vol. 6604, pp. 456\u2013472. Springer, Heidelberg (2011). \nhttps:\/\/doi.org\/10.1007\/978-3-642-19805-2_31"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Cousot, P., Halbwachs, N.: Automatic discovery of linear restraints among variables of a program. In: Proceedings of the 5th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, pp. 84\u201396 (1978)","DOI":"10.1145\/512760.512770"},{"issue":"1","key":"8_CR9","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1145\/103162.103163","volume":"23","author":"D Goldberg","year":"1991","unstructured":"Goldberg, D.: What every computer scientist should know about floating point arithmetic. ACM Comput. Surv. 23(1), 5\u201348 (1991)","journal-title":"ACM Comput. Surv."},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/11823230_3","volume-title":"Static Analysis","author":"E Goubault","year":"2006","unstructured":"Goubault, E., Putot, S.: Static analysis of numerical algorithms. In: Yi, K. (ed.) SAS 2006. LNCS, vol. 4134, pp. 18\u201334. Springer, Heidelberg (2006). \nhttps:\/\/doi.org\/10.1007\/11823230_3"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1007\/978-3-642-02658-4_52","volume-title":"Computer Aided Verification","author":"B Jeannet","year":"2009","unstructured":"Jeannet, B., Min\u00e9, A.: Apron: a library of numerical abstract domains for static analysis. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 661\u2013667. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-02658-4_52"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-662-49122-5_8","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"A Mar\u00e9chal","year":"2016","unstructured":"Mar\u00e9chal, A., Fouilh\u00e9, A., King, T., Monniaux, D., P\u00e9rin, M.: Polyhedral approximation of multivariate polynomials using Handelman\u2019s theorem. In: Jobstmann, B., Leino, K.R.M. (eds.) VMCAI 2016. LNCS, vol. 9583, pp. 166\u2013184. Springer, Heidelberg (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-662-49122-5_8"},{"key":"8_CR13","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). \nhttps:\/\/doi.org\/10.1007\/3-540-44978-7_10"},{"key":"8_CR14","unstructured":"Min\u00e9, A.: Domaines num\u00e9riques abstraits faiblement relationnels. Ph.D thesis, \u00c9cole Normale Sup\u00e9rieure, December 2004"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Min\u00e9, A.: Symbolic methods to enhance the precision of numerical abstract domains. In: 7th International Conference on Verification, Model Checking, and Abstract Interpretation (2006)","DOI":"10.1007\/11609773_23"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1007\/978-3-642-35873-9_26","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"M Pelleau","year":"2013","unstructured":"Pelleau, M., Min\u00e9, A., Truchet, C., Benhamou, F.: A constraint solver based on abstract domains. In: Giacobazzi, R., Berdine, J., Mastroeni, I. (eds.) VMCAI 2013. LNCS, vol. 7737, pp. 434\u2013454. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-35873-9_26"},{"issue":"3","key":"8_CR17","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/s10601-014-9162-x","volume":"19","author":"M Pelleau","year":"2014","unstructured":"Pelleau, M., Truchet, C., Benhamou, F.: The octagon abstract domain for continuous constraints. Constraints 19(3), 309\u2013337 (2014)","journal-title":"Constraints"},{"key":"8_CR18","unstructured":"Puget, J.-F.: A fast algorithm for the bound consistency of alldiff constraints. In: Proceedings of the 15th National\/10th Conference on Artificial Intelligence\/Innovative Applications of Artificial Intelligence (AAAI 1998\/IAAI 1998), pp. 359\u2013366. American Association for Artificial Intelligence (1998)"},{"issue":"5","key":"8_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1275497.1275501","volume":"29","author":"X Rival","year":"2007","unstructured":"Rival, X., Mauborgne, L.: The trace partitioning abstract domain. ACM Trans. Program. Lang. Syst. (TOPLAS) 29(5), 1\u201344 (2007)","journal-title":"ACM Trans. Program. Lang. Syst. (TOPLAS)"},{"key":"8_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1007\/978-3-642-04244-7_56","volume-title":"Principles and Practice of Constraint Programming - CP 2009","author":"C Schulte","year":"2009","unstructured":"Schulte, C., Tack, G.: Weakly monotonic propagators. In: Gent, I.P. (ed.) CP 2009. LNCS, vol. 5732, pp. 723\u2013730. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-04244-7_56"},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"Scott, J.: Other things besides number: abstraction, constraint propagation, and string variables. Ph.D thesis, University of Uppsala (2016)","DOI":"10.1007\/s10601-016-9263-9"},{"key":"8_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/978-3-540-39901-8_16","volume-title":"Global Optimization and Constraint Satisfaction","author":"O Shcherbina","year":"2003","unstructured":"Shcherbina, O., Neumaier, A., Sam-Haroud, D., Vu, X.-H., Nguyen, T.-V.: Benchmarking global optimization and constraint satisfaction codes. In: Bliek, C., Jermann, C., Neumaier, A. (eds.) COCOS 2002. LNCS, vol. 2861, pp. 211\u2013222. Springer, Heidelberg (2003). \nhttps:\/\/doi.org\/10.1007\/978-3-540-39901-8_16"},{"key":"8_CR23","unstructured":"van Hentenryck, P., Yip, J., Gervet, C., Dooms, G.: Bound consistency for binary length-lex set constraints. In: Proceedings of the 23rd National Conference on Artificial Intelligence (AAAI 2008), pp. 375\u2013380. AAAI Press (2008)"}],"container-title":["Lecture Notes in Computer Science","Formal Methods. FM 2019 International Workshops"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-54997-8_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,10]],"date-time":"2020-08-10T20:15:41Z","timestamp":1597090541000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-54997-8_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030549961","9783030549978"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-54997-8_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"11 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Formal Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Porto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fm2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/formalmethods2019.inesctec.pt\/?page_id=84","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":"129","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":"44","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":"7","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":"34% - 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":"4","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":"5,5","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)"}}]}}