-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathindex.xml
117 lines (117 loc) · 77.6 KB
/
index.xml
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
<channel>
<title>Webpage of Mathias Fleury</title>
<link>https://m-fleury.github.io/</link>
<description>Recent content on Webpage of Mathias Fleury</description>
<generator>Hugo</generator>
<language>en-us</language>
<lastBuildDate>Tue, 10 Sep 2024 21:04:00 +0200</lastBuildDate>
<atom:link href="https://m-fleury.github.io/index.xml" rel="self" type="application/rss+xml" />
<item>
<title>About me</title>
<link>https://m-fleury.github.io/duties/</link>
<pubDate>Tue, 02 Jan 2024 00:00:00 +0000</pubDate>
<guid>https://m-fleury.github.io/duties/</guid>
<description><p>As part of my university job at the University Freiburg, I <a href="https://m-fleury.github.io/publications/">publish papers</a>, <a href="https://m-fleury.github.io/academic/">rewiew others</a>, <a href="https://cca.informatik.uni-freiburg.de/teaching/">teach</a>, but also do some <a href="https://m-fleury.github.io/university">administrative tasks</a>.</p>
<p>I am currently working on my habilitation (you can find a <a href="https://m-fleury.github.io/ox-hugo/habilitation.pdf">draft here</a>)</p></description>
</item>
<item>
<title>IsaSAT Releases</title>
<link>https://m-fleury.github.io/isasat/isasat-release/</link>
<pubDate>Sat, 22 Jul 2023 00:00:00 +0000</pubDate>
<guid>https://m-fleury.github.io/isasat/isasat-release/</guid>
<description><h2 id="h:2024-sc2024">SAT Competition 2024</h2>
<p>There is not much to tell for the <a href="../../src/isasat/isasat-sc2024.tar.xz">release</a> for this year of the SAT
Competition 2024. This year, I finished last, exactly as
expected. However, I am very close to the second-to-last on SAT
benchmarks.</p>
<p>My main performance problem seems to be UNSAT problems, which I blame
on missing preprocessing. I intended to implement variable elimination
based on the model reconstruction implemented in Katharina Wagner&rsquo;s
Master&rsquo;s thesis in Isabelle. I actually started to implement it, but,
as usual, once I went to proofs, things became more complicated. But
it is interesting.</p></description>
</item>
<item>
<title>Academic Duties</title>
<link>https://m-fleury.github.io/academic/</link>
<pubDate>Tue, 23 May 2023 00:00:00 +0000</pubDate>
<guid>https://m-fleury.github.io/academic/</guid>
<description><p>List of the PCs I took part in. I do not include subreviews in the list.</p>
<h2 id="h:academic-duties-2024">2024</h2>
<ul>
<li>Chair of iFM-AE</li>
<li>PC of <a href="http://i-cav.org/2024/organization/">CAV 2024 - Artifact Evaluation, 35th International Conference on Computer-Aided Verification</a></li>
</ul>
<h2 id="h:academic-duties-2023">2023</h2>
<ul>
<li>PC of SBMF 2023</li>
<li>PC of <a href="https://frocos2023.github.io/">Frocos 2023</a></li>
<li>PC of <a href="https://fmcad.org/FMCAD23/">FMCAD'23</a></li>
<li>PC of <a href="https://fmcad.org/FMCAD23/">FMCAD'23 student forum</a></li>
<li>PC of <a href="https://eapls.org/items/4229/">iFM artefact evaluation</a></li>
<li>PC of <a href="http://i-cav.org/2023/organization/">CAV 2023 - Artifact Evaluation, 34th International Conference on Computer-Aided Verification</a></li>
<li>Review for <a href="https://www.springer.com/journal/11786">Mathematics in Computer Science</a></li>
</ul>
<h2 id="h:academic-duties-2022">2022</h2>
<ul>
<li>PC of <a href="https://fmcad.org/FMCAD22/student_forum/">the stundent forum of FMCAD22, Formal Methods in Computer-Aided Design</a></li>
<li>PC of <a href="http://i-cav.org/2022/organization/">CAV 2022 - Artifact Evaluation, 34th International Conference on Computer-Aided Verification</a></li>
<li>PC of <a href="https://ijcar.org/">IJCAR 2022 - International Joint Conference on Automated Reasoning</a></li>
<li>PC of <a href="https://etaps.org/2022/tacas">TACAS - Artefact Evaluation, 28th International Conference on Tools and Algorithms for the Construction and Analysis of Systems</a></li>
</ul>
<h2 id="h:academic-duties-2021">2021</h2>
<ul>
<li>Co-chair of <a href="http://pxtp.gitlab.io/2021/">PxTP 2021, Seventh Workshop on Proof eXchange for Theorem Proving</a></li>
<li>Review for <a href="https://www.jair.org/index.php/jair">Journal of Artificial Intelligence</a></li>
<li>PC of <a href="http://i-cav.org/2021/organization/">CAV 2021 - Artifact Evaluation, 33rd International Conference on Computer-Aided Verification</a></li>
<li>PC of <a href="https://pdar-workshop.github.io/workshop/">PDAR-21, Parallel and Distributed Automated Reasoning 2021</a></li>
<li>PC of <a href="https://etaps.org/2021/tacas">TACAS - Artefact Evaluation, 27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems</a></li>
</ul>
<h2 id="h:academic-duties-2020">2020</h2>
<ul>
<li>PC of <a href="https://tap.sosy-lab.org/2020/">TAP 20 - Artefact Evaluation, 14th International Conference on Tests and Proofs 20</a></li>
<li>PC of <a href="https://popl20.sigplan.org/committee/VMCAI-2020-papers-artifact-evaluation-committee">VMCAI-20 - Artefact Evaluation, 21st International Conference on Verification, Model Checking, and Abstract Interpretation</a></li>
</ul>
<h2 id="h:academic-duties-2019">2019</h2>
<ul>
<li>PC of <a href="http://pxtp.gforge.inria.fr/2019/">PxTP 2019, Seventh Workshop on Proof eXchange for Theorem Proving</a></li>
</ul></description>
</item>
<item>
<title>Publications</title>
<link>https://m-fleury.github.io/publications/</link>
<pubDate>Tue, 23 May 2023 00:00:00 +0000</pubDate>
<guid>https://m-fleury.github.io/publications/</guid>
<description><p>This webpage is also available as long version <a href="https://m-fleury.github.io/publications-long">with the bibtex entries</a>.</p>
<h2 id="2024">2024</h2>
<h3 id="robin-coutelier-mathias-fleury-and-laura-kovács-lazy-reimplication-in-chronological-backtracking">Robin Coutelier, Mathias Fleury and Laura Kovács, Lazy Reimplication in Chronological Backtracking</h3>
<table>
 <thead>
 <tr>
 <th style="text-align: left"></th>
 <th style="text-align: left"></th>
 </tr>
 </thead>
 <tbody>
 <tr>
 <td style="text-align: left">SAT 2024</td>
 <td style="text-align: left"><a href="https://cca.informatik.uni-freiburg.de/papers/CoutelierFleuryKovacs-SAT24-preprint.pdf">preprint</a></td>
 </tr>
 </tbody>
</table>
<h3 id="armin-biere-katalin-fazekas-mathias-fleury-and-nils-frolekys-clausal-congruence-closure">Armin Biere, Katalin Fazekas, Mathias Fleury and Nils Frolekys, Clausal Congruence Closure</h3>
<table>
 <thead>
 <tr>
 <th style="text-align: left"></th>
 <th style="text-align: left"></th>
 </tr>
 </thead>
 <tbody>
 <tr>
 <td style="text-align: left">SAT 2024</td>
 <td style="text-align: left"><a href="https://cca.informatik.uni-freiburg.de/papers/BiereFazekasFleuryFroleyks-SAT24-preprint.pdf">preprint</a></td>
 </tr>
 </tbody>
