{"id":"https://openalex.org/W2776133267","doi":"https://doi.org/10.1145/3167080","title":"A verified SAT solver with watched literals using imperative HOL","display_name":"A verified SAT solver with watched literals using imperative HOL","publication_year":2018,"publication_date":"2018-01-08","ids":{"openalex":"https://openalex.org/W2776133267","doi":"https://doi.org/10.1145/3167080","mag":"2776133267"},"language":"en","primary_location":{"id":"doi:10.1145/3167080","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3167080","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research.manchester.ac.uk/en/publications/558eb816-6c11-4df3-9a21-0e6802167c54","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5086520801","display_name":"Mathias Fleury","orcid":"https://orcid.org/0000-0002-1705-3083"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Mathias Fleury","raw_affiliation_strings":["Max Planck Institute for Informatics, Germany"],"affiliations":[{"raw_affiliation_string":"Max Planck Institute for Informatics, Germany","institution_ids":["https://openalex.org/I4210109712"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079200257","display_name":"Jasmin Christian Blanchette","orcid":"https://orcid.org/0000-0002-8367-0936"},"institutions":[{"id":"https://openalex.org/I865915315","display_name":"Vrije Universiteit Amsterdam","ror":"https://ror.org/008xxew50","country_code":"NL","type":"education","lineage":["https://openalex.org/I865915315"]},{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE","NL"],"is_corresponding":false,"raw_author_name":"Jasmin Christian Blanchette","raw_affiliation_strings":["Vrije Universiteit Amsterdam, Netherlands / Max Planck Institute for Informatics, Germany"],"affiliations":[{"raw_affiliation_string":"Vrije Universiteit Amsterdam, Netherlands / Max Planck Institute for Informatics, Germany","institution_ids":["https://openalex.org/I4210109712","https://openalex.org/I865915315"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5082037264","display_name":"Peter Lammich","orcid":"https://orcid.org/0000-0003-3576-0504"},"institutions":[{"id":"https://openalex.org/I859038795","display_name":"Virginia Tech","ror":"https://ror.org/02smfhw86","country_code":"US","type":"education","lineage":["https://openalex.org/I859038795"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Peter Lammich","raw_affiliation_strings":["TU Munich, Germany / Virginia Tech, USA"],"affiliations":[{"raw_affiliation_string":"TU Munich, Germany / Virginia Tech, USA","institution_ids":["https://openalex.org/I859038795"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5086520801"],"corresponding_institution_ids":["https://openalex.org/I4210109712"],"apc_list":null,"apc_paid":null,"fwci":2.5596,"has_fulltext":true,"cited_by_count":17,"citation_normalized_percentile":{"value":0.90530003,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"158","last_page":"171"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9948999881744385,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9926999807357788,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/hol","display_name":"HOL","score":0.9590805768966675},{"id":"https://openalex.org/keywords/executable","display_name":"Executable","score":0.853030800819397},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7611210346221924},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6936006546020508},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.62892746925354},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.6074007749557495},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5968480706214905},{"id":"https://openalex.org/keywords/automated-theorem-proving","display_name":"Automated theorem proving","score":0.46484607458114624},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.41997966170310974}],"concepts":[{"id":"https://openalex.org/C17435882","wikidata":"https://www.wikidata.org/wiki/Q17030435","display_name":"HOL","level":2,"score":0.9590805768966675},{"id":"https://openalex.org/C160145156","wikidata":"https://www.wikidata.org/wiki/Q778586","display_name":"Executable","level":2,"score":0.853030800819397},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7611210346221924},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6936006546020508},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.62892746925354},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.6074007749557495},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5968480706214905},{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.46484607458114624},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41997966170310974},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1145/3167080","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3167080","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.atira.dk:openaire/558eb816-6c11-4df3-9a21-0e6802167c54","is_oa":true,"landing_page_url":"https://research.manchester.ac.uk/en/publications/558eb816-6c11-4df3-9a21-0e6802167c54","pdf_url":null,"source":{"id":"https://openalex.org/S4306400662","display_name":"Research Explorer (The University of Manchester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I28407311","host_organization_name":"University of Manchester","host_organization_lineage":["https://openalex.org/I28407311"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fleury, M, Blanchette, J C & Lammich, P 2018, A verified SAT solver with watched literals using imperative HOL. in Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs. pp. 158-171, the 7th ACM SIGPLAN International Conference, 8/01/18. https://doi.org/10.1145/3167080","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:research.vu.nl:openaire/8bda2d66-d76b-4ef2-bfea-9dbfe75bb189","is_oa":true,"landing_page_url":"https://research.vu.nl/en/publications/8bda2d66-d76b-4ef2-bfea-9dbfe75bb189","pdf_url":null,"source":{"id":"https://openalex.org/S4306401107","display_name":"VU Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I865915315","host_organization_name":"Vrije Universiteit Amsterdam","host_organization_lineage":["https://openalex.org/I865915315"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fleury, M, Blanchette, J C & Lammich, P 2018, A verified SAT solver with watched literals using Imperative HOL. in CPP 2018 : Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs. Association for Computing Machinery, Inc, New York, NY, pp. 158-171, 7th ACM SIGPLAN International Conference on Certified Programs and Proofs, CPP 2018, Los Angeles, United States, 8/01/18. https://doi.org/10.1145/3167080","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:HAL:hal-01904647v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-01904647","pdf_url":"https://inria.hal.science/hal-01904647/document","source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"CPP 2018 - The 7th ACM SIGPLAN International Conference on Certified Programs and Proofs, Jan 2018, Los Angeles, United States. ⟨10.1145/3167080⟩","raw_type":"Conference papers"},{"id":"pmh:oai:pure.atira.dk:publications/558eb816-6c11-4df3-9a21-0e6802167c54","is_oa":false,"landing_page_url":"http://dl.acm.org/citation.cfm?doid=3176245.3167080","pdf_url":null,"source":{"id":"https://openalex.org/S4306400662","display_name":"Research Explorer (The University of Manchester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I28407311","host_organization_name":"University of Manchester","host_organization_lineage":["https://openalex.org/I28407311"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:oai:research.vu.nl:publications/8bda2d66-d76b-4ef2-bfea-9dbfe75bb189","is_oa":true,"landing_page_url":"http://www.scopus.com/inward/record.url?scp=85044279547&partnerID=8YFLogxK","pdf_url":null,"source":{"id":"https://openalex.org/S4306401107","display_name":"VU Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I865915315","host_organization_name":"Vrije Universiteit Amsterdam","host_organization_lineage":["https://openalex.org/I865915315"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Fleury, M, Blanchette, J C & Lammich, P 2018, A verified SAT solver with watched literals using Imperative HOL. in CPP 2018 : Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs. Association for Computing Machinery, Inc, New York, NY, pp. 158-171, 7th ACM SIGPLAN International Conference on Certified Programs and Proofs, CPP 2018, Los Angeles, United States, 8/01/18. https://doi.org/10.1145/3167080","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:openaire/558eb816-6c11-4df3-9a21-0e6802167c54","is_oa":true,"landing_page_url":"https://research.manchester.ac.uk/en/publications/558eb816-6c11-4df3-9a21-0e6802167c54","pdf_url":null,"source":{"id":"https://openalex.org/S4306400662","display_name":"Research Explorer (The University of Manchester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I28407311","host_organization_name":"University of Manchester","host_organization_lineage":["https://openalex.org/I28407311"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fleury, M, Blanchette, J C & Lammich, P 2018, A verified SAT solver with watched literals using imperative HOL. in Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs. pp. 158-171, the 7th ACM SIGPLAN International Conference, 8/01/18. https://doi.org/10.1145/3167080","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.5799999833106995}],"awards":[{"id":"https://openalex.org/G4956428346","display_name":null,"funder_award_id":"Horizon 2020 research and innovatio","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G5036817778","display_name":null,"funder_award_id":"European Union's Horizon 2020 research and innov","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G6937246109","display_name":null,"funder_award_id":"713999","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G8318064016","display_name":null,"funder_award_id":"Horizon","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G8633428685","display_name":null,"funder_award_id":"European Union's Horizon 2020 research and innovat","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W46694604","https://openalex.org/W77329694","https://openalex.org/W78552530","https://openalex.org/W134339645","https://openalex.org/W183357072","https://openalex.org/W1480459634","https://openalex.org/W1482572800","https://openalex.org/W1497978324","https://openalex.org/W1511963917","https://openalex.org/W1513576223","https://openalex.org/W1518705996","https://openalex.org/W1522519483","https://openalex.org/W1523874359","https://openalex.org/W1586677474","https://openalex.org/W1608123432","https://openalex.org/W1881903642","https://openalex.org/W1911923721","https://openalex.org/W1955004327","https://openalex.org/W1976978933","https://openalex.org/W1991066194","https://openalex.org/W2022846948","https://openalex.org/W2033937366","https://openalex.org/W2057361103","https://openalex.org/W2080046595","https://openalex.org/W2132634139","https://openalex.org/W2142785340","https://openalex.org/W2144209827","https://openalex.org/W2206900256","https://openalex.org/W2282536569","https://openalex.org/W2290529759","https://openalex.org/W2293405767","https://openalex.org/W2400262552","https://openalex.org/W2468912077","https://openalex.org/W2543800696","https://openalex.org/W2564212270","https://openalex.org/W2746765002","https://openalex.org/W2751687056","https://openalex.org/W6607464539"],"related_works":["https://openalex.org/W3158536649","https://openalex.org/W3208388410","https://openalex.org/W2534028225","https://openalex.org/W1497011154","https://openalex.org/W4206694237","https://openalex.org/W2724703556","https://openalex.org/W3196544792","https://openalex.org/W1504680642","https://openalex.org/W2519051298","https://openalex.org/W1521746323"],"abstract_inverted_index":{"Based":[0],"on":[1],"our":[2,67],"earlier":[3],"formalization":[4],"of":[5,47,75],"conflict-driven":[6],"clause":[7],"learning":[8],"(CDCL)":[9],"in":[10],"Isabelle/HOL,":[11],"we":[12,34,56],"refine":[13,35],"the":[14,27,31,36,52,73,76],"CDCL":[15],"calculus":[16,37],"to":[17,38,90],"add":[18],"a":[19,45],"crucial":[20],"optimization:":[21],"two":[22],"watched":[23],"literals.":[24],"We":[25],"formalize":[26],"data":[28],"structure":[29],"and":[30,60,85],"invariants.":[32],"Then":[33],"obtain":[39],"an":[40],"executable":[41],"SAT":[42],"solver.":[43],"Through":[44],"chain":[46],"refinements":[48],"carried":[49],"out":[50],"using":[51],"Isabelle":[53],"Refinement":[54],"Framework,":[55],"target":[57],"Imperative":[58],"HOL":[59],"extract":[61],"imperative":[62],"Standard":[63],"ML":[64],"code.":[65],"Although":[66],"solver":[68],"is":[69],"not":[70],"competitive":[71],"with":[72],"state":[74],"art,":[77],"it":[78,92],"offers":[79],"acceptable":[80],"performance":[81],"for":[82],"some":[83],"applications,":[84],"heuristics":[86],"can":[87],"be":[88],"added":[89],"improve":[91],"further.":[93]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-03-12T08:34:05.389933","created_date":"2025-10-10T00:00:00"}