A More Pragmatic CDCL for IsaSAT and Targetting LLVM

Mathias Fleury*, Peter Lammich

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

4 Citations (Scopus)
67 Downloads (Pure)

Abstract

IsaSAT is the most advanced verified SAT solver, but it did not yet feature inprocessing (to simplify and strengthen clauses). In order to improve performance, we enriched the base calculus to not only do CDCL but also inprocess clauses. We also replaced the target of our code synthesis by Isabelle/LLVM. With these improvements, we can solve 4 times more SAT Competition 2022 problems than the original IsaSAT version, and 4.5 times more problems than any other verified SAT solver we are aware of. Additionally, our changes significantly reduce the trusted code base of our verification.
Original languageEnglish
Title of host publicationAutomated Deduction – CADE 29
Subtitle of host publication29th International Conference on Automated Deduction Rome, Italy, July 1–4, 2023 Proceedings
EditorsRandy Goebel, Wolfgang Wahlster, Zhi-Hua Zhou
PublisherSpringer
Pages207-219
Number of pages13
ISBN (Electronic)978-3-031-38499-8
ISBN (Print)978-3-031-38498-1
DOIs
Publication statusPublished - 2023
Event29th International Conference on Automated Deduction, CADE 29 - Sapienza University of Rome, Rome, Italy
Duration: 1 Jul 20234 Jul 2023
Conference number: 29
https://easyconferences.eu/cade2023/

Publication series

NameLecture Notes in Artificial Intelligence
PublisherSpringer
Volume14132
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference29th International Conference on Automated Deduction, CADE 29
Abbreviated titleCADE 2023
Country/TerritoryItaly
CityRome
Period1/07/234/07/23
Internet address

Fingerprint

Dive into the research topics of 'A More Pragmatic CDCL for IsaSAT and Targetting LLVM'. Together they form a unique fingerprint.

Cite this