</table>
<h3 id="armin-biere-tobias-faller-katalin-fazekas-mathias-fleury-nils-froleyks-and-florian-pollitt-cadical-2-dot-0">Armin Biere, Tobias Faller Katalin Fazekas, Mathias Fleury, Nils Froleyks and Florian Pollitt, CaDiCaL 2.0</h3>
<table>
 <thead>
 <tr>
 <th style="text-align: left"></th>
 <th style="text-align: left"></th>
 </tr>
 </thead>
 <tbody>
 <tr>
 <td style="text-align: left">CAV 2024</td>
 <td style="text-align: left"><a href="https://cca.informatik.uni-freiburg.de/papers/BiereFallerFazekasFleuryFroleyksPollitt-CAV24.pdf">paper</a></td>
 </tr>
 </tbody>
</table>
<h3 id="katalin-fazekas-florian-pollitt-mathias-fleury-and-armin-biere-certifying-incremental-sat-solving">Katalin Fazekas, Florian Pollitt, Mathias Fleury and Armin Biere, Certifying Incremental SAT Solving</h3>
<table>
 <thead>
 <tr>
 <th style="text-align: left"></th>
 <th style="text-align: left"></th>
 </tr>
 </thead>
 <tbody>
 <tr>
 <td style="text-align: left">LPAR 2024</td>
 <td style="text-align: left"><a href="https://cca.informatik.uni-freiburg.de/papers/FazekasPollittFleuryBiere-LPAR24.pdf">paper</a></td>
 </tr>
 </tbody>
</table>
<h3 id="hanna-lachnitt-mathias-fleury-leni-aniva-andrew-reynolds-haniel-barbosa-andres-nötzli-clark-barrett-and-cesare-tinelli-isarare-automatic-verification-of-smt-rewrites-in-isabelle-hol">Hanna Lachnitt, Mathias Fleury, Leni Aniva, Andrew Reynolds, Haniel Barbosa, Andres Nötzli, Clark Barrett, and Cesare Tinelli, IsaRare: Automatic Verification of SMT Rewrites in Isabelle/HOL</h3>
<table>
 <thead>
 <tr>
 <th style="text-align: left"></th>
 <th style="text-align: left"></th>
 </tr>
 </thead>
 <tbody>
 <tr>
 <td style="text-align: left">TACAS'24</td>
 <td style="text-align: left"><a href="https://m-fleury.github.io/ox-hugo/LachnittFleuryAnivaReynoldsBarbosaNoetzliBarrettTinelli-TACAS24.pdf">Preprint</a></td>
 </tr>
 </tbody>
</table>
<h3 id="katalin-fazekas-florian-pollitt-mathias-fleury-and-armin-biere-incremental-proofs-for-bounded-model-checking-dot">Katalin Fazekas, Florian Pollitt, Mathias Fleury, and Armin Biere, Incremental Proofs for Bounded Model Checking.</h3>
<table>
 <thead>
 <tr>
 <th style="text-align: left"></th>
 <th style="text-align: left"></th>
 </tr>
 </thead>
 <tbody>
 <tr>
 <td style="text-align: left">MBMV'24</td>
 <td style="text-align: left"><a href="https://cca.informatik.uni-freiburg.de/papers/FazekasPollittFleuryBiere-MBMV24.pdf">Preprint</a></td>
 </tr>
 </tbody>
</table>
<h3 id="mathias-fleury-and-daniela-kaufmann-lifespan-of-sat-techniques">Mathias Fleury and Daniela Kaufmann, Lifespan of SAT techniques</h3>
<table>
 <thead>
 <tr>
 <th style="text-align: left"></th>
 <th style="text-align: left"></th>
 </tr>
 </thead>
 <tbody>
 <tr>
 <td style="text-align: left">Arxiv version of <a href="http://www.pragmaticsofsat.org/2023/#accepted">POS 23</a></td>
 <td style="text-align: left"><a href="https://arxiv.org/abs/2402.01202">https://arxiv.org/abs/2402.01202</a></td>
 </tr>
 </tbody>
</table>
<h2 id="2023">2023</h2>
<h3 id="hanna-lachnitt-mathias-fleury-leni-aniva-andrew-reynolds-haniel-barbosa-andres-noetzli-clark-w-dot-barrett-and-cesare-tinelli-automatic-verification-of-smt-rewrites-in-isabelle-hol">Hanna Lachnitt, Mathias Fleury, Leni Aniva, Andrew Reynolds, Haniel Barbosa, Andres Noetzli, Clark W. Barrett and Cesare Tinelli, Automatic Verification of {SMT} Rewrites in Isabelle/HOL</h3>
<table>
 <thead>
 <tr>
 <th style="text-align: left"></th>
 <th style="text-align: left"></th>
 </tr>
 </thead>
 <tbody>
 <tr>
 <td style="text-align: left">SMT Workshop 2023</td>
 <td style="text-align: left"><a href="https://ceur-ws.org/Vol-3429/abstract14.pdf">Abstract</a></td>
 </tr>
 </tbody>
</table>
<h3 id="armin-biere-mathias-fleury-and-florian-pollitt-cadical-vivinst-isasat-gimsatul-kissat-and-tabularasat-entering-the-sat-competition-2023">Armin Biere, Mathias Fleury, and Florian Pollitt, CaDiCaL_vivinst, IsaSAT, Gimsatul, Kissat, and TabularaSAT Entering the SAT Competition 2023</h3>
<table>
 <thead>
 <tr>
 <th style="text-align: left">SAT Competition 2023</th>
 <th style="text-align: left">system description</th>
 </tr>
 </thead>
 <tbody>
 <tr>
 <td style="text-align: left">(not reviewed)</td>
 <td style="text-align: left"></td>
 </tr>
 </tbody>
</table>
<h3 id="robin-trüby-mathias-fleury-and-armin-biere-verifying-floating-point-commutativity-with-grs">Robin Trüby, Mathias Fleury, and Armin Biere, Verifying Floating-Point Commutativity with GRS</h3>
<table>
 <thead>
 <tr>
 <th style="text-align: left">SAT Competition 2023</th>
 <th style="text-align: left">benchmarks</th>
 </tr>
 </thead>
 <tbody>
 <tr>
 <td style="text-align: left">(not reviewed)</td>
 <td style="text-align: left"></td>
 </tr>
 </tbody>
</table>
<h3 id="sonja-gurtner-lucas-klemmer-mathias-fleury-and-daniel-große-replacing-risc-v-instructions-by-others">Sonja Gurtner, Lucas Klemmer, Mathias Fleury and Daniel Große, Replacing RISC-V Instructions by Others</h3>
<table>
 <thead>
 <tr>
 <th style="text-align: left">SAT Competition 2023 benchmarks</th>
 <th style="text-align: left"></th>
 </tr>
 </thead>
 <tbody>
 <tr>
 <td style="text-align: left">(not reviewed)</td>
 <td style="text-align: left"></td>
 </tr>
 </tbody>
</table>
<h3 id="mathias-fleury-and-peter-lammich-a-more-pragmatic-cdcl-for-isasat-and-targetting-llvm--short-paper">Mathias Fleury and Peter Lammich, A more Pragmatic CDCL for IsaSAT and targetting LLVM (Short Paper)</h3>
<table>
 <thead>
 <tr>
 <th style="text-align: left">CADE 29</th>
 <th style="text-align: left"><a href="https://m-fleury.github.io/ox-hugo/FleuryLammich-CADE29.pdf">Preprint</a></th>
 <th style="text-align: left">Springer (OA, upcoming)</th>
 </tr>
 </thead>
 <tbody>
 <tr>
 <td style="text-align: left">29th International Conference on</td>
 <td style="text-align: left"></td>
 <td style="text-align: left"></td>
 </tr>
 <tr>
 <td style="text-align: left">Automated Deduction</td>
 <td style="text-align: left"></td>
 <td style="text-align: left"></td>
 </tr>
 </tbody>
</table>
<h3 id="florian-politt-mathias-fleury-and-armin-biere-efficient-proof-checking-with-lrat-in-cadical--work-in-progress">Florian Politt, Mathias Fleury, and Armin Biere, Efficient Proof Checking with LRAT in CaDiCaL (work in progress)</h3>
<table>
 <thead>
 <tr>
 <th style="text-align: left"></th>
 <th style="text-align: left"></th>
 <th style="text-align: left"></th>
 </tr>
 </thead>
 <tbody>
 <tr>
 <td style="text-align: left"><a href="https://cca.informatik.uni-freiburg.de/mbmv23/">MBMV 23</a></td>
 <td style="text-align: left"><a href="https://m-fleury.github.io/ox-hugo/PolittFleuryBiere-MBMV2023.pdf">Preprint</a></td>
 <td style="text-align: left"></td>
 </tr>
 </tbody>
