Follow
Mathias Fleury
Mathias Fleury
Verified email at informatik.uni-freiburg.de - Homepage
Title
Cited by
Cited by
Year
CaDiCaL, Kissat, Paracooba, Plingeling and Treengeling entering the SAT Competition 2020
A Biere, K Fazekas, M Fleury, M Heisinger
3162020
A verified SAT solver framework with learn, forget, restart, and incrementality
JC Blanchette, M Fleury, P Lammich, C Weidenbach
Journal of automated reasoning 61, 333-365, 2018
822018
A verified SAT solver with watched literals using imperative HOL
M Fleury, JC Blanchette, P Lammich
Proceedings of the 7th ACM SIGPLAN International Conference on Certified …, 2018
432018
Scalable fine-grained proofs for formula processing
H Barbosa, JC Blanchette, M Fleury, P Fontaine
Journal of Automated Reasoning 64 (3), 485-510, 2020
422020
Semi-intelligible Isar proofs from machine-generated proofs
JC Blanchette, S Böhme, M Fleury, SJ Smolka, A Steckermeier
Journal of Automated Reasoning 56, 155-200, 2016
412016
Optimizing a verified SAT solver
M Fleury
NASA Formal Methods: 11th International Symposium, NFM 2019, Houston, TX …, 2019
292019
Foundational (co) datatypes and (co) recursion for higher-order logic
J Biendarra, JC Blanchette, A Bouzy, M Desharnais, M Fleury, J Hölzl, ...
Frontiers of Combining Systems: 11th International Symposium, FroCoS 2017 …, 2017
212017
Gimsatul, IsaSAT and Kissat entering the SAT competition 2022
A Biere, M Fleury, T Balyo, M Heule, M Iser, M Järvisalo, M Suda
Proc. of SAT Competition, 10-11, 2022
202022
Reconstructing veriT proofs in Isabelle/HOL
M Fleury, HJ Schurr
arXiv preprint arXiv:1908.09480, 2019
172019
Distributed cube and conquer with paracooba
M Heisinger, M Fleury, A Biere
Theory and Applications of Satisfiability Testing–SAT 2020: 23rd …, 2020
162020
Better decision heuristics in CDCL through local search and target phases
S Cai, X Zhang, M Fleury, A Biere
Journal of Artificial Intelligence Research 74, 1515-1563, 2022
152022
Alethe: Towards a generic SMT proof format
HJ Schurr, M Fleury, H Barbosa, P Fontaine
arXiv preprint arXiv:2107.02354, 2021
152021
Reliable Reconstruction of Fine-grained Proofs in a Proof Assistant.
HJ Schurr, M Fleury, M Desharnais
CADE 28, 450-467, 2021
152021
SPASS-SATT: A CDCL (LA) Solver
M Bromberger, M Fleury, S Schwarz, C Weidenbach
Automated Deduction–CADE 27: 27th International Conference on Automated …, 2019
152019
Nested multisets, hereditary multisets, and syntactic ordinals in Isabelle/HOL
JC Blanchette, M Fleury, D Traytel
2nd International Conference on Formal Structures for Computation and …, 2017
142017
Chasing target phases
A Biere, M Fleury
Workshop on the Pragmatics of SAT, 2020
122020
Pacheck and Pastèque, checking practical algebraic calculus proofs
D Kaufmann, M Fleury, A Biere
FMCAD 2020 1, 264-269, 2020
102020
Better SMT proofs for easier reconstruction
H Barbosa, JC Blanchette, M Fleury, P Fontaine, HJ Schurr
AITP 2019-4th Conference on Artificial Intelligence and Theorem Proving, 2019
102019
Formalization of logical calculi in Isabelle/HOL
M Fleury
Saarländische Universitäts-und Landesbibliothek, 2020
92020
CaDiCaL, Lingeling, Plingeling, Treengeling, and YalSAT entering the SAT competition
A Biere, K Fazekas, M Fleury, M Heisinger
7*2017
The system can't perform the operation now. Try again later.
Articles 1–20