Mathias Fleury
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
23
Venues
9
Active years
2016–2026
Best venue rank
A*
Where they publish
Papers
23 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | SAT | Factoring Learned Clauses. | Florian Pollitt, Zachary Battleman, Mathias Fleury, Yakir Vizel, Marijn J. H. Heule, Armin Biere, Randal E. Bryant |
| 2026 | SAT | CaDiCaL 3.0 (Tool Paper). | Florian Pollitt, Mathias Fleury, Katalin Fazekas, Nils Froleyks, Andr Schidler, Dominik Schreiber, Armin Biere |
| 2026 | TACAS | Real-time Proof Checking for Distributed Incremental SAT Solving. | Dominik Schreiber, Mathias Fleury, Katalin Fazekas, Armin Biere |
| 2025 | ITP | Improving the SMT Proof Reconstruction Pipeline in Isabelle/HOL. | Hanna Lachnitt, Mathias Fleury, Haniel Barbosa, Jibiana Jakpor, Bruno Andreotti, Andrew Reynolds, Hans-Jrg Schurr, Clark W. Barrett, Cesare Tinelli |
| 2025 | SAT | Learn to Unlearn. | Bernhard Gstrein, Florian Pollitt, Andr Schidler, Mathias Fleury, Armin Biere |
| 2024 | CAV | CaDiCaL 2.0. | Armin Biere, Tobias Faller, Katalin Fazekas, Mathias Fleury, Nils Froleyks, Florian Pollitt |
| 2024 | FMCAD | Clausal Equivalence Sweeping. | Armin Biere, Katalin Fazekas, Mathias Fleury, Nils Froleyks |
| 2024 | LPAR | Certifying Incremental SAT Solving. | Katalin Fazekas, Florian Pollitt, Mathias Fleury, Armin Biere |
| 2024 | SAT | Clausal Congruence Closure. | Armin Biere, Katalin Fazekas, Mathias Fleury, Nils Froleyks |
| 2024 | SAT | Lazy Reimplication in Chronological Backtracking. | Robin Coutelier, Mathias Fleury, Laura Kovcs |
| 2024 | TACAS | IsaRare: Automatic Verification of SMT Rewrites in Isabelle/HOL. | Hanna Lachnitt, Mathias Fleury, Leni Aniva, Andrew Reynolds, Haniel Barbosa, Andres Ntzli, Clark W. Barrett, Cesare Tinelli |
| 2023 | CADE | A More Pragmatic CDCL for IsaSAT and Targetting LLVM (Short Paper). | Mathias Fleury, Peter Lammich |
| 2023 | SAT | The SAT Museum. | Armin Biere, Mathias Fleury, Nils Froleyks, Marijn J. H. Heule |
| 2023 | SAT | Faster LRAT Checking Than Solving with CaDiCaL. | Florian Pollitt, Mathias Fleury, Armin Biere |
| 2021 | CADE | Reliable Reconstruction of Fine-grained Proofs in a Proof Assistant. | Hans-Jrg Schurr, Mathias Fleury, Martin Desharnais |
| 2021 | SAT | Efficient All-UIP Learned Clause Minimization. | Mathias Fleury, Armin Biere |
| 2020 | FMCAD | The Proof Checkers Pacheck and Pastque for the Practical Algebraic Calculus. | Daniela Kaufmann, Mathias Fleury, Armin Biere |
| 2020 | LPAR | A Verified SAT Solver Framework including Optimization and Partial Valuations. | Mathias Fleury, Christoph Weidenbach |
| 2020 | SAT | Distributed Cube and Conquer with Paracooba. | Maximilian Heisinger, Mathias Fleury, Armin Biere |
| 2019 | CADE | SPASS-SATT - A CDCL(LA) Solver. | Martin Bromberger, Mathias Fleury, Simon Schwarz, Christoph Weidenbach |
| 2018 | CPP | A verified SAT solver with watched literals using imperative HOL. | Mathias Fleury, Jasmin Christian Blanchette, Peter Lammich |
| 2017 | IJCAI | A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality. | Jasmin Christian Blanchette, Mathias Fleury, Christoph Weidenbach |
| 2016 | CADE | A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality. | Jasmin Christian Blanchette, Mathias Fleury, Christoph Weidenbach |