</table>
<h3 id="florian-politt-mathias-fleury-and-armin-biere-faster-lrat-checking-than-solving-with-cadical">Florian Politt, Mathias Fleury, and Armin Biere, Faster LRAT Checking than Solving with CaDiCaL</h3>
<table>
 <thead>
 <tr>
 <th style="text-align: left"></th>
 <th style="text-align: left"></th>
 <th style="text-align: left"></th>
 </tr>
 </thead>
 <tbody>
 <tr>
 <td style="text-align: left"><a href="http://satisfiability.org/SAT23/">SAT23</a></td>
 <td style="text-align: left"><a href="https://m-fleury.github.io/ox-hugo/PolittFleuryBiere-SAT2023.pdf">Preprint</a></td>
 <td style="text-align: left"><a href="https://doi.org/10.4230/LIPIcs.SAT.2023.21">LiPiCS</a></td>
 </tr>
 </tbody>
</table>
<h3 id="mathias-fleury-and-daniela-kaufmann-lifespan-of-sat-techniques">Mathias Fleury and Daniela Kaufmann, Lifespan of SAT techniques</h3>
<table>
 <thead>
 <tr>
 <th style="text-align: left"><a href="http://www.pragmaticsofsat.org/2023/#accepted">POS 23</a></th>
 <th style="text-align: left"></th>
 </tr>
 </thead>
 <tbody>
 <tr>
 <td style="text-align: left">Pragmatics of SAT 23</td>
 <td style="text-align: left">Accepted</td>
 </tr>
 <tr>
 <td style="text-align: left"></td>
 <td style="text-align: left">(POS has no proceedings)</td>
 </tr>
 </tbody>
</table>
<h3 id="armin-biere-mathias-fleury-nils-froleyks-and-marijn-heule-dot-the-sat-museum">Armin Biere , Mathias Fleury , Nils Froleyks and Marijn Heule . The SAT Museum</h3>
<table>
 <thead>
 <tr>
 <th style="text-align: left"><a href="http://www.pragmaticsofsat.org/2023/#accepted">POS 23</a></th>
 <th style="text-align: left"></th>
 </tr>
 </thead>
 <tbody>
 <tr>
 <td style="text-align: left">Pragmatics of SAT 23</td>
 <td style="text-align: left">Accepted</td>
 </tr>
 <tr>
 <td style="text-align: left"></td>
 <td style="text-align: left">(POS has no proceedings)</td>
 </tr>
 </tbody>
</table>
<h2 id="2022">2022</h2>
<h3 id="mathias-fleury-and-armin-biere-scalable-proof-producing-multi-threaded-sat-solving-with-gimsatul-through-sharing-instead-of-copying-clauses">Mathias Fleury and Armin Biere, Scalable Proof Producing Multi-Threaded SAT Solving with Gimsatul through Sharing instead of Copying Clauses</h3>
<table>
 <thead>
 <tr>
 <th style="text-align: left">POS 22</th>
 <th style="text-align: left"><a href="https://arxiv.org/abs/2207.13577">arXiV</a></th>
 </tr>
 </thead>
 <tbody>
 <tr>
 <td style="text-align: left">Pragmatics of SAT 22</td>
 <td style="text-align: left">Accepted</td>
 </tr>
 <tr>
 <td style="text-align: left"></td>
 <td style="text-align: left">(POS has no proceedings)</td>
 </tr>
 </tbody>
</table>
<h3 id="shaowei-cai-xindi-zhang-mathias-fleury-and-armin-biere-better-decision-heuristics-in-cdcl-through-local-search-and-target-phases">Shaowei Cai, Xindi Zhang, Mathias Fleury, and Armin Biere, Better Decision Heuristics in CDCL through Local Search and Target Phases</h3>
<table>
 <thead>
 <tr>
 <th style="text-align: left">FMSD</th>
 <th style="text-align: left">JAIR</th>
 <th style="text-align: left"></th>
 </tr>
 </thead>
 <tbody>
 <tr>
 <td style="text-align: left">Accepted</td>
 <td style="text-align: left"></td>
 <td style="text-align: left"></td>
 </tr>
 </tbody>
</table>
<h3 id="daniela-kaufmann-mathias-fleury-armin-biere-and-manuel-kauers-practical-algebraic-calculus-and-nullstellensatz-with-the-checkers-pacheck-and-pastèque-and-nuss-checker">Daniela Kaufmann, Mathias Fleury, Armin Biere, and Manuel Kauers, Practical Algebraic Calculus and Nullstellensatz with the Checkers Pacheck and Pastèque and Nuss-Checker</h3>
<table>
 <thead>
 <tr>
 <th style="text-align: left">FMSD</th>
 <th style="text-align: left"><a href="https://danielakaufmann.at/wp-content/uploads/2022/03/KaufmannFleuryBiereKauers-FMSD.pdf">Preprint</a></th>
 <th style="text-align: left"><a href="https://link.springer.com/article/10.1007/s10703-022-00391-x">Springer</a></th>
 </tr>
 </thead>
 <tbody>
 <tr>
 <td style="text-align: left">Accepted</td>
 <td style="text-align: left"></td>
 <td style="text-align: left"></td>
 </tr>
 </tbody>
</table>
<h2 id="2021">2021</h2>
<h3 id="mathias-fleury-and-armin-biere-efficient-all-uip-learned-clause-minimization">Mathias Fleury and Armin Biere, Efficient All-UIP Learned Clause Minimization</h3>
<table>
 <thead>
 <tr>
 <th style="text-align: left">SAT'21, LNCS</th>
 <th style="text-align: left"><a href="https://m-fleury.github.io/ox-hugo/FleuryBiere-SAT2021.pdf">Preprint</a></th>
 <th style="text-align: left"><a href="https://link.springer.com/chapter/10.1007/978-3-030-80223-3_12">Springer</a></th>
 </tr>
 </thead>
 <tbody>
 <tr>
 <td style="text-align: left">Proc. 24rd Intl. Conf. on Theory and</td>
 <td style="text-align: left"></td>
 <td style="text-align: left"></td>
 </tr>
 <tr>
 <td style="text-align: left">Applications of Satisfiability Testing</td>
 <td style="text-align: left"></td>
 <td style="text-align: left"></td>
 </tr>
 </tbody>
</table>
<h3 id="mathias-fleury-and-armin-biere-efficient-all-uip-learned-clause-minimization--extended-version">Mathias Fleury and Armin Biere, Efficient All-UIP Learned Clause Minimization (Extended Version)</h3>
<table>
 <thead>
 <tr>
 <th style="text-align: left"></th>
 <th style="text-align: left"></th>
 <th style="text-align: left"></th>
 </tr>
 </thead>
 <tbody>
 <tr>
 <td style="text-align: left">Technical Report</td>
 <td style="text-align: left"><a href="https://m-fleury.github.io/ox-hugo/FleuryBiere-FMV-TR-21-3.pdf">PDF</a></td>
 <td style="text-align: left"><a href="https://epub.jku.at/obvulioa/content/titleinfo/6134601">JKU ePUB</a></td>
 </tr>
 </tbody>
</table>
<h3 id="hans-jörg-schurr-mathias-fleury-and-martin-desharnais-reliable-reconstruction-of-fine-grained-proofs-in-a-proof-assistant">Hans-Jörg Schurr, Mathias Fleury, and Martin Desharnais, Reliable Reconstruction of Fine-grained Proofs in a Proof Assistant</h3>
<table>
 <thead>
 <tr>
 <th style="text-align: left">CADE 28</th>
 <th style="text-align: left"></th>
 <th style="text-align: left"><a href="https://link.springer.com/chapter/10.1007/978-3-030-79876-5_26">Springer</a> (Open Access)</th>
 </tr>
 </thead>
 <tbody>
 <tr>
 <td style="text-align: left">28th International Conference on</td>
 <td style="text-align: left"></td>
 <td style="text-align: left"></td>
 </tr>
 <tr>
 <td style="text-align: left">Automated Deduction</td>
 <td style="text-align: left"></td>
 <td style="text-align: left"></td>
 </tr>
 </tbody>
