{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,26]],"date-time":"2025-06-26T04:50:50Z","timestamp":1750913450454,"version":"3.37.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319961446"},{"type":"electronic","value":"9783319961453"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-96145-3_35","type":"book-chapter","created":{"date-parts":[[2018,7,20]],"date-time":"2018-07-20T22:25:55Z","timestamp":1532125555000},"page":"612-620","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["ADAC: Automated Design of Approximate Circuits"],"prefix":"10.1007","author":[{"given":"Milan","family":"\u010ce\u0161ka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ji\u0159\u00ed","family":"Maty\u00e1\u0161","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vojtech","family":"Mrazek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lukas","family":"Sekanina","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zdenek","family":"Vasicek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tom\u00e1\u0161","family":"Vojnar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,7,18]]},"reference":[{"key":"35_CR1","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":"35_CR2","unstructured":"BuDDy: A BDD package, January 2018. http:\/\/buddy.sourceforge.net\/manual\/main.html"},{"key":"35_CR3","doi-asserted-by":"crossref","unstructured":"\u010ce\u0161ka, M., Maty\u00e1\u0161, J., Mrazek, V., Sekanina, L., Vasicek, Z., Vojnar, T.: Approximating complex arithmetic circuits with formal error guarantees: 32-bit multipliers accomplished. In: Proceedings of the ICCAD 2017, pp. 416\u2013423. IEEE (2017)","DOI":"10.1109\/ICCAD.2017.8203807"},{"key":"35_CR4","doi-asserted-by":"crossref","unstructured":"Chakraborty, S., Meel, K.S., Mistry, R., Vardi, M.Y.: Approximate probabilistic inference via word-level counting. In: Proceedings of the AAAI 2016, pp. 3218\u20133224. AAAI Press (2016)","DOI":"10.1609\/aaai.v30i1.10416"},{"key":"35_CR5","doi-asserted-by":"crossref","unstructured":"Chandrasekharan, A., Soeken, M., Gro\u00dfe, D., Drechsler, R.: Precise error determination of approximated components in sequential circuits with model checking. In: Proceedings of the DAC 2016, pp. 129:1\u2013129:6. ACM (2016)","DOI":"10.1145\/2897937.2898069"},{"key":"35_CR6","doi-asserted-by":"crossref","unstructured":"Chandrasekharan, A., Soeken, M., et al.: Approximation-aware rewriting of AIGs for error tolerant applications. In: Proceedings of the ICCAD 2016, pp. 83:1\u201383:8. ACM (2016)","DOI":"10.1145\/2966986.2967003"},{"key":"35_CR7","doi-asserted-by":"crossref","unstructured":"Chippa, V.K., Chakradhar, S.T., Roy, K., Raghunathan, A.: Analysis and characterization of inherent application resilience for approximate computing. In: Proceedings of the DAC 2013, pp. 1\u20139. IEEE (2013)","DOI":"10.1145\/2463209.2488873"},{"key":"35_CR8","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: Proceedings of the DAC 2015. ACM (2015)","DOI":"10.1145\/2744769.2744925"},{"key":"35_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/978-3-642-31424-7_31","volume-title":"Computer Aided Verification","author":"C-S Han","year":"2012","unstructured":"Han, C.-S., Jiang, J.-H.R.: When boolean satisfiability meets gaussian elimination in a simplex way. In: Madhusudan, P., Seshia, S.A. (eds.) CAV 2012. LNCS, vol. 7358, pp. 410\u2013426. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31424-7_31"},{"key":"35_CR10","doi-asserted-by":"crossref","unstructured":"Jiang, H., Liu, C., Liu, L., Lombardi, F., Han, J.: A review, classification, and comparative evaluation of approximate arithmetic circuits. J. Emerg. Technol. Comput. Syst. 13(4), 60:1\u201360:34 (2017)","DOI":"10.1145\/3094124"},{"issue":"4","key":"35_CR11","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1166\/jolpe.2011.1157","volume":"7","author":"P Kulkarni","year":"2011","unstructured":"Kulkarni, P., Gupta, P., Ercegovac, M.D.: Trading accuracy for power in a multiplier architecture. J. Low Power Electron. 7(4), 490\u2013501 (2011)","journal-title":"J. Low Power Electron."},{"key":"35_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17310-3","volume-title":"Cartesian Genetic Programming","author":"JF Miller","year":"2011","unstructured":"Miller, J.F.: Cartesian Genetic Programming. Springer, Berlin (2011). https:\/\/doi.org\/10.1007\/978-3-642-17310-3"},{"key":"35_CR13","doi-asserted-by":"crossref","unstructured":"Mrazek, V., Hrbacek, R., et al.: EvoApprox8B: library of approximate adders and multipliers for circuit design and benchmarking of approximation methods. In: Proceedings of the DATE 2017, pp. 258\u2013261. EDAA (2017)","DOI":"10.23919\/DATE.2017.7926993"},{"key":"35_CR14","doi-asserted-by":"crossref","unstructured":"Mrazek, V., Sarwar, S.S., Sekanina, L., Vasicek, Z., Roy, K.: Design of power-efficient approximate multipliers for approximate artificial neural networks. In: Proceedings of the ICCAD 2016, pp. 81:1\u201381:7. ACM (2016)","DOI":"10.1145\/2966986.2967021"},{"key":"35_CR15","doi-asserted-by":"crossref","unstructured":"Qiqieh, I., Shafik, R., et al.: Energy-efficient approximate multiplier design using bit significance-driven logic compression. In: Proceedings of the DATE 2017. EDAA (2017)","DOI":"10.23919\/DATE.2017.7926950"},{"key":"35_CR16","doi-asserted-by":"crossref","unstructured":"Sayed-Ahmed, A., Gro\u00dfe, D., et al.: Formal verification of integer multipliers by combining Gr\u00f6bner basis with logic reduction. In: Proceedings of the DATE 2016, pp. 1048\u20131053. IEEE (2016)","DOI":"10.3850\/9783981537079_0248"},{"key":"35_CR17","doi-asserted-by":"crossref","unstructured":"Shafique, M., Ahmad, W., et al.: A low latency generic accuracy configurable adder. In: Proceedings of the DAC 2015, pp. 86:1\u201386:6. ACM (2015)","DOI":"10.1145\/2744769.2744778"},{"key":"35_CR18","unstructured":"Sorensson, N., Een, N.: MiniSat v1.13 \u2013 a sat solver with conflict-clause minimization. SAT 2005, no. 53, pp. 1\u20132 (2005)"},{"key":"35_CR19","unstructured":"Synopsys design compiler, January 2018. https:\/\/www.synopsys.com\/"},{"key":"35_CR20","doi-asserted-by":"crossref","unstructured":"Vasicek, Z., Mrazek, V., Sekanina, L.: Evolutionary functional approximation of circuits implemented into FPGAs. In: Proceedings of the SSCI 2016, pp. 1\u20138. IEEE (2016)","DOI":"10.1109\/SSCI.2016.7850173"},{"issue":"3","key":"35_CR21","doi-asserted-by":"crossref","first-page":"432","DOI":"10.1109\/TEVC.2014.2336175","volume":"19","author":"Z Vasicek","year":"2015","unstructured":"Vasicek, Z., Sekanina, L.: Evolutionary approach to approximate digital circuits design. Trans. Evol. Comput. 19(3), 432\u2013444 (2015)","journal-title":"Trans. Evol. Comput."},{"key":"35_CR22","doi-asserted-by":"crossref","unstructured":"Vasicek, Z., Mrazek, V., Sekanina, L.: Towards low power approximate DCT architecture for HEVC standard. In: Proceedings of the DATE 2017, pp. 1576\u20131581. EDAA (2017)","DOI":"10.23919\/DATE.2017.7927241"},{"issue":"2","key":"35_CR23","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/s10710-015-9257-1","volume":"17","author":"Z Vasicek","year":"2016","unstructured":"Vasicek, Z., Sekanina, L.: Evolutionary design of complex approximate combinational circuits. Genet. Program Evolvable Mach. 17(2), 169\u2013192 (2016)","journal-title":"Genet. Program Evolvable Mach."},{"key":"35_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-642-29139-5_23","volume-title":"Genetic Programming","author":"Z Va\u0161\u00ed\u010dek","year":"2012","unstructured":"Va\u0161\u00ed\u010dek, Z., Slan\u00fd, K.: Efficient phenotype evaluation in cartesian genetic programming. In: Moraglio, A., Silva, S., Krawiec, K., Machado, P., Cotta, C. (eds.) EuroGP 2012. LNCS, vol. 7244, pp. 266\u2013278. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29139-5_23"},{"key":"35_CR25","unstructured":"Wolf, C.: Yosys open synthesis suite, January 2018. http:\/\/www.clifford.at\/yosys\/"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-96145-3_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,28]],"date-time":"2022-08-28T00:40:44Z","timestamp":1661647244000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-96145-3_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319961446","9783319961453"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-96145-3_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}