{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T01:40:01Z","timestamp":1750556401385,"version":"3.41.0"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319633893"},{"type":"electronic","value":"9783319633909"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-63390-9_13","type":"book-chapter","created":{"date-parts":[[2017,7,12]],"date-time":"2017-07-12T08:53:50Z","timestamp":1499849630000},"page":"238-258","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Towards Verifying Nonlinear Integer Arithmetic"],"prefix":"10.1007","author":[{"given":"Paul","family":"Beame","sequence":"first","affiliation":[]},{"given":"Vincent","family":"Liew","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,7,13]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Alekhnovich, M., Razborov, A.A.: Satisfiability, branch-width and Tseitin tautologies. In: Proceedings of 43rd Symposium on Foundations of Computer Science (FOCS 2002), Vancouver, BC, Canada, pp. 593\u2013603. IEEE Computer Society, November 2002","DOI":"10.1109\/SFCS.2002.1181983"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Andersson, G., Bjesse, P., Cook, B., Hanna, Z.: A proof engine approach to solving combinational design automation problems. In: Proceedings of the 39th Design Automation Conference, DAC 2002, New Orleans, LA, USA, pp. 725\u2013730. ACM, June 2002","DOI":"10.1145\/513918.514101"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Andrade, F.V., Oliveira, M.C.M., Fernandes, A.O., Coelho Jr., C.J.N.: SAT-based equivalence checking based on circuit partitioning and special approaches for conflict clause reuse. In: Girard, P., Krasniewski, A., Gramatov\u00e1, E., Pawlak, A., Garbolino, T. (eds.) Proceedings of the 10th IEEE Workshop on Design & Diagnostics of Electronic Circuits & Systems (DDECS 2007), Krak\u00f3w, Poland, pp. 397\u2013402. IEEE Computer Society, April 2007","DOI":"10.1109\/DDECS.2007.4295319"},{"key":"13_CR4","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1613\/jair.1410","volume":"22","author":"P Beame","year":"2004","unstructured":"Beame, P., Kautz, H.A., Sabharwal, A.: Towards understanding and harnessing the potential of clause learning. J. Artif. Intell. Res. (JAIR) 22, 319\u2013351 (2004)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Beame, P., Liew, V.: Towards verifying nonlinear integer arithmetic. CoRR, abs\/1705.04302 (2017)","DOI":"10.1007\/978-3-319-63390-9_13"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Biere, A.: Challenges in bit-precise reasoning. In: Formal Methods in Computer-Aided Design, FMCAD 2014, Lausanne, Switzerland, p. 3, October 2014","DOI":"10.1109\/FMCAD.2014.6987584"},{"key":"13_CR7","unstructured":"Biere, A.: Where does SAT not work? In: BIRS Workshop on Theory and Applications of Applied SAT Solving, January 2014. http:\/\/www.birs.ca\/events\/2014\/5-day-workshops\/14w5101\/videos\/watch\/201401201634-Biere.html"},{"key":"13_CR8","unstructured":"Biere, A.: Collection of combinational arithmetic miters submitted to the SAT competition 2016. In: Balyo, T., Heule, M., J\u00e4rvisalo, M. (eds.) Proceedings of SAT Competition 2016 - Solver and Benchmark Descriptions, volume B-2016-1 of Department of Computer Science Series of Publications B, pp. 65\u201366. University of Helsinki (2016)"},{"key":"13_CR9","unstructured":"Biere, A.: Weaknesses of CDCL solvers. In: Fields Institute Workshop on Theoretical Foundations of SAT Solving, August 2016. http:\/\/www.fields.utoronto.ca\/talks\/weaknesses-cdcl-solvers"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Bollig, B., Wooelfel, P.: A read-once branching program lower bound of $$\\varOmega (2^{n\/4})$$ for integer multiplication using universal hashing. In: Proceedings of the Thirty-Third Annual ACM Symposium on the Theory of Computing, Hersonissos, Crete, Greece, pp. 419\u2013424, July 2001","DOI":"10.1145\/380752.380835"},{"issue":"3","key":"13_CR11","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/j.ic.2010.11.007","volume":"209","author":"B Bollig","year":"2011","unstructured":"Bollig, B.: Larger lower bounds on the OBDD complexity of integer multiplication. Inf. Comput. 209(3), 333\u2013343 (2011)","journal-title":"Inf. Comput."},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Brinkmann, R., Drechsler, R.: RTL-datapath verification using integer linear programming. In: Proceedings of the ASPDAC 2002\/VLSI Design 2002, Bangalore, India, pp. 741\u2013746, January 2002","DOI":"10.1109\/ASPDAC.2002.995022"},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-642-00768-2_16","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"R Brummayer","year":"2009","unstructured":"Brummayer, R., Biere, A.: Boolector: an efficient SMT solver for bit-vectors and arrays. In: Kowalewski, S., Philippou, A. (eds.) TACAS 2009. LNCS, vol. 5505, pp. 174\u2013177. Springer, Heidelberg (2009). doi:10.1007\/978-3-642-00768-2_16"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Bruttomesso, R., Cimatti, A., Franz\u00e9n, A., Griggio, A., Hanna, Z., Nadel, A., Palti, A., Sebastiani, R.: A lazy and layered SMT($$\\cal{BV}$$) solver for hard industrial verification problems. In: Proceedings, Computer Aided Verification, 19th International Conference, CAV 2007, Berlin, Germany, pp. 547\u2013560, July 2007","DOI":"10.1007\/978-3-540-73368-3_54"},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Bruttomesso, R., Cimatti, A., Franz\u00e9n, A., Griggio, A., Sebastiani. R.: The MathSAT 4 SMT solver. In: Proceedings, Computer Aided Verification, 20th International Conference, CAV 2008, pp. 299\u2013303 (2008)","DOI":"10.1007\/978-3-540-70545-1_28"},{"issue":"8","key":"13_CR16","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"35","author":"RE Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comput. 35(8), 677\u2013691 (1986)","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"13_CR17","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1109\/12.73590","volume":"40","author":"RE Bryant","year":"1991","unstructured":"Bryant, R.E.: On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication. IEEE Trans. Comput. 40(2), 205\u2013213 (1991)","journal-title":"IEEE Trans. Comput."},{"issue":"4","key":"13_CR18","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1109\/43.275352","volume":"13","author":"JR Burch","year":"1994","unstructured":"Burch, J.R., Clarke, E.M., Long, D.E., McMillan, K.L., Dill, D.L.: Symbolic model checking for sequential circuit verification. IEEE Trans. Comput.-Aided Des. Integr. Circ. 13(4), 401\u2013424 (1994)","journal-title":"IEEE Trans. Comput.-Aided Des. Integr. Circ."},{"key":"13_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/978-3-642-31612-8_5","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2012","author":"ML Bonet","year":"2012","unstructured":"Bonet, M.L., Buss, S.: An improved separation of regular resolution from pool resolution and clause learning. In: Cimatti, A., Sebastiani, R. (eds.) SAT 2012. LNCS, vol. 7317, pp. 44\u201357. Springer, Heidelberg (2012). doi:10.1007\/978-3-642-31612-8_5"},{"issue":"4:13","key":"13_CR20","first-page":"1","volume":"4","author":"SR Buss","year":"2008","unstructured":"Buss, S.R., Hoffmann, J., Johannsen, J.: Resolution trees with lemmas: resolution refinements that characterize DLL algorithms with clause learning. Log. Methods Comput. Sci. 4(4:13), 1\u201328 (2008)","journal-title":"Log. Methods Comput. Sci."},{"issue":"2:16","key":"13_CR21","first-page":"1","volume":"10","author":"SR Buss","year":"2014","unstructured":"Buss, S.R., Kolodziejczyk, L.: Small stone in pool. Log. Methods Comput. Sci. 10(2:16), 1\u201322 (2014)","journal-title":"Log. Methods Comput. Sci."},{"key":"13_CR22","first-page":"201","volume":"7","author":"M Davis","year":"1960","unstructured":"Davis, M., Putnam, H.: A computing procedure for quantification theory. Commun. ACM 7, 201\u2013215 (1960)","journal-title":"Commun. ACM"},{"issue":"7","key":"13_CR23","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1145\/368273.368557","volume":"5","author":"M Davis","year":"1962","unstructured":"Davis, M., Logemann, G., Loveland, D.: A machine program for theorem-proving. Commun. ACM 5(7), 394\u2013397 (1962)","journal-title":"Commun. ACM"},{"key":"13_CR24","unstructured":"de Moura, L.M.: System description: Yices 0.1. Technical report, Computer Science Laboratory, SRI International (2005)"},{"key":"13_CR25","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 Moura","year":"2008","unstructured":"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). doi:10.1007\/978-3-540-78800-3_24"},{"key":"13_CR26","unstructured":"Dechter, R.: Bucket elimination: a unifying framework for probabilistic inference. In: Horvitz, E., Jensen, F.V. (eds.) UAI 1996: Proceedings of the Twelfth Annual Conference on Uncertainty in Artificial Intelligence, Portland, OR, USA, pp. 211\u2013219. Morgan Kaufmann, August 1996"},{"key":"13_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/978-3-540-73368-3_52","volume-title":"Computer Aided Verification","author":"V Ganesh","year":"2007","unstructured":"Ganesh, V., Dill, D.L.: A decision procedure for bit-vectors and arrays. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol. 4590, pp. 519\u2013531. Springer, Heidelberg (2007). doi:10.1007\/978-3-540-73368-3_52"},{"key":"13_CR28","unstructured":"Hirsch, E., Itsykson, D., Kojevnikov, A., Kulikov, A., Nikolenko, S.: Report on the mixed Boolean-algebraic solver. Technical report, Laboratory of Mathematical Logic of St. Petersburg Department of Steklov Institute of Mathematics (2005)"},{"key":"13_CR29","doi-asserted-by":"crossref","unstructured":"Kalla, P.: Formal verification of arithmetic datapaths using algebraic geometry and symbolic computation. In: Proceedings, Formal Methods in Computer-Aided Design, FMCAD, p. 2. Austin, TX, September 2015","DOI":"10.1109\/FMCAD.2015.7542240"},{"issue":"2","key":"13_CR30","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/s00224-015-9653-1","volume":"59","author":"G Kov\u00e1sznai","year":"2016","unstructured":"Kov\u00e1sznai, G., Fr\u00f6hlich, A., Biere, A.: Complexity of fixed-size bit-vector logics. Theory Comput. Syst. 59(2), 323\u2013376 (2016)","journal-title":"Theory Comput. Syst."},{"key":"13_CR31","volume-title":"Bounded Arithmetic, Propositional Logic and Complexity Theory","author":"J Kraj\u00ed\u010dek","year":"1996","unstructured":"Kraj\u00ed\u010dek, J.: Bounded Arithmetic, Propositional Logic and Complexity Theory. Cambridge University Press, Cambridge (1996)"},{"key":"13_CR32","volume-title":"Decision Procedures: An Algorithmic Point of View","author":"D Kroening","year":"2008","unstructured":"Kroening, D., Strichman, O.: Decision Procedures: An Algorithmic Point of View. Springer, Heidelberg (2008)"},{"key":"13_CR33","unstructured":"Marques-Silva, J.P., Lynce, I., Malik, S.: CDCL solvers. In: Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.) Handbook of Satisfiability, pp. 131\u2013154. IOS Press (2009). Chap. 4"},{"key":"13_CR34","unstructured":"Openssl.org. Openssl bug cve-2016-7055 (2016)"},{"key":"13_CR35","doi-asserted-by":"crossref","unstructured":"Parthasarathy, G., Iyer, M.L., Cheng, K.-T., Wang, L.-C.: An efficient finite-domain constraint solver for circuits. In: Proceedings of the 41st Design Automation Conference, DAC, pp. 212\u2013217 (2004)","DOI":"10.1145\/996566.996628"},{"key":"13_CR36","doi-asserted-by":"crossref","unstructured":"Ponzio, S.: A lower bound for integer multiplication with read-once branching programs. In: Proceedings of the Twenty-Seventh Annual ACM Symposium on the Theory of Computing, pp. 130\u2013139, Las Vegas, NV, May 1995","DOI":"10.1145\/225058.225098"},{"key":"13_CR37","doi-asserted-by":"crossref","unstructured":"Reda, S., Salem, A.: Combinational equivalence checking using Boolean satisfiability and binary decision diagrams. In: Nebel, W., Jerraya, A. (eds.) Proceedings of the Conference on Design, Automation and Test in Europe, DATE 2001, Munich, Germany, pp. 122\u2013126. IEEE Computer Society, March 2001","DOI":"10.1109\/DATE.2001.915011"},{"key":"13_CR38","doi-asserted-by":"crossref","unstructured":"Sauerhoff, M., Woelfel, P.: Time-space tradeoff lower bounds for integer multiplication and graphs of arithmetic functions. In: Proceedings of the Thirty-Fifth Annual ACM Symposium on the Theory of Computing, pp. 186\u2013195, San Diego, CA, June 2003","DOI":"10.1145\/780542.780571"},{"key":"13_CR39","doi-asserted-by":"crossref","unstructured":"Sayed-Ahmed, A.A.R., Gro\u00dfe, D., K\u00fchne, U., Soeken, M., Drechsler, R.: Formal verification of integer multipliers by combining Gr\u00f6bner basis with logic reduction. In: Fanucci, L., Teich, J. (eds.) 2016 Design, Automation & Test in Europe Conference & Exhibition, DATE 2016, pp. 1048\u20131053, Dresden, Germany. IEEE, March 2016","DOI":"10.3850\/9783981537079_0248"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-63390-9_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T01:08:10Z","timestamp":1750554490000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-63390-9_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319633893","9783319633909"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-63390-9_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"13 July 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CAV","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computer Aided Verification","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Heidelberg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 July 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 July 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cav2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cavconference.org\/2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}