</table>
<h3 id="mathias-fleury-isasat-and-kissat-entering-the-eda-challenge-2021">Mathias Fleury, IsaSAT and Kissat entering the EDA Challenge 2021</h3>
<table>
 <thead>
 <tr>
 <th style="text-align: left"></th>
 <th style="text-align: left"></th>
 <th style="text-align: left"></th>
 </tr>
 </thead>
 <tbody>
 <tr>
 <td style="text-align: left">Submitted to the EDA Challenge 2021</td>
 <td style="text-align: left"><a href="https://m-fleury.github.io/ox-hugo/Fleury-EDA-Challenge-2021.pdf">PDF</a></td>
 <td style="text-align: left"></td>
 </tr>
 </tbody>
</table>
<h3 id="hans-jörg-schurr-mathias-fleury-haniel-barbosa-and-pascal-fontaine-alethe-towards-a-generic-smt-proof-format--extended-abstract">Hans-Jörg Schurr, Mathias Fleury, Haniel Barbosa, and Pascal Fontaine Alethe: Towards a Generic SMT Proof Format (extended abstract)</h3>
<table>
 <thead>
 <tr>
 <th style="text-align: left">PxTP'21</th>
 <th style="text-align: left"><a href="http://eptcs.web.cse.unsw.edu.au/paper.cgi?PxTP2021.6.pdf">PDF</a></th>
 <th style="text-align: left"><a href="http://eptcs.web.cse.unsw.edu.au/paper.cgi?PxTP2021.6">EPTCS</a></th>
 </tr>
 </thead>
 <tbody>
 <tr>
 <td style="text-align: left">Proof Exchange on</td>
 <td style="text-align: left"></td>
 <td style="text-align: left"></td>
 </tr>
 <tr>
 <td style="text-align: left">Theorem Proving</td>
 <td style="text-align: left"></td>
 <td style="text-align: left"></td>
 </tr>
 </tbody>
</table>
<h2 id="2020">2020</h2>
<h3 id="maximilian-heisinger-mathias-fleury-and-armin-biere-distributed-cube-and-conquer-with-paracooba">Maximilian Heisinger, Mathias Fleury, and Armin Biere, Distributed Cube and Conquer with Paracooba</h3>
<table>
 <thead>
 <tr>
 <th style="text-align: left">SAT'20, LNCS</th>
 <th style="text-align: left"><a href="./papers/HeisingerFleuryBiere-SAT2020.pdf">Preprint</a></th>
 <th style="text-align: left"><a href="https://link.springer.com/chapter/10.1007%2F978-3-030-51825-7_9">Springer</a></th>
 </tr>
 </thead>
 <tbody>
 <tr>
 <td style="text-align: left">Proc. 23rd Intl. Conf. on Theory and</td>
 <td style="text-align: left"></td>
 <td style="text-align: left"></td>
 </tr>
 <tr>
 <td style="text-align: left">Applications of Satisfiability Testing</td>
 <td style="text-align: left"></td>
 <td style="text-align: left"></td>
 </tr>
 </tbody>
</table>
<h3 id="daniela-kaufmann-mathias-fleury-and-armin-biere-dot-the-proof-checkers-pacheck-and-pastèque-for-the-practical-algebraic-calculus">Daniela Kaufmann, Mathias Fleury, and Armin Biere. The Proof Checkers Pacheck and Pastèque for the Practical Algebraic Calculus</h3>
<table>
 <thead>
 <tr>
 <th style="text-align: left">FMCAD'20</th>
 <th style="text-align: left"><a href="https://m-fleury.github.io/ox-hugo/KaufmannFleuryBiere-FMCAD20.pdf">Preprint</a></th>
 <th style="text-align: left"><a href="https://ieeexplore.ieee.org/document/9283640">IEEE</a></th>
 </tr>
 </thead>
 <tbody>
 <tr>
 <td style="text-align: left">Proc. Intl. Conf. on Formal Methods</td>
 <td style="text-align: left"></td>
 <td style="text-align: left"></td>
 </tr>
 <tr>
 <td style="text-align: left">in Computer Aided Design</td>
 <td style="text-align: left"></td>
 <td style="text-align: left"></td>
 </tr>
 </tbody>
</table>
<h3 id="mathias-fleury-and-daniela-kaufmann-dot-practical-algebraic-calculus-checker-dot-archive-of-formal-proofs-formal-development">Mathias Fleury and Daniela Kaufmann. Practical Algebraic Calculus Checker. Archive of Formal Proofs Formal Development</h3>
<table>
 <thead>
 <tr>
 <th style="text-align: left">AFP</th>
 <th style="text-align: left"><a href="https://www.isa-afp.org/entries/PAC_Checker.html">AFP entry</a></th>
 <th style="text-align: left"></th>
 </tr>
 </thead>
 <tbody>
 <tr>
 <td style="text-align: left">Archive of Formal Proofs</td>
 <td style="text-align: left"></td>
 <td style="text-align: left"></td>
 </tr>
 </tbody>
</table>
<h3 id="mathias-fleury-and-christoph-weidenbach-dot-a-verified-sat-solver-framework-including-optimization-and-partial-valuations">Mathias Fleury and Christoph Weidenbach. A Verified SAT Solver Framework including Optimization and Partial Valuations</h3>
<table>
 <thead>
 <tr>
 <th style="text-align: left">LPAR-23</th>
 <th style="text-align: left"><a href="https://easychair.org/publications/open/b7Cr">PDF</a></th>
 <th style="text-align: left"><a href="https://easychair.org/publications/paper/b7Cr">EasyChair</a></th>
 </tr>
 </thead>
 <tbody>
 <tr>
 <td style="text-align: left">23rd International Conference on Logic for Programming,</td>
 <td style="text-align: left"></td>
 <td style="text-align: left"></td>
 </tr>
 <tr>
 <td style="text-align: left">Artificial Intelligence and Reasoning,</td>
 <td style="text-align: left"></td>
 <td style="text-align: left"></td>
 </tr>
 </tbody>
</table>
<h3 id="mathias-fleury-formalization-of-logical-calculi-in-isabelle-hol--phd-thesis">Mathias Fleury, Formalization of Logical Calculi in Isabelle/HOL (PhD thesis)</h3>
<table>
 <thead>
 <tr>
 <th style="text-align: left"></th>
 <th style="text-align: left"></th>
 <th style="text-align: left"></th>
 </tr>
 </thead>
 <tbody>
 <tr>
 <td style="text-align: left">PhD thesis</td>
 <td style="text-align: left"><a href="https://m-fleury.github.io/ox-hugo/Fleury-thesis.pdf">PDF</a></td>
 <td style="text-align: left"><a href="https://publikationen.sulb.uni-saarland.de/handle/20.500.11880/28722">University of Saarland</a></td>
 </tr>
 </tbody>
</table>
<h2 id="2019">2019</h2>
<h3 id="mathias-fleury-dot-optimizing-a-verified-sat-solver">Mathias Fleury. Optimizing a Verified SAT Solver</h3>
<table>
 <thead>
 <tr>
 <th style="text-align: left">NFM-19</th>
 <th style="text-align: left"><a href="https://m-fleury.github.io/ox-hugo/Fleury-NFM19.pdf">Preprint</a></th>
 <th style="text-align: left"><a href="https://link.springer.com/chapter/10.1007/978-3-030-20652-9_10">Springer</a></th>
 </tr>
 </thead>
 <tbody>
 <tr>
 <td style="text-align: left">NASA Formal Methods -</td>
 <td style="text-align: left"></td>
 <td style="text-align: left"></td>
 </tr>
 <tr>
 <td style="text-align: left">11th International Symposium</td>
 <td style="text-align: left"></td>
 <td style="text-align: left"></td>
 </tr>
 </tbody>
