{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T06:43:19Z","timestamp":1768286599660,"version":"3.49.0"},"reference-count":29,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,12,5]],"date-time":"2021-12-05T00:00:00Z","timestamp":1638662400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,12,5]],"date-time":"2021-12-05T00:00:00Z","timestamp":1638662400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,12,5]],"date-time":"2021-12-05T00:00:00Z","timestamp":1638662400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,12,5]]},"DOI":"10.1109\/dac18074.2021.9586272","type":"proceedings-article","created":{"date-parts":[[2021,11,8]],"date-time":"2021-11-08T23:30:34Z","timestamp":1636414234000},"page":"541-546","source":"Crossref","is-referenced-by-count":7,"title":["Theory-Specific Proof Steps Witnessing Correctness of SMT Executions"],"prefix":"10.1109","author":[{"given":"Rodrigo","family":"Otoni","sequence":"first","affiliation":[]},{"given":"Martin","family":"Blicha","sequence":"additional","affiliation":[]},{"given":"Patrick","family":"Eugster","sequence":"additional","affiliation":[]},{"given":"Antti E. J.","family":"Hyvarinen","sequence":"additional","affiliation":[]},{"given":"Natasha","family":"Sharygina","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63046-5_25"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14052-5_14"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63390-9_7"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-09284-3_31"},{"key":"ref14","article-title":"Theorie der einfachen ungleichungen","volume":"1902","author":"farkas","year":"1902","journal-title":"Journal fr die Reine und Angewandte Mathematik"},{"key":"ref15","author":"tseitin","year":"1983","journal-title":"On the Complexity of Derivations in Prepositional Calculus"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-40970-2_35"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s10703-012-0163-3"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22110-1_14"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-012-9322-x"},{"key":"ref28","article-title":"GRASP: A search algorithm for propositional satisfiability","volume":"48","author":"silva","year":"1999","journal-title":"IEEE Transactions on Computers"},{"key":"ref4","article-title":"A flexible proof format for SMT: a proposal","author":"besson","year":"2011","journal-title":"First Workshop on Proof eXchange for Theorem Proving – PxTP 2011"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78800-3_24"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-61467-6_12"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/FMCAD.2016.7886666"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-32033-3_33"},{"key":"ref5","article-title":"Proofs and refutations, and Z3","volume":"418","author":"de moura","year":"2008","journal-title":"CEUR Workshop"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25379-9_12"},{"key":"ref7","author":"barrett","year":"2014","journal-title":"Proofs in satisfiability modulo theories"},{"key":"ref2","author":"barrett","year":"2009","journal-title":"Workshop on Satisfiability Modulo Theories"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-015-9335-3"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/567067.567080"},{"key":"ref20","author":"balint","year":"2013","journal-title":"Proceedings of SAT Competition 2013 Solver and Benchmark Descriptions"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/FMCAD.2013.6679408"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/321033.321034"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63046-5_14"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38574-2_24"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02959-2_12"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-24258-9_21"}],"event":{"name":"2021 58th ACM\/IEEE Design Automation Conference (DAC)","location":"San Francisco, CA, USA","start":{"date-parts":[[2021,12,5]]},"end":{"date-parts":[[2021,12,9]]}},"container-title":["2021 58th ACM\/IEEE Design Automation Conference (DAC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9585997\/9586083\/09586272.pdf?arnumber=9586272","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T16:55:53Z","timestamp":1652201753000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9586272\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,5]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/dac18074.2021.9586272","relation":{},"subject":[],"published":{"date-parts":[[2021,12,5]]}}}