A More Pragmatic CDCL for IsaSAT and Targetting LLVM (Short Paper)-Reference-Cited by-同舟云学术

A More Pragmatic CDCL for IsaSAT and Targetting LLVM (Short Paper)

Published:2023 Issue: Volume: Page:207-219
ISSN:0302-9743
Container-title:Automated Deduction – CADE 29
language:
Short-container-title:

Author:

Fleury Mathias^ORCID,Lammich Peter^ORCID

Abstract

AbstractIsaSAT 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.

Publisher

Springer Nature Switzerland

Link

https://link.springer.com/content/pdf/10.1007/978-3-031-38499-8_12

Reference28 articles.

1. Andrici, C.C., Ciobâcă, S.: A verified implementation of the DPLL algorithm in Dafny. Mathematics 10(13), 1–26 (2022). https://ideas.repec.org/a/gam/jmathe/v10y2022i13p2264-d850381.html

2. Balyo, T., Heule, M., Iser, M., Järvisalo, M., Suda, M. (eds.): Proceedings of SAT Competition 2022: Solver and Benchmark Descriptions. Department of Computer Science Series of Publications B, Department of Computer Science, University of Helsinki, Finland (2022)

3. Becker, H., et al.: IsaFoL: Isabelle formalization of logic. https://bitbucket.org/isafol/isafol/

4. Biere, A., Fazekas, K., Fleury, M., Heisinger, M.: CaDiCaL, Kissat, Paracooba, Plingeling and Treengeling entering the SAT Competition 2020. In: Balyo, T., Froleyks, N., Heule, M., Iser, M., Järvisalo, M., Suda, M. (eds.) Proceedings of SAT Competition 2020 - Solver and Benchmark Descriptions. Department of Computer Science Report Series B, vol. B-2020-1, pp. 51–53. University of Helsinki (2020)

5. Biere, A., Fazekas, K., Fleury, M., Heisinger, M.: CaDiCaL, Kissat, Paracooba, Plingeling and Treengeling entering the SAT Competition 2021. In: Proceedings of the SAT Competition 2021 - Solver and Benchmark Descriptions (2021). submitted

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Refinement of Parallel Algorithms Down to LLVM: Applied to Practically Efficient Parallel Sorting;Journal of Automated Reasoning;2024-06-19

2. On Verified Automated Reasoning in Propositional Logic: Teaching Sequent Calculus to Computer Science Students;Vietnam Journal of Computer Science;2024-05-02

3. CaDiCaL 2.0;Lecture Notes in Computer Science;2024