</table>
<h3 id="mathias-fleury-and-hans-jörg-schurr-reconstructing-verit-proofs-in-isabelle-hol-dot">Mathias Fleury and Hans-Jörg Schurr, Reconstructing veriT proofs in Isabelle/HOL.</h3>
<table>
 <thead>
 <tr>
 <th style="text-align: left">PxTP 2019</th>
 <th style="text-align: left"></th>
 <th style="text-align: left"><a href="https://arxiv.org/abs/1908.09480v1">Arxiv</a></th>
 </tr>
 </thead>
 <tbody>
 <tr>
 <td style="text-align: left">Sixth Workshop on</td>
 <td style="text-align: left"></td>
 <td style="text-align: left"></td>
 </tr>
 <tr>
 <td style="text-align: left">Proof eXchange for Theorem Proving</td>
 <td style="text-align: left"></td>
 <td style="text-align: left"></td>
 </tr>
 </tbody>
</table>
<h3 id="martin-bromberger-mathias-fleury-simon-schwarz-and-christoph-weidenbach-spass-satt-a-cdcl--la--solver-dot">Martin Bromberger, Mathias Fleury, Simon Schwarz, and Christoph Weidenbach, SPASS-SATT a CDCL(LA) Solver.</h3>
<table>
 <thead>
 <tr>
 <th style="text-align: left">CADE 27</th>
 <th style="text-align: left"><a href="https://link.springer.com/chapter/10.1007%2F978-3-030-29436-6_7">Springer</a></th>
 <th style="text-align: left"><a href="https://hal.inria.fr/hal-02405524/document">HAL</a></th>
 </tr>
 </thead>
 <tbody>
 <tr>
 <td style="text-align: left">27th International Conference on</td>
 <td style="text-align: left"></td>
 <td style="text-align: left"></td>
 </tr>
 <tr>
 <td style="text-align: left">Automated Deduction</td>
 <td style="text-align: left"></td>
 <td style="text-align: left"></td>
 </tr>
 </tbody>
</table>
<h3 id="haniel-barbosa-jasmin-blanchette-mathias-fleury-and-pascal-fontaine-dot-scalable-fine-grained-proofs-for-formula-processing-dot">Haniel Barbosa, Jasmin Blanchette, Mathias Fleury, and Pascal Fontaine. Scalable fine-grained proofs for formula processing.</h3>
<table>
 <thead>
 <tr>
 <th style="text-align: left">JAR 20</th>
 <th style="text-align: left"><a href="https://link.springer.com/article/10.1007/s10817-018-09502-y">Springer</a></th>
 <th style="text-align: left"><a href="https://hal.inria.fr/hal-01590922/document">HAL</a></th>
 </tr>
 </thead>
 <tbody>
 <tr>
 <td style="text-align: left">Journal of Automated Reasonning</td>
 <td style="text-align: left"></td>
 <td style="text-align: left"></td>
 </tr>
 </tbody>
</table>
<h2 id="2018">2018</h2>
<h3 id="jasmin-blanchette-mathias-fleury-peter-lammich-and-christoph-weidenbach-dot-a-verified-sat-solver-framework-with-learn-forget-restart-and-incrementality">Jasmin Blanchette, Mathias Fleury, Peter Lammich, and Christoph Weidenbach. A verified SAT solver framework with learn, forget, restart and incrementality</h3>
<table>
 <thead>
 <tr>
 <th style="text-align: left">JAR 18</th>
 <th style="text-align: left"><a href="https://link.springer.com/article/10.1007/s10817-018-9455-7">Springer</a></th>
 <th style="text-align: left">(Open Access)</th>
 </tr>
 </thead>
 <tbody>
 <tr>
 <td style="text-align: left">Journal of Automated Reasonning</td>
 <td style="text-align: left"></td>
 <td style="text-align: left"></td>
 </tr>
 </tbody>
</table>
<h3 id="jasmin-blanchette-mathias-fleury-and-peter-lammich-dot-a-verified-sat-solver-with-watched-literals-using-imperative-hol-dot">Jasmin Blanchette, Mathias Fleury, and Peter Lammich. A Verified SAT Solver with Watched Literals Using Imperative HOL.</h3>
<table>
 <thead>
 <tr>
 <th style="text-align: left">CPP 18</th>
 <th style="text-align: left"><a href="https://dl.acm.org/doi/10.1145/3167080">ACM</a></th>
 <th style="text-align: left"><a href="https://matryoshka-project.github.io/pubs/sat_2wl_paper.pdf">Matryoshka</a></th>
 </tr>
 </thead>
 <tbody>
 <tr>
 <td style="text-align: left">7th ACM SIGPLAN International Conference on</td>
 <td style="text-align: left"></td>
 <td style="text-align: left"></td>
 </tr>
 <tr>
 <td style="text-align: left">Certified Programs and Proofs</td>
 <td style="text-align: left"></td>
 <td style="text-align: left"></td>
 </tr>
 </tbody>
</table>
<h2 id="2017">2017</h2>
<h3 id="jasmin-blanchette-mathias-fleury-christoph-weidenbach-dot-a-verified-sat-solver-framework-with-learn-forget-restart-and-incrementality-dot">Jasmin Blanchette, Mathias Fleury, Christoph Weidenbach. A verified SAT solver framework with learn, forget, restart and incrementality.</h3>
<table>
 <thead>
 <tr>
 <th style="text-align: left">IJCAI 17</th>
 <th style="text-align: left"><a href="https://www.ijcai.org/Proceedings/2017/0667.pdf">IJCAI</a></th>
 <th style="text-align: left"></th>
 </tr>
 </thead>
 <tbody>
 <tr>
 <td style="text-align: left">Twenty-Sixth International Joint Conference on</td>
 <td style="text-align: left"></td>
 <td style="text-align: left"></td>
 </tr>
 <tr>
 <td style="text-align: left">Artificial Intelligence</td>
 <td style="text-align: left"></td>
 <td style="text-align: left"></td>
 </tr>
 </tbody>
</table>
<h3 id="julian-biendarra-jasmin-blanchette-aymeric-bouzy-martin-desharnais-mathias-fleury-johannes-hölzl-ondřej-kunčar-andreas-lochbihler-fabian-meier-lorenz-panny-andrei-popescu-christian-sternagel-rené-thiemann-and-dmitriy-traytel-dot-foundational--co--datatypes-and--co--recursion-for-higher-order-logic-dot">Julian Biendarra, Jasmin Blanchette, Aymeric Bouzy, Martin Desharnais, Mathias Fleury, Johannes Hölzl, Ondřej Kunčar, Andreas Lochbihler, Fabian Meier, Lorenz Panny, Andrei Popescu, Christian Sternagel, René Thiemann, and Dmitriy Traytel. Foundational (co)datatypes and (co)recursion for higher-order logic.</h3>
<table>
 <thead>
 <tr>
 <th style="text-align: left">FroCoS 2017</th>
 <th style="text-align: left"><a href="https://dl.acm.org/doi/10.1145/3167080">ACM</a></th>
 <th style="text-align: left"><a href="https://matryoshka-project.github.io/pubs/co_data_invited.pdf">Matryoshka</a></th>
 </tr>
 </thead>
 <tbody>
 <tr>
 <td style="text-align: left">11th International Symposium on</td>
 <td style="text-align: left"></td>
 <td style="text-align: left"></td>
 </tr>
 <tr>
 <td style="text-align: left">Frontiers of Combining Systems</td>
 <td style="text-align: left"></td>
 <td style="text-align: left"></td>
 </tr>
 </tbody>
