{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T11:21:37Z","timestamp":1768908097151,"version":"3.49.0"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031199912","type":"print"},{"value":"9783031199929","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-19992-9_9","type":"book-chapter","created":{"date-parts":[[2022,10,22]],"date-time":"2022-10-22T09:12:06Z","timestamp":1666429926000},"page":"137-153","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Handling Polynomial and\u00a0Transcendental Functions in\u00a0SMT via\u00a0Unconstrained Optimisation and\u00a0Topological Degree Test"],"prefix":"10.1007","author":[{"given":"Alessandro","family":"Cimatti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alberto","family":"Griggio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Enrico","family":"Lipparini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Sebastiani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,10,21]]},"reference":[{"issue":"205","key":"9_CR1","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1090\/S0025-5718-1994-1203731-4","volume":"62","author":"O Aberth","year":"1994","unstructured":"Aberth, O.: Computation of topological degree using interval arithmetic, and applications. Math. Comput. 62(205), 171\u2013178 (1994)","journal-title":"Math. Comput."},{"key":"9_CR2","unstructured":"Barrett, C., Fontaine, P., Tinelli, C.: The Satisfiability Modulo Theories Library (SMT-LIB) (2016). www.SMT-LIB.org"},{"key":"9_CR3","unstructured":"Barrett, C., Sebastiani, R., Seshia, S.A., Tinelli, C.: Satisfiability Modulo Theories, chapter 26 (2009)"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Benhamou, F., Granvilliers, L.: Chapter 16 - continuous and interval constraints. In: Handbook of Constraint Programming (2006)","DOI":"10.1016\/S1574-6526(06)80020-9"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Brau\u00dfe, F., Korovin, K., Korovina, M.V., M\u00fcller, N.T.: The ksmt calculus is a $$\\delta $$-complete decision procedure for non-linear constraints. In: CADE (2021)","DOI":"10.1007\/978-3-030-79876-5_7"},{"key":"9_CR6","unstructured":"Barrett, C., et al.: CVC5 at the SMT Competition 2021 (2021)"},{"issue":"3","key":"9_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3230639","volume":"19","author":"A Cimatti","year":"2018","unstructured":"Cimatti, A., Griggio, A., Irfan, A., Roveri, M., Sebastiani, R.: Incremental linearization for satisfiability and verification modulo nonlinear arithmetic and transcendental functions. ACM Trans. Comput. Logic 19(3), 1\u201352 (2018)","journal-title":"ACM Trans. Comput. Logic"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-642-36742-7_7","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A Cimatti","year":"2013","unstructured":"Cimatti, A., Griggio, A., Schaafsma, B.J., Sebastiani, R.: The MathSAT5 SMT solver. In: Piterman, N., Smolka, S.A. (eds.) TACAS 2013. LNCS, vol. 7795, pp. 93\u2013107. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36742-7_7"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/3-540-07407-4_17","volume-title":"Automata Theory and Formal Languages","author":"GE Collins","year":"1975","unstructured":"Collins, G.E.: Quantifier elimination for real closed fields by cylindrical algebraic decompostion. In: Brakhage, H. (ed.) GI-Fachtagung 1975. LNCS, vol. 33, pp. 134\u2013183. Springer, Heidelberg (1975). https:\/\/doi.org\/10.1007\/3-540-07407-4_17"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/978-3-319-24318-4_26","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2015","author":"F Corzilius","year":"2015","unstructured":"Corzilius, F., Kremer, G., Junges, S., Schupp, S., \u00c1brah\u00e1m, E.: SMT-RAT: an open source C++ toolbox for strategic and parallel SMT solving. In: Heule, M., Weaver, S. (eds.) SAT 2015. LNCS, vol. 9340, pp. 360\u2013368. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-24318-4_26"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-78800-3_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L de Moura","year":"2008","unstructured":"de Moura, L., Bj\u00f8rner, N.: Z3: an efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337\u2013340. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78800-3_24"},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-35873-9_1","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"L de Moura","year":"2013","unstructured":"de Moura, L., Jovanovi\u0107, D.: A model-constructing satisfiability calculus. In: Giacobazzi, R., Berdine, J., Mastroeni, I. (eds.) VMCAI 2013. LNCS, vol. 7737, pp. 1\u201312. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-35873-9_1"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1007\/978-3-319-08867-9_49","volume-title":"Computer Aided Verification","author":"B Dutertre","year":"2014","unstructured":"Dutertre, B.: Yices\u00a02.2. In: Biere, A., Bloem, R. (eds.) CAV 2014. LNCS, vol. 8559, pp. 737\u2013744. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08867-9_49"},{"issue":"293","key":"9_CR14","doi-asserted-by":"publisher","first-page":"1265","DOI":"10.1090\/S0025-5718-2014-02877-9","volume":"84","author":"P Franek","year":"2015","unstructured":"Franek, P., Ratschan, S.: Effective topological degree computation based on interval arithmetic. Math. Comput. 84(293), 1265\u20131290 (2015)","journal-title":"Math. Comput."},{"issue":"2","key":"9_CR15","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/s10817-015-9351-3","volume":"57","author":"P Franek","year":"2015","unstructured":"Franek, P., Ratschan, S., Zgliczynski, P.: Quasi-decidability of a fragment of the first-order theory of real numbers. J. Autom. Reasoning 57(2), 157\u2013185 (2015). https:\/\/doi.org\/10.1007\/s10817-015-9351-3","journal-title":"J. Autom. Reasoning"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Fr\u00e4nzle, M., Herde, C., Teige, T., Ratschan, S., Schubert, T.: Efficient solving of large non-linear arithmetic constraint systems with complex boolean structure. JSAT (2007)","DOI":"10.3233\/SAT190012"},{"key":"9_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-319-41540-6_11","volume-title":"Computer Aided Verification","author":"Z Fu","year":"2016","unstructured":"Fu, Z., Su, Z.: XSat: a fast floating-point satisfiability solver. In: Chaudhuri, S., Farzan, A. (eds.) CAV 2016. LNCS, vol. 9780, pp. 187\u2013209. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-41540-6_11"},{"key":"9_CR18","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/978-3-642-31365-3_23","volume-title":"Automated Reasoning","author":"S Gao","year":"2012","unstructured":"Gao, S., Avigad, J., Clarke, E.M.: $$\\delta $$-complete decision procedures for satisfiability over the reals. In: Gramlich, B., Miller, D., Sattler, U. (eds.) IJCAR 2012. LNCS (LNAI), vol. 7364, pp. 286\u2013300. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31365-3_23"},{"key":"9_CR19","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-642-38574-2_14","volume-title":"Automated Deduction \u2013 CADE-24","author":"S Gao","year":"2013","unstructured":"Gao, S., Kong, S., Clarke, E.M.: dReal: an SMT solver for nonlinear theories over the reals. In: Bonacina, M.P. (ed.) CADE 2013. LNCS (LNAI), vol. 7898, pp. 208\u2013214. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38574-2_14"},{"issue":"3\/4","key":"9_CR20","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1145\/2429135.2429155","volume":"46","author":"D Jovanovi\u0107","year":"2013","unstructured":"Jovanovi\u0107, D., de Moura, L.: Solving non-linear arithmetic. ACM Commun. Comput. Algebra 46(3\/4), 104\u2013105 (2013)","journal-title":"ACM Commun. Comput. Algebra"},{"issue":"2","key":"9_CR21","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1080\/03610918.2013.777455","volume":"44","author":"DDL Minh","year":"2015","unstructured":"Minh, D.D.L., Minh, D.L.P.: Understanding the hastings algorithm. Commun. Stat. Simul. Comput. 44(2), 332\u2013349 (2015)","journal-title":"Commun. Stat. Simul. Comput."},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"Moore, R., Kearfott, R., Cloud, M.: Introduction to Interval Analysis (2009)","DOI":"10.1137\/1.9780898717716"},{"key":"9_CR23","doi-asserted-by":"crossref","unstructured":"Neumaier, A.: Interval Methods for Systems of Equations. Cambridge University Press (1991)","DOI":"10.1017\/CBO9780511526473"},{"key":"9_CR24","unstructured":"O\u2019Regan, D., Je, C.Y., Chen, Y.: Topological Degree Theory and Applications. Taylor and Francis (2006)"},{"issue":"1","key":"9_CR25","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s10703-013-0196-2","volume":"44","author":"S Ratschan","year":"2013","unstructured":"Ratschan, S.: Safety verification of non-linear hybrid systems is quasi-decidable. Formal Meth. Syst. Des. 44(1), 71\u201390 (2013). https:\/\/doi.org\/10.1007\/s10703-013-0196-2","journal-title":"Formal Meth. Syst. Des."},{"issue":"4","key":"9_CR26","doi-asserted-by":"publisher","first-page":"514","DOI":"10.2307\/2271358","volume":"33","author":"D Richardson","year":"1968","unstructured":"Richardson, D.: Some undecidable problems involving elementary functions of a real variable. J. Symb. Log. 33(4), 514\u2013520 (1968)","journal-title":"J. Symb. Log."},{"key":"9_CR27","doi-asserted-by":"crossref","unstructured":"Xuan, T.V., Khanh, T., Ogawa, M.: rasat: an smt solver for polynomial constraints. Formal Meth. Syst. Des. 51, 12 (2017)","DOI":"10.1007\/s10703-017-0284-9"},{"key":"9_CR28","doi-asserted-by":"crossref","unstructured":"Wales, D.J., Doye, J.P.K.: Global optimization by basin-hopping and the lowest energy structures of lennard-jones clusters containing up to 110 atoms. J. Phys. Chem. A, (28) (1997)","DOI":"10.1021\/jp970984n"},{"key":"9_CR29","doi-asserted-by":"crossref","unstructured":"Zhang, L., Madigan, C.F., Moskewicz, M.H., Malik, S.: Efficient conflict driven learning in a boolean satisfiability solver. In: ICCAD (2001)","DOI":"10.1145\/774572.774637"},{"key":"9_CR30","doi-asserted-by":"publisher","first-page":"100633","DOI":"10.1016\/j.jlamp.2020.100633","volume":"119","author":"E \u00c1brah\u00e1m","year":"2020","unstructured":"\u00c1brah\u00e1m, E., Davenport, J., England, M., Kremer, G.: Deciding the consistency of non-linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings. J. Log. Algebraic Meth. Program. 119, 100633 (2020)","journal-title":"J. Log. Algebraic Meth. Program."}],"container-title":["Lecture Notes in Computer Science","Automated Technology for Verification and Analysis"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-19992-9_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,22]],"date-time":"2022-10-22T09:14:05Z","timestamp":1666430045000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-19992-9_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031199912","9783031199929"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-19992-9_9","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":"21 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ATVA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Automated Technology for Verification and Analysis","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"atva2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/atva-conference.org\/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":"81","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":"21","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":"5","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":"26% - 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":"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 the COVID-19 pandemic, the conference was held virtually. Additional to the 26 papers, 1 invited talk is included.","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)"}}]}}