{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,29]],"date-time":"2026-09-29T12:01:14Z","timestamp":1790683274348,"version":"4.1.0"},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,1,8]],"date-time":"2018-01-08T00:00:00Z","timestamp":1515369600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"European Research Council","award":["713999"],"award-info":[{"award-number":["713999"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,1,8]]},"DOI":"10.1145\/3167080","type":"proceedings-article","created":{"date-parts":[[2018,3,16]],"date-time":"2018-03-16T16:10:56Z","timestamp":1521216656000},"page":"158-171","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["A verified SAT solver with watched literals using imperative HOL"],"prefix":"10.1145","author":[{"given":"Mathias","family":"Fleury","sequence":"first","affiliation":[{"name":"Max Planck Institute for Informatics, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jasmin Christian","family":"Blanchette","sequence":"additional","affiliation":[{"name":"Vrije Universiteit Amsterdam, Netherlands \/ Max Planck Institute for Informatics, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peter","family":"Lammich","sequence":"additional","affiliation":[{"name":"TU Munich, Germany \/ Virginia Tech, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2018,1,8]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Predicting Learnt Clauses Quality in Modern SAT Solvers. In IJCAI","author":"Audemard Gilles","year":"2009"},{"key":"e_1_3_2_1_2_1","volume-title":"Handbook of Automated Reasoning, Alan Robinson and Andrei Voronkov (Eds.).","author":"Bachmair Leo"},{"key":"e_1_3_2_1_3_1","volume-title":"Fredrik Nordvall Forsberg, and Monika Seisenberger","author":"Berger Ulrich","year":"2015"},{"key":"e_1_3_2_1_4_1","volume-title":"YalSAT Entering the SAT Competition","author":"Biere Armin","year":"2016"},{"key":"e_1_3_2_1_5_1","volume-title":"Evaluating CDCL Variable Scoring Schemes. In SAT 2015 (LNCS), Marijn Heule and Sean Weaver (Eds.)","volume":"9340","author":"Biere Armin","year":"2015"},{"key":"e_1_3_2_1_6_1","volume-title":"Frontiers in Artificial Intelligence and Applications","volume":"185","author":"Biere Armin","year":"2009"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-40229-1_4"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71067-7_14"},{"key":"e_1_3_2_1_9_1","volume-title":"CADE-26 (LNCS), Leonardo de Moura (Ed.)","author":"Cruz-Filipe Lu\u00eds"},{"key":"e_1_3_2_1_10_1","volume-title":"Efficient Certified Resolution Proof Checking. In TACAS 2017 (LNCS), Axel Legay and Tiziana Margaria (Eds.)","volume":"10205","author":"Cruz-Filipe Lu\u00eds","year":"2017"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/368273.368557"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2676726.2677006"},{"key":"e_1_3_2_1_13_1","volume-title":"An Extensible SAT-Solver. In SAT 2003 (LNCS), Enrico Giunchiglia and Armando Tacchella (Eds.)","volume":"2919","author":"E\u00e9n Niklas","year":"2003"},{"key":"e_1_3_2_1_14_1","unstructured":"Mathias Fleury and Jasmin Christian Blanchette. 2017. Formalization of Weidenbach\u2019s Automated Reasoning\u2014The Art of Generic Problem Solving. (2017). https:\/\/bitbucket.org\/isafol\/isafol\/src\/master\/ Weidenbach_Book\/README.md Formal proof development.  Mathias Fleury and Jasmin Christian Blanchette. 2017. Formalization of Weidenbach\u2019s Automated Reasoning\u2014The Art of Generic Problem Solving. (2017). https:\/\/bitbucket.org\/isafol\/isafol\/src\/master\/ Weidenbach_Book\/README.md Formal proof development."},{"key":"e_1_3_2_1_15_1","first-page":"1","article-title":"The Transform\u2014A New Language Construct","volume":"11","author":"Gries David","year":"1990","journal-title":"Structured Programming"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12251-4_9"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1002\/stvr.1549"},{"key":"e_1_3_2_1_18_1","volume-title":"ITP 2017 (LNCS), Mauricio Ayala-Rinc\u00f3n and C\u00e9sar A","author":"Heule Marijn"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39634-2_9"},{"key":"e_1_3_2_1_20_1","volume-title":"ITP 2015 (LNCS)","author":"Lammich Peter"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2854065.2854067"},{"key":"e_1_3_2_1_22_1","volume-title":"SAT 2017 (LNCS), Serge Gaspers and Toby Walsh (Eds.)","volume":"10491","author":"Lammich Peter","year":"2017"},{"key":"e_1_3_2_1_23_1","volume-title":"ITP 2012 (LNCS), Lennart Beringer and Amy P","author":"Lammich Peter"},{"key":"e_1_3_2_1_25_1","volume-title":"Formal Verification of Modern SAT Solvers. Archive of Formal Proofs","author":"Mari\u0107 Filip","year":"2008"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.09.014"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-015-9360-2"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/378239.379017"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1217856.1217859"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-27940-9_24"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/1768142.1768170"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2011.03.002"},{"key":"e_1_3_2_1_34_1","volume-title":"Minimizing Learned Clauses. In SAT 2009 (LNCS), Oliver Kullmann (Ed.)","volume":"9340","author":"S\u00f6rensson Niklas","year":"2009"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1481848.1481856"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03359-9_31"},{"key":"e_1_3_2_1_37_1","volume-title":"Correct System Design: Symposium in Honor of Ernst-R\u00fcdiger Olderog on the Occasion of His 60th Birthday (LNCS), Roland Meyer, Andr\u00e9 Platzer","author":"Weidenbach Christoph"},{"key":"e_1_3_2_1_38_1","volume-title":"Hunt","author":"Wetzler Nathan","year":"2014"}],"event":{"name":"CPP '18: Certified Proofs and Programs","location":"Los Angeles CA USA","acronym":"CPP '18","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGLOG ACM Special Interest Group on Logic and Computation"]},"container-title":["Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3167080","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3167080","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:13:27Z","timestamp":1750212807000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3167080"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1,8]]},"references-count":36,"alternative-id":["10.1145\/3167080","10.1145\/3176245"],"URL":"https:\/\/doi.org\/10.1145\/3167080","relation":{},"subject":[],"published":{"date-parts":[[2018,1,8]]},"assertion":[{"value":"2018-01-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}