</table>
<h3 id="jasmin-blanchette-mathias-fleury-and-dmitriy-traytel-dot-nested-multisets-hereditary-multisets-and-syntactic-ordinals-in-isabelle-hol">Jasmin Blanchette, Mathias Fleury, and Dmitriy Traytel. Nested multisets, hereditary multisets, and syntactic ordinals in Isabelle/HOL</h3>
<h2 id="2016">2016</h2>
<h3 id="jasmin-blanchette-mathias-fleury-christoph-weidenbach-dot-a-verified-sat-solver-framework-with-learn-forget-restart-and-incrementality">Jasmin Blanchette, Mathias Fleury, Christoph Weidenbach. A verified SAT solver framework with learn, forget, restart and incrementality</h3>
<h3 id="jasmin-blanchette-sascha-böhme-mathias-fleury-steffen-juilf-smolka-and-albert-steckermeier-dot-semi-intelligible-isar-proofs-from-machine-generated-proofs-dot">Jasmin Blanchette, Sascha Böhme, Mathias Fleury, Steffen Juilf Smolka, and Albert Steckermeier. Semi-intelligible Isar Proofs from Machine-Generated Proofs.</h3></description>
</item>
<item>
<title>University and Other Duties</title>
<link>https://m-fleury.github.io/university/</link>
<pubDate>Thu, 06 Apr 2023 00:00:00 +0000</pubDate>
<guid>https://m-fleury.github.io/university/</guid>
<description><h2 id="h:university-duties-2024">2024</h2>
<ul>
<li>Co-organization of the SAT/SMT/AR Summer School (in Nancy) with Sophie Tourret and Martin Bromberger</li>
<li>Vice-head of the W2 group <a href="https://www.cost.eu/actions/CA20111/">proof cost-action</a> (started 2023).</li>
</ul>
<h2 id="h:university-duties-2023">2023</h2>
<ul>
<li>Vice-head of the W2 group <a href="https://www.cost.eu/actions/CA20111/">proof cost-action</a>.</li>
<li>Committee for the Embedded System Professorship from the University Freiburg</li>
<li>IAAA accreditation committee for the <a href="https://www.fz.uni-freiburg.de/de">Frankreich-Zentrum</a> from the University Freiburg</li>
</ul></description>
</item>
<item>
<title>Talks</title>
<link>https://m-fleury.github.io/talks/</link>
<pubDate>Mon, 17 Oct 2022 00:00:00 +0000</pubDate>
<guid>https://m-fleury.github.io/talks/</guid>
<description><p>On this page, I list all my talks and slides. Remark that several
talks are impossible to understand without me talking (this is half of
the point of the talk: someone is talking).</p>
<h2 id="2024">2024</h2>
<ul>
<li>Mathias Fleury and Bruno Andreotti Alethe, A flexible proof format with fine-grained steps</li>
</ul>
<table>
 <thead>
 <tr>
 <th style="text-align: left"></th>
 </tr>
 </thead>
 <tbody>
 <tr>
 <td style="text-align: left"><a href="https://proofs.swiss/ps/2024/">Proof Systems for Mathematics and Verification</a></td>
 </tr>
 </tbody>
</table>
<h2 id="2023">2023</h2>
<ul>
<li>Mathias Fleury, in front the Professors (informal talk, towards the habilitation)</li>
</ul>
<table>
 <thead>
 <tr>
 <th style="text-align: left"></th>
 </tr>
 </thead>
 <tbody>
 <tr>
 <td style="text-align: left"><a href="https://m-fleury.github.io/ox-hugo/Fleury-Research23-talk.pdf">SAT Solvers: Verify, Improve, And Use Them In Interactive Theorem Provers</a></td>
 </tr>
 </tbody>
</table>
<ul>
<li>Mathias Fleury and Peter Lammich, Porting IsaSAT to LLVM (and Inprocessing)</li>
</ul>
<table>
 <thead>
 <tr>
 <th style="text-align: left"></th>
 </tr>
 </thead>
 <tbody>
 <tr>
 <td style="text-align: left"><a href="https://m-fleury.github.io/ox-hugo/Fleury-CADE29.pdf">Porting IsaSAT to LLVM (and Inprocessing)</a></td>
 </tr>
 </tbody>
</table>
<ul>
<li>Mathias Fleury, MDX Isabelle Summer School</li>
</ul>
<table>
 <thead>
 <tr>
 <th style="text-align: left"></th>
 <th style="text-align: left"></th>
 </tr>
 </thead>
 <tbody>
 <tr>
 <td style="text-align: left"><a href="https://m-fleury.github.io/ox-hugo/Fleury-MDX-SMT23.pdf">SMT Reconstruction, shortened</a></td>
 <td style="text-align: left"><a href="https://m-fleury.github.io/ox-hugo/Fleury-MDX-Verification23.pdf">Checkers and solvers</a></td>
 </tr>
 </tbody>
</table>
<h2 id="2022">2022</h2>
<ul>
<li>Mathias Fleury, Verifying Solvers: How Much Do You Want to Prove?</li>
</ul>
<table>
 <thead>
 <tr>
 <th style="text-align: left"></th>
 <th style="text-align: left"></th>
 <th style="text-align: left"></th>
 </tr>
 </thead>
 <tbody>
 <tr>
 <td style="text-align: left"><a href="https://www.dagstuhl.de/en/program/calendar/semhp/?semnr=22411">Dagstuhl 22411</a></td>
 <td style="text-align: left"><a href="https://doi.org/10.4230/DagRep.12.10.84">Dagstuhl Report</a></td>
 <td style="text-align: left"><a href="https://m-fleury.github.io/ox-hugo/Fleury-Dagstuhl22-talk.pdf">Slides</a></td>
 </tr>
 </tbody>
</table>
<ul>
<li>Mathias Fleury, Discussion: How to compare techniques in solvers? And how to write such a solver? (work-in-progress with Armin Biere and Karem Sakallah)</li>
</ul>
<table>
 <thead>
 <tr>
 <th style="text-align: left"></th>
 <th style="text-align: left"></th>
 <th style="text-align: left"></th>
 </tr>
 </thead>
 <tbody>
 <tr>
 <td style="text-align: left"><a href="https://www.dagstuhl.de/en/program/calendar/semhp/?semnr=22411">Dagstuhl 22411</a></td>
 <td style="text-align: left"><a href="https://doi.org/10.4230/DagRep.12.10.84">Dagstuhl Report</a></td>
 <td style="text-align: left"><a href="https://m-fleury.github.io/ox-hugo/BiereFleurySakallah-Dagstuhl22-talk.pdf">Slides</a></td>
 </tr>
 </tbody>
</table>
<h2 id="2021">2021</h2>
<ul>
<li>Mathias Fleury and Armin Biere, Efficient All-UIP Learned Clause Minimization.</li>
</ul>
<table>
 <thead>
 <tr>
 <th style="text-align: left"></th>
 <th style="text-align: left"></th>
 </tr>
 </thead>
 <tbody>
 <tr>
 <td style="text-align: left">SAT 2021</td>
 <td style="text-align: left"><a href="https://cca.informatik.uni-freiburg.de/sat_shrinking/FleuryBiere-SAT2021.mp4">video</a></td>
 </tr>
 </tbody>
</table>
<ul>
<li>Mathias Fleury and Christoph Weidenbach. A Verified SAT Solver Framework including Optimization and Partial Valuations</li>
</ul>
<table>
 <thead>
 <tr>
 <th style="text-align: left"></th>
 <th style="text-align: left"></th>
 </tr>
 </thead>
 <tbody>
 <tr>
 <td style="text-align: left">LPAR-23</td>
 <td style="text-align: left"><a href="https://m-fleury.github.io/ox-hugo/FleuryWeidenbach-LPAR21.pdf">slides</a></td>
 </tr>
 </tbody>
