{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T10:47:06Z","timestamp":1743072426063,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030636173"},{"type":"electronic","value":"9783030636180"}],"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-63618-0_14","type":"book-chapter","created":{"date-parts":[[2020,12,5]],"date-time":"2020-12-05T08:04:14Z","timestamp":1607155454000},"page":"221-238","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Combining Zonotope Abstraction and Constraint Programming for Synthesizing Inductive Invariants"],"prefix":"10.1007","author":[{"given":"Bibek","family":"Kabi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eric","family":"Goubault","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antoine","family":"Min\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sylvie","family":"Putot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,12,6]]},"reference":[{"key":"14_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1007\/978-3-662-49498-1_22","volume-title":"Programming Languages and Systems","author":"A Min\u00e9","year":"2016","unstructured":"Min\u00e9, A., Breck, J., Reps, T.: An algorithm inspired by constraint solvers to infer inductive invariants in numeric programs. In: Thiemann, P. (ed.) ESOP 2016. LNCS, vol. 9632, pp. 560\u2013588. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49498-1_22"},{"issue":"3","key":"14_CR2","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/s10703-015-0238-z","volume":"47","author":"E Goubault","year":"2016","unstructured":"Goubault, E., Putot, S.: A Zonotopic framework for functional abstractions. Formal Methods Syst. Des. 47(3), 302\u2013360 (2016). https:\/\/doi.org\/10.1007\/s10703-015-0238-z","journal-title":"Formal Methods Syst. Des."},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-319-08867-9_5","volume-title":"Computer Aided Verification","author":"P Garg","year":"2014","unstructured":"Garg, P., L\u00f6ding, C., Madhusudan, P., Neider, D.: ICE:\u00a0a\u00a0robust\u00a0framework\u00a0for\u00a0learning\u00a0invariants. In: Biere, A., Bloem, R. (eds.) CAV 2014. LNCS, vol. 8559, pp. 69\u201387. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08867-9_5"},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.entcs.2015.02.003","volume":"311","author":"A Thakur","year":"2015","unstructured":"Thakur, A., Lal, A., Lim, J., Reps, T.: PostHat and all that: automating abstract interpretation. Electron. Notes Theoret. Comput. Sci. 311, 15\u201332 (2015)","journal-title":"Electron. Notes Theoret. Comput. Sci."},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1007\/978-3-642-02658-4_47","volume-title":"Computer Aided Verification","author":"K Ghorbal","year":"2009","unstructured":"Ghorbal, K., Goubault, E., Putot, S.: The Zonotope abstract domain Taylor1+. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 627\u2013633. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02658-4_47"},{"key":"14_CR6","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). https:\/\/doi.org\/10.1007\/978-3-642-02658-4_52"},{"key":"14_CR7","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: Proceedings of POPL, pp. 238\u2013252. ACM (1977)","DOI":"10.1145\/512950.512973"},{"key":"14_CR8","unstructured":"Stolfi, J., De Figueiredo, L.H.: Self-validated numerical methods and applications. In: Monograph for 21st Brazilian Mathematics Colloquium, IMPA (1997)"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Le, V.T.H., Stoica, C., Alamo, T., Camacho, E.F., Dumur, D.: Zonotope-based set-membership estimation for multi-output uncertain systems. In: IEEE International Symposium on Intelligent Control (ISIC), pp. 212\u2013217. IEEE (2013)","DOI":"10.1109\/ISIC.2013.6658619"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Tabatabaeipour, S.M., Stoustrup, J.: Set-membership state estimation for discrete time piecewise affine systems using Zonotopes. In: European Control Conference (ECC), pp. 3143\u20133148. IEEE (2013)","DOI":"10.23919\/ECC.2013.6669529"},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-540-78929-1_16","volume-title":"Hybrid Systems: Computation and Control","author":"A Girard","year":"2008","unstructured":"Girard, A., Le Guernic, C.: Zonotope\/hyperplane intersection for hybrid systems reachability analysis. In: Egerstedt, M., Mishra, B. (eds.) HSCC 2008. LNCS, vol. 4981, pp. 215\u2013228. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78929-1_16"},{"issue":"2","key":"14_CR12","doi-asserted-by":"publisher","first-page":"7314","DOI":"10.3182\/20080706-5-KR-1001.01237","volume":"41","author":"C Combastel","year":"2008","unstructured":"Combastel, C., Zhang, Q., Lalami, A.: Fault diagnosis based on the enclosure of parameters estimated with an adaptive observer. IFAC Proc. Volumes 41(2), 7314\u20137319 (2008)","journal-title":"IFAC Proc. Volumes"},{"key":"14_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/978-3-642-14295-6_22","volume-title":"Computer Aided Verification","author":"K Ghorbal","year":"2010","unstructured":"Ghorbal, K., Goubault, E., Putot, S.: A logical product approach to Zonotope intersection. In: Touili, T., Cook, B., Jackson, P. (eds.) CAV 2010. LNCS, vol. 6174, pp. 212\u2013226. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14295-6_22"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Althoff, M., Krogh, B.H.: Zonotope bundles for the efficient computation of reachable sets. In: 50th IEEE Conference on Decision and Control and European Control Conference, pp. 6814\u20136821. IEEE (2011)","DOI":"10.1109\/CDC.2011.6160872"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Dreossi, T., Dang, T., Piazza, C.: Parallelotope bundles for polynomial reachability. In: Proceedings of the 19th International Conference on Hybrid Systems: Computation and Control, pp. 297\u2013306. ACM (2016)","DOI":"10.1145\/2883817.2883838"},{"key":"14_CR16","unstructured":"Guibas, L.J., Nguyen, A., Zhang, L.: Zonotopes as bounding volumes. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, pp. 803\u2013812 (2003)"},{"key":"14_CR17","unstructured":"Bailey, G.D.: Tilings of Zonotopes: Discriminantal Arrangements. University of Minnesota, Oriented Matroids and Enumeration (1997)"},{"key":"14_CR18","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1090\/conm\/178\/01902","volume":"178","author":"J Richter-Gebert","year":"1994","unstructured":"Richter-Gebert, J., Ziegler, G.M.: Zonotopal tilings and the Bohne-Dress theorem. Contemp. Math. 178, 211 (1994)","journal-title":"Contemp. Math."},{"issue":"1","key":"14_CR19","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.ejor.2003.04.011","volume":"166","author":"JA Ferrez","year":"2005","unstructured":"Ferrez, J.A., Fukuda, K., Liebling, T.M.: Solving the fixed rank convex quadratic maximization in binary variables by a parallel Zonotope construction algorithm. Eur. J. Oper. Res. 166(1), 35\u201350 (2005)","journal-title":"Eur. J. Oper. Res."},{"key":"14_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-642-11957-6_3","volume-title":"Programming Languages and Systems","author":"A Adj\u00e9","year":"2010","unstructured":"Adj\u00e9, A., Gaubert, S., Goubault, E.: Coupling policy iteration with semi-definite relaxation to compute accurate numerical invariants in static analysis. In: Gordon, A.D. (ed.) ESOP 2010. LNCS, vol. 6012, pp. 23\u201342. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11957-6_3"},{"issue":"2","key":"14_CR21","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s10703-015-0230-7","volume":"46","author":"P Roux","year":"2015","unstructured":"Roux, P., Garoche, P.-L.: Practical policy iterations. Formal Methods Syst. Des. 46(2), 163\u2013196 (2015). https:\/\/doi.org\/10.1007\/s10703-015-0230-7","journal-title":"Formal Methods Syst. Des."},{"key":"14_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/978-3-642-28756-5_5","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"V D\u2019Silva","year":"2012","unstructured":"D\u2019Silva, V., Haller, L., Kroening, D., Tautschnig, M.: Numeric bounds analysis with conflict-driven learning. In: Flanagan, C., K\u00f6nig, B. (eds.) TACAS 2012. LNCS, vol. 7214, pp. 48\u201363. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28756-5_5"}],"container-title":["Lecture Notes in Computer Science","Software Verification"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-63618-0_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T00:44:03Z","timestamp":1619225043000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-63618-0_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030636173","9783030636180"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-63618-0_14","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":"6 December 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NSV","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Numerical Software Verification","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Los Angeles, 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":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 July 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"nsv2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/nsv2020.github.io\/","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":"14","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":"9","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":"64% - 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":"2","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)"}},{"value":"Due to COVID-19 pandemic the conference was held virtually","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}