{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T13:06:07Z","timestamp":1742994367519,"version":"3.40.3"},"publisher-location":"Cham","reference-count":43,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030234249"},{"type":"electronic","value":"9783030234256"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-23425-6_5","type":"book-chapter","created":{"date-parts":[[2019,6,25]],"date-time":"2019-06-25T14:05:11Z","timestamp":1561471511000},"page":"79-106","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Rectification of Arithmetic Circuits with Craig Interpolants in Finite Fields"],"prefix":"10.1007","author":[{"given":"Utkarsh","family":"Gupta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Irina","family":"Ilioaea","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vikas","family":"Rao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arpitha","family":"Srinath","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Priyank","family":"Kalla","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Florian","family":"Enescu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,6,26]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Ritirc, D., Biere, A., Kauers, M.: Column-wise verification of multipliers using computer algebra. In: Formal Methods in Computer-Aided Design (FMCAD), pp. 23\u201330 (2017)","DOI":"10.23919\/FMCAD.2017.8102237"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Ciesielski, M., Yu, C., Brown, W., Liu, D., Rossi, A.: Verification of gate-level arithmetic circuits by function extraction. In: 52nd ACM\/EDAC\/IEEE Design Automation Conference (DAC), pp. 1\u20136 (2015)","DOI":"10.1145\/2744769.2744925"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Sayed-Ahmed, A., Gro\u00dfe, D., K\u00fchne, U., Soeken, M., Drechsler, R.: Formal verification of integer multipliers by combining Gr\u00f6bner basis with logic reduction. In: Design, Automation Test in Europe Conference Exhibition (DATE), pp. 1048\u20131053 (2016)","DOI":"10.3850\/9783981537079_0248"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/978-3-540-70545-1_45","volume-title":"Computer Aided Verification","author":"O Wienand","year":"2008","unstructured":"Wienand, O., Wedler, M., Stoffel, D., Kunz, W., Greuel, G.-M.: An algebraic approach for proving data correctness in arithmetic data paths. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol. 5123, pp. 473\u2013486. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70545-1_45"},{"issue":"7","key":"5_CR5","doi-asserted-by":"publisher","first-page":"1320","DOI":"10.1109\/TCAD.2006.888277","volume":"26","author":"N Shekhar","year":"2007","unstructured":"Shekhar, N., Kalla, P., Enescu, F.: Equivalence verification of polynomial datapaths using ideal membership testing. IEEE Trans. CAD 26(7), 1320\u20131330 (2007)","journal-title":"IEEE Trans. CAD"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Tew, N., Kalla, P., Shekhar, N., Gopalakrishnan, S.: Verification of arithmetic datapaths using polynomial function models and congruence solving. In: Proceedings of International Conference on Computer-Aided Design (ICCAD), pp. 122\u2013128 (2008)","DOI":"10.1109\/ICCAD.2008.4681562"},{"issue":"9","key":"5_CR7","doi-asserted-by":"publisher","first-page":"1409","DOI":"10.1109\/TCAD.2013.2259540","volume":"32","author":"J Lv","year":"2013","unstructured":"Lv, J., Kalla, P., Enescu, F.: Efficient Gr\u00f6bner basis reductions for formal verification of Galois field arithmetic circuits. IEEE Trans. CAD 32(9), 1409\u20131420 (2013)","journal-title":"IEEE Trans. CAD"},{"issue":"7","key":"5_CR8","doi-asserted-by":"publisher","first-page":"1206","DOI":"10.1109\/TCAD.2015.2501301","volume":"35","author":"T Pruss","year":"2016","unstructured":"Pruss, T., Kalla, P., Enescu, F.: Efficient symbolic computation for word-level abstraction from combinational circuits for verification over finite fields. IEEE Trans. CAD 35(7), 1206\u20131218 (2016)","journal-title":"IEEE Trans. CAD"},{"issue":"2","key":"5_CR9","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s10703-014-0206-z","volume":"45","author":"A Lvov","year":"2014","unstructured":"Lvov, A., Lastras-Montano, L., Trager, B., Paruthi, V., Shadowen, R., El-Zein, A.: Verification of Galois field based circuits by formal reasoning based on computational algebraic geometry. Form. Methods Syst. Des. 45(2), 189\u2013212 (2014)","journal-title":"Form. Methods Syst. Des."},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Sun, X., Kalla, P., Pruss, T., Enescu, F.: Formal verification of sequential Galois field arithmetic circuits using algebraic geometry. In: Proceedings of Design, Automation and Test in Europe (2015)","DOI":"10.7873\/DATE.2015.0158"},{"key":"5_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-35651-8","volume-title":"Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra","author":"D Cox","year":"2007","unstructured":"Cox, D., Little, J., O\u2019Shea, D.: Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra. Springer, New York (2007). https:\/\/doi.org\/10.1007\/978-0-387-35651-8"},{"key":"5_CR12","doi-asserted-by":"publisher","DOI":"10.1090\/gsm\/003","volume-title":"An Introduction to Gr\u00f6bner Bases","author":"WW Adams","year":"1994","unstructured":"Adams, W.W., Loustaunau, P.: An Introduction to Gr\u00f6bner Bases. American Mathematical Society, Providence (1994)"},{"key":"5_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-0292-0_2","volume-title":"The Best of ICCAD","author":"JC Madre","year":"2003","unstructured":"Madre, J.C., Coudert, O., Billon, J.P.: Automating the diagnosis and the rectification of design errors with PRIAM. In: Kuehlmann, A. (ed.) The Best of ICCAD. Springer, Boston (2003). https:\/\/doi.org\/10.1007\/978-1-4615-0292-0_2"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Lin, C.C., Chen, K.C., Chang, S.C., Marek-Sadowska, M.: Logic synthesis for engineering change. In: Proceedings of Design Automation Conference (DAC), pp. 647\u2013652 (1995)","DOI":"10.1145\/217474.217604"},{"key":"5_CR15","unstructured":"Scholl, C., Becker, B.: Checking equivalence for partial implementations. In: Equivalence Checking of Digital Circuits. Springer, Boston (2004)"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Tang, K.F., Wu, C.A., Huang, P.K., Huang, C.Y.: Interpolation-based incremental ECO synthesis for multi-error logic rectification. In: Proceedings of Design Automation Conference (DAC), pp. 146\u2013151 (2011)","DOI":"10.1145\/2024724.2024758"},{"issue":"3","key":"5_CR17","doi-asserted-by":"publisher","first-page":"250","DOI":"10.2307\/2963593","volume":"22","author":"W Craig","year":"1957","unstructured":"Craig, W.: Linear reasoning: a new form of the Herbrand-Gentzen theorem. J. Symb. Log. 22(3), 250\u2013268 (1957)","journal-title":"J. Symb. Log."},{"key":"5_CR18","unstructured":"Liaw, H.T., Tsaih, J.H., Lin, C.S.: Efficient automatic diagnosis of digital circuits. In: Proceedings of ICCAD, pp. 464\u2013467 (1990)"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Gitina, K., Reimer, S., Sauer, M., Wimmer, R., Scholl, C., Becker, B.: Equivalence checking of partial designs using dependency quantified Boolean formulae. In: IEEE International Conference on Computer Design (ICCD) (2013)","DOI":"10.1109\/ICCD.2013.6657071"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Jo, S., Matsumoto, T., Fujita, M.: SAT-based automatic rectification and debugging of combinational circuits with LUT insertions. In: IEEE 21st Asian Test Symposium (2012)","DOI":"10.1109\/ATS.2012.55"},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"Fujita, M., Mishchenko, A.: Logic synthesis and verification on fixed topology. In: 22nd International Conference on Very Large Scale Integration (VLSI-SoC) (2014)","DOI":"10.1109\/VLSI-SoC.2014.7004155"},{"key":"5_CR22","doi-asserted-by":"publisher","first-page":"2052","DOI":"10.1109\/JPROC.2015.2476472","volume":"103","author":"M Fujita","year":"2015","unstructured":"Fujita, M.: Toward unification of synthesis and verification in topologically constrained logic design. Proc. IEEE 103, 2052\u20132060 (2015)","journal-title":"Proc. IEEE"},{"key":"5_CR23","unstructured":"Wu, B.H., Yang, C.J., Huang, C.Y., Jiang, J.H.R.: A robust functional ECO engine by SAT proof minimization and interpolation techniques. In: International Conference on Computer Aided Design, pp. 729\u2013734 (2010)"},{"issue":"1","key":"5_CR24","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1109\/TCAD.2010.2067833","volume":"30","author":"AC Ling","year":"2011","unstructured":"Ling, A.C., Brown, S.D., Safarpour, S., Zhu, J.: Toward automated ECOs in FPGAs. IEEE Trans. CAD 30(1), 18\u201330 (2011)","journal-title":"IEEE Trans. CAD"},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"Dao, A.Q., et al.: Efficient computation of ECO patch functions. In: 55th Design Automation Conference (DAC), pp. 51:1\u201351:6, June 2018","DOI":"10.1145\/3195970.3196039"},{"key":"5_CR26","doi-asserted-by":"crossref","unstructured":"Gupta, U., Ilioaea, I., Rao, V., Srinath, A., Kalla, P., Enescu, F.: On the rectifiability of arithmetic circuits using Craig interpolants in finite fields. In: International Conference on Very Large Scale Integration (VLSI-SoC), pp. 49\u201354 (2018)","DOI":"10.1109\/VLSI-SoC.2018.8644853"},{"key":"5_CR27","doi-asserted-by":"crossref","unstructured":"Ghandali, S., Yu, C., Liu, D., Brown, W., Ciesielski, M.: Logic debugging of arithmetic circuits. In: IEEE Computer Society Annual Symposium on VLSI (2015)","DOI":"10.1109\/ISVLSI.2015.16"},{"key":"5_CR28","doi-asserted-by":"crossref","unstructured":"Farahmandi, F., Mishra, P.: Automated debugging of arithmetic circuits using incremental Gr\u00f6bner basis reduction. In: IEEE International Conference on Computer Design (ICCD) (2017)","DOI":"10.1109\/ICCD.2017.37"},{"key":"5_CR29","doi-asserted-by":"crossref","unstructured":"Farahmandi, F., Mishra, P.: Automated test generation for debugging arithmetic circuits. In: Proceedings of the 2016 Conference on Design, Automation & Test in Europe, DATE (2016)","DOI":"10.3850\/9783981537079_0823"},{"key":"5_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-45069-6_1","volume-title":"Computer Aided Verification","author":"KL McMillan","year":"2003","unstructured":"McMillan, K.L.: Interpolation and SAT-based model checking. In: Hunt, W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, pp. 1\u201313. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45069-6_1"},{"key":"5_CR31","doi-asserted-by":"crossref","unstructured":"Lee, R.-R., Jiang, J.-H.R., Hung, W.-L.: Bi-decomposing large Boolean functions via interpolation and satisfiability solving. In: Proceedings of Design Automation Conference (DAC), pp. 636\u2013641 (2008)","DOI":"10.1145\/1391469.1391634"},{"issue":"1","key":"5_CR32","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.tcs.2005.07.003","volume":"345","author":"K.L. McMillan","year":"2005","unstructured":"McMillan, K.: An interpolating theorem prover, theoretical computer science. In: Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2004), vol. 345, no. 1, pp. 101\u2013121 (2005)","journal-title":"Theoretical Computer Science"},{"key":"5_CR33","doi-asserted-by":"crossref","unstructured":"Kapur, D., Majumdar, R., Zarba, G.: Interpolation for data-structures. In: Proceedings of ACM SIGSOFT International Symposium on Foundation of Software Engineering, pp. 105\u2013116 (2006)","DOI":"10.1145\/1181775.1181789"},{"key":"5_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/978-3-540-78800-3_30","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A Cimatti","year":"2008","unstructured":"Cimatti, A., Griggio, A., Sebastiani, R.: Efficient interpolant generation in satisfiability modulo theories. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 397\u2013412. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78800-3_30"},{"key":"5_CR35","unstructured":"Griggio, A.: Effective word-level interpolation for software verification. In: Formal Methods in Computer-Aided Design (FMCAD), pp. 28\u201336 (2011)"},{"key":"5_CR36","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/978-3-642-21493-6_9","volume-title":"Algebraic Informatics","author":"Sicun Gao","year":"2011","unstructured":"Gao, S., Platzer, A., Clarke, E.: Quantifier elimination over finite fields with Gr\u00f6bner bases. In: Algebraic Informatics: 4th International Conference, CAI, pp. 140\u2013157 (2011)"},{"key":"5_CR37","unstructured":"Gao, S.: Counting zeros over finite fields with Gr\u00f6bner bases. Master\u2019s thesis, Carnegie Mellon University (2009)"},{"key":"5_CR38","unstructured":"Lv, J.: Scalable formal verification of finite field arithmetic circuits using computer algebra techniques. Ph.D. dissertation, Univ. of Utah, August 2012"},{"key":"5_CR39","unstructured":"Buchberger, B.: Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal. Ph.D. dissertation, University of Innsbruck (1965)"},{"key":"5_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/3-540-09519-5_52","volume-title":"Symbolic and Algebraic Computation","author":"B Buchberger","year":"1979","unstructured":"Buchberger, B.: A criterion for detecting unnecessary reductions in the construction of Gr\u00f6bner-bases. In: Ng, E.W. (ed.) Symbolic and Algebraic Computation. LNCS, vol. 72, pp. 3\u201321. Springer, Heidelberg (1979). https:\/\/doi.org\/10.1007\/3-540-09519-5_52"},{"key":"5_CR41","unstructured":"Decker, W., Greuel, G.-M., Pfister, G., Sch\u00f6nemann, H.: Singular 4-1-0 \u2013 a computer algebra system for polynomial computations (2016). http:\/\/www.singular.uni-kl.de"},{"key":"5_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-642-14295-6_5","volume-title":"Computer Aided Verification","author":"R Brayton","year":"2010","unstructured":"Brayton, R., Mishchenko, A.: ABC: an academic industrial-strength verification tool. In: Touili, T., Cook, B., Jackson, P. (eds.) CAV 2010. LNCS, vol. 6174, pp. 24\u201340. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14295-6_5"},{"key":"5_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/3-540-48892-8_16","volume-title":"Selected Areas in Cryptography","author":"J L\u00f3pez","year":"1999","unstructured":"L\u00f3pez, J., Dahab, R.: Improved algorithms for elliptic curve arithmetic in GF(2n). In: Tavares, S., Meijer, H. (eds.) SAC 1998. LNCS, vol. 1556, pp. 201\u2013212. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48892-8_16"}],"container-title":["IFIP Advances in Information and Communication Technology","VLSI-SoC: Design and Engineering of Electronics Systems Based on New Computing Paradigms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-23425-6_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:03:35Z","timestamp":1687651415000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-23425-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030234249","9783030234256"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-23425-6_5","relation":{},"ISSN":["1868-4238","1868-422X"],"issn-type":[{"type":"print","value":"1868-4238"},{"type":"electronic","value":"1868-422X"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"26 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"VLSI-SoC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IFIP\/IEEE International Conference on Very Large Scale Integration - System on a Chip","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Verona","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 October 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 October 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"vlsi-soc2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/vlsi-soc.di.univr.it\/","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"}]}}