</table>
<h2 id="2020">2020</h2>
<ul>
<li>Armin Biere and Mathias Fleury, Chasing Target Phases</li>
</ul>
<table>
 <thead>
 <tr>
 <th style="text-align: left">POS'20</th>
 <th style="text-align: left"><a href="https://cca.informatik.uni-freiburg.de/biere/talks/BiereFleury-POS20-talk.pdf">slides</a></th>
 </tr>
 </thead>
 <tbody>
 <tr>
 <td style="text-align: left">11th Workshop on Pragmatics of SAT (POS'20)</td>
 <td style="text-align: left"><a href="https://artoistv.univ-artois.fr/video/1443-target-phases/8da9b0d2bda33c259a3f21d6dffb9bbeb179bc02fd3d2f59866de6ab73fd9047/">video</a></td>
 </tr>
 </tbody>
</table>
<ul>
<li>Mathias Fleury, One Thousand and One Refinement: From CDCL to a Verified SAT Solver</li>
</ul>
<table>
 <thead>
 <tr>
 <th style="text-align: left"></th>
 <th style="text-align: left"></th>
 </tr>
 </thead>
 <tbody>
 <tr>
 <td style="text-align: left">PhD Defense</td>
 <td style="text-align: left"><a href="https://m-fleury.github.io/ox-hugo/Fleury-Defense-talk.pdf">slides</a></td>
 </tr>
 </tbody>
</table>
<h2 id="2019">2019</h2>
<ul>
<li>Reconstructing veriT proofs in Isabelle/HOL</li>
</ul>
<table>
 <thead>
 <tr>
 <th style="text-align: left">UPSCaLe meeting</th>
 <th style="text-align: left"><a href="https://digicosme.lri.fr/tiki-index.php?page=Friday+afternoon%2C+November+29%2C+2019">slides</a></th>
 </tr>
 </thead>
 <tbody>
 <tr>
 <td style="text-align: left">Paris, November 29, 2019</td>
 <td style="text-align: left"></td>
 </tr>
 </tbody>
</table>
<ul>
<li>Fleury and Weidenbach, Extending an Isabelle Formalisation of CDCL to Optimising CDCL</li>
</ul>
<table>
 <thead>
 <tr>
 <th style="text-align: left"></th>
 <th style="text-align: left"></th>
 </tr>
 </thead>
 <tbody>
 <tr>
 <td style="text-align: left">Matryoshka Workshop</td>
 <td style="text-align: left"><a href="https://m-fleury.github.io/ox-hugo/FleuryWeidenbach-Matryoshka19.pdf">Slides</a></td>
 </tr>
 </tbody>
</table>
<h2 id="2018">2018</h2>
<ul>
<li>Blanchette, Fleury, Lammich, and Weidenbach, A Verified SAT Solver with Watched Literals Using Imperative HOL</li>
</ul>
<table>
 <thead>
 <tr>
 <th style="text-align: left"></th>
 <th style="text-align: left"></th>
 </tr>
 </thead>
 <tbody>
 <tr>
 <td style="text-align: left">FSCD 2017</td>
 <td style="text-align: left"><a href="https://m-fleury.github.io/ox-hugo/BlanchetteFleuryLammichWeidenbach-CPP18.pdf">slides</a></td>
 </tr>
 </tbody>
</table>
<ul>
<li>Fleury, Blanchette, and Fleury, A Verified SAT Solver with Watched Literals Using Imperative HOL (Extended Abstract)</li>
</ul>
<table>
 <thead>
 <tr>
 <th style="text-align: left"></th>
 <th style="text-align: left"></th>
 </tr>
 </thead>
 <tbody>
 <tr>
 <td style="text-align: left">Matryoshka Workshop</td>
 <td style="text-align: left"><a href="https://m-fleury.github.io/ox-hugo/FleuryBlanchetteLammich-Matryoshka18.pdf">Slides</a></td>
 </tr>
 </tbody>
</table>
<h2 id="2017">2017</h2>
<ul>
<li>Blanchette, Fleury, and Traytel, Nested Multisets, Hereditary Multisets, and Syntactic Ordinals in Isabelle/HOL</li>
</ul>
<table>
 <thead>
 <tr>
 <th style="text-align: left"></th>
 <th style="text-align: left"></th>
 </tr>
 </thead>
 <tbody>
 <tr>
 <td style="text-align: left">FSCD 2017</td>
 <td style="text-align: left"><a href="https://m-fleury.github.io/ox-hugo/BlanchetteFleuryTraytel-FSCD17.pdf">slides</a></td>
 </tr>
 </tbody>
</table>
<ul>
<li>Blanchette, Fleury, Lammich, and Weidenbach, A Verified SAT Solver with Watched Literals Using Imperative HOL</li>
</ul>
<table>
 <thead>
 <tr>
 <th style="text-align: left"></th>
 <th style="text-align: left"></th>
 </tr>
 </thead>
 <tbody>
 <tr>
 <td style="text-align: left">PART 2017</td>
 <td style="text-align: left"><a href="https://m-fleury.github.io/ox-hugo/BlanchetteFleuryLammichWeidenbach-PART17.pdf">slides</a></td>
 </tr>
 </tbody>
</table>
<ul>
<li>Blanchette, Fleury, and Weidenbach, A Verified SAT Solver Framework</li>
</ul>
<table>
 <thead>
 <tr>
 <th style="text-align: left"></th>
 <th style="text-align: left"></th>
 </tr>
 </thead>
 <tbody>
 <tr>
 <td style="text-align: left">IJCAI 2017</td>
 <td style="text-align: left"><a href="https://m-fleury.github.io/ox-hugo/BlanchetteFleuryWeidenbach-IJCAI17.pdf">slides</a></td>
 </tr>
 </tbody>
</table>
<h2 id="2015">2015</h2>
<ul>
<li>Fleury, Formalisation of Ground Inference Systems in Isabelle</li>
</ul>
<table>
 <thead>
 <tr>
 <th style="text-align: left"></th>
 <th style="text-align: left"></th>
 </tr>
 </thead>
 <tbody>
 <tr>
 <td style="text-align: left">GeoCAL 2015</td>
 <td style="text-align: left"><a href="./talks/Fleury-PART15.pdf">slides</a></td>
 </tr>
 </tbody>
</table></description>
</item>
<item>
<title>My Research</title>
<link>https://m-fleury.github.io/research/</link>
<pubDate>Wed, 13 Jul 2022 19:08:45 +0200</pubDate>
<guid>https://m-fleury.github.io/research/</guid>
<description><p>This webpage contains documents that I generated, like the
Isabelle documentation from my PhD thesis. This is the only way to
have links which survives changes in my affiliation.</p>
<p>For my publications, please look <a href="https://m-fleury.github.io/publications/">here</a>; for my academic duties, please look <a href="https://m-fleury.github.io/academic/">here</a>.</p>
<h2 id="h:research"><span class="org-target" id="org-target--Research"></span>Research</h2>
<h3 id="h:sat-solver-framework">SAT Solver Framework <span class="tag"><span class="isasat">isasat</span><span class="CDCL">CDCL</span></span></h3>
<p>As part of my PhD thesis, I developed a framework to formalize SAT
solving. I still continue to expend it. It is not a very fast SAT
solver, but you are guaranteed that the answer is correct and that
there is no overflow happening internally that would compromise
correctness.</p></description>
</item>
<item>
<title>Programs</title>
<link>https://m-fleury.github.io/sources/sources/</link>
<pubDate>Tue, 01 Mar 2022 12:02:52 +0100</pubDate>
<guid>https://m-fleury.github.io/sources/sources/</guid>
<description><p>Here the release of my projects that I manage myself (so unlike my changes to, e.g., CaDiCaL).</p>
<h2 id="h:isasat"><span class="org-target" id="org-target--IsaSAT"></span>IsaSAT</h2>
<h3 id="h:isasat-eda-challenge">2021: EDA Challenge</h3>
<p>This the first official release of the IsaSAT in LLVM IR. See the
<a href="../../../src/isasat/isasat-eda2021-edcd29d.tar.xz">sources</a> and the system description submitted at the EDA Challenge for
a list of changes compared to IsaSAT in Standard ML.</p>
<p>The main difference compared to the Standard ML version developped in my PhD is
that the Isabelle theorem is now incomplete (this was implicit earlier in the
sense that it is a limit of the compiler, not a limit of the program) and that
the new version is much faster.</p></description>
</item>
<item>
<title>IsaSAT</title>
<link>https://m-fleury.github.io/isasat/isasat/</link>
<pubDate>Sun, 01 Aug 2021 00:00:00 +0000</pubDate>
<guid>https://m-fleury.github.io/isasat/isasat/</guid>
<description><p>IsaSAT is one of the few verified SAT solvers (and to my knowledge the
only one that is currently maintained). It is verified in Isabelle
using the Isabelle Refinement Framework by synthesizing code. See <a href="../isasat-presentation">the
presentation</a> for more details.</p></description>
</item>
<item>
<title>IsaSAT Presentation</title>
<link>https://m-fleury.github.io/isasat/isasat-presentation/</link>
<pubDate>Sun, 01 Aug 2021 00:00:00 +0000</pubDate>
<guid>https://m-fleury.github.io/isasat/isasat-presentation/</guid>
<description><p>As part of my PhD thesis, I developed a framework to formalize SAT
solving. I still continue to expand it. The general organization is
given by the following graph:
<img src="https://m-fleury.github.io/ox-hugo/sat_framework.png" alt="">. If you want to have a look at
the sources, look at the <a href="https://bitbucket.org/isafol/isafol/src/master/Weidenbach_Book/">IsaFoL</a> repository (this is the latest
bleeding age version, so it is sometimes broken) and the
<a href="https://people.mpi-inf.mpg.de/~mfleury/IsaFoL/current/Weidenbach_Book/">Isabelle-generated HTML documentation</a> (look at the &ldquo;IsaFoL&rdquo; version at
the bottom to know the corresponding git ID).</p></description>
</item>
<item>
<title>Pastèque Presentation</title>
<link>https://m-fleury.github.io/pasteque/pasteque-presentation/</link>
<pubDate>Sun, 01 Aug 2021 00:00:00 +0000</pubDate>
<guid>https://m-fleury.github.io/pasteque/pasteque-presentation/</guid>
<description><p>While I don&rsquo;t understand much algebra, I know Isabelle and implemented a checker
in Isabelle/HOL. I used the Refinement Framework and Sepref to generated code in
Standard ML. The code is mostly functional (except for the hashmap that is
synthesized automatically by Sepref &ndash; no need to understand and know anything
about it!).</p>
<p>How does Pastèque work? I started with an abstract calculus that models the
rules of the proofs system. Then I make the calculus more concrete, e.g., with
lists to represent polynomials. Finally, I make everything executable.</p></description>
</item>
<item>
<title>Pastèque Release</title>
<link>https://m-fleury.github.io/pasteque/pasteque-release/</link>
<pubDate>Sun, 01 Aug 2021 00:00:00 +0000</pubDate>
<guid>https://m-fleury.github.io/pasteque/pasteque-release/</guid>
<description><h2 id="pastèque-2">Pastèque 2</h2>
<p>Pastèque 2 is available on the <a href="https://bitbucket.org/isafol/isafol/src/master/PAC%5FChecker2/">IsaFoL repository</a> and the HTML
generation can be <a href="https://people.mpi-inf.mpg.de/~mfleury/IsaFoL/current/PAC%5FChecker2/">seen</a> too. The source code can be found <a href="http://fmv.jku.at/lpac/">here</a>.</p>
<h2 id="pastèque-1">Pastèque 1</h2>
<p>Pastèque 1 is available with the Isabelle formalization on the <a href="https://www.isa-afp.org/entries/PAC%5FChecker.html">Archive
of Formal Proofs</a>, where it is maintained and kept up-to-date. The
release is also available <a href="http://fmv.jku.at/pacheck%5Fpasteque/">here</a>.</p></description>
</item>
<item>
<title>Publications long</title>
<link>https://m-fleury.github.io/publications-long/</link>
<pubDate>Sun, 01 Aug 2021 00:00:00 +0000</pubDate>
<guid>https://m-fleury.github.io/publications-long/</guid>
<description><h2 id="2024">2024</h2>
<h3 id="robin-coutelier-mathias-fleury-and-laura-kovács-lazy-reimplication-in-chronological-backtracking">Robin Coutelier, Mathias Fleury and Laura Kovács, Lazy Reimplication in Chronological Backtracking</h3>
<table>
 <thead>
 <tr>
 <th style="text-align: left"></th>
 <th style="text-align: left"></th>
 </tr>
 </thead>
 <tbody>
 <tr>
 <td style="text-align: left">SAT 2024</td>
 <td style="text-align: left"><a href="https://cca.informatik.uni-freiburg.de/papers/CoutelierFleuryKovacs-SAT24-preprint.pdf">preprint</a></td>
 </tr>
 </tbody>
</table>
<div class="highlight"><pre tabindex="0" style="color:#93a1a1;background-color:#002b36;-moz-tab-size:4;-o-tab-size:4;tab-size:4;"><code class="language-bib" data-lang="bib"><span style="display:flex;"><span><span style="color:#268bd2">@InProceedings</span>{coutelier_et_al:LIPIcs.SAT.2024.9,
</span></span><span style="display:flex;"><span> author =	<span style="color:#2aa198">{Coutelier, Robin and Fleury, Mathias and Kov\&#39;{a}cs, Laura}</span>,
</span></span><span style="display:flex;"><span> title =	<span style="color:#2aa198">{{Lazy Reimplication in Chronological Backtracking}}</span>,
</span></span><span style="display:flex;"><span> booktitle =	<span style="color:#2aa198">{27th International Conference on Theory and Applications of Satisfiability Testing (SAT 2024)}</span>,
</span></span><span style="display:flex;"><span> pages =	<span style="color:#2aa198">{9:1--9:19}</span>,
</span></span><span style="display:flex;"><span> series =	<span style="color:#2aa198">{Leibniz International Proceedings in Informatics (LIPIcs)}</span>,
</span></span><span style="display:flex;"><span> ISBN =	<span style="color:#2aa198">{978-3-95977-334-8}</span>,
</span></span><span style="display:flex;"><span> ISSN =	<span style="color:#2aa198">{1868-8969}</span>,
</span></span><span style="display:flex;"><span> year =	<span style="color:#2aa198">{2024}</span>,
</span></span><span style="display:flex;"><span> volume =	<span style="color:#2aa198">{305}</span>,
</span></span><span style="display:flex;"><span> editor =	<span style="color:#2aa198">{Chakraborty, Supratik and Jiang, Jie-Hong Roland}</span>,
</span></span><span style="display:flex;"><span> publisher =	<span style="color:#2aa198">{Schloss Dagstuhl -- Leibniz-Zentrum f{\&#34;u}r Informatik}</span>,
</span></span><span style="display:flex;"><span> address =	<span style="color:#2aa198">{Dagstuhl, Germany}</span>,
</span></span><span style="display:flex;"><span> URL =		<span style="color:#2aa198">{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAT.2024.9}</span>,
</span></span><span style="display:flex;"><span> URN =		<span style="color:#2aa198">{urn:nbn:de:0030-drops-205313}</span>,
</span></span><span style="display:flex;"><span> doi =		<span style="color:#2aa198">{10.4230/LIPIcs.SAT.2024.9}</span>,
</span></span><span style="display:flex;"><span> annote =	<span style="color:#2aa198">{Keywords: Chronological Backtracking, CDCL, Invariants, Watcher Lists}</span>
</span></span><span style="display:flex;"><span>}</span></span></code></pr</description>
</item>
<item>
<title>Used Flag</title>
<link>https://m-fleury.github.io/isasat/isasat-used/</link>
<pubDate>Sun, 01 Aug 2021 00:00:00 +0000</pubDate>
<guid>https://m-fleury.github.io/isasat/isasat-used/</guid>
<description><p>This is the detailed story of my <a href="https://twitter.com/MathiasFleury12/status/1423620596341084162?s=20">Tweet</a> about the used flag.</p>
<h2 id="database-reduction">Database Reduction</h2>
<p>Some background first. CDCL solvers learns clauses. Actually they
generate way too many clauses to keep all of them. So you have to
remove them. Actually many of them. This happens during so-called
<span class="underline">reductions</span>.</p>
<p>This comes from the theory of CDCL. There are two way to keep
completeness: either delay restarts more-and-more or keep
more-and-more clauses. But this does not tell you which clauses you
have to keep during reductions.</p></description>
</item>
<item>
<title>Blog</title>
<link>https://m-fleury.github.io/blog/</link>
<pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
<guid>https://m-fleury.github.io/blog/</guid>
<description><h2 id="artifacts-reviewing">Artifacts Reviewing</h2>
<p>I have consistently felt unease about our approach to examining
artifacts. Although I have personally reviewed numerous artifacts, I
believe that, as a community, we are mistaken in our methods.</p>
<h3 id="weird-errors-and-artifact-problems">Weird Errors and Artifact Problems</h3>
<p>The objective of artifact creation is straightforward: to enable the
reproducibility of results by allowing the same code to be run again
in the future. This can be achieved by packaging all necessary
components in a repository, such as Zenodo, ensuring that everything
is self-contained and does not rely on external internet
connections. Indeed, this approach seems quite appealing.</p></description>
</item>
</channel>
</rss>