default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathias Fleury
Person information
- affiliation: University of Freiburg, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c24]Armin Biere
, Tobias Faller, Katalin Fazekas, Mathias Fleury, Nils Froleyks, Florian Pollitt:
CaDiCaL 2.0. CAV (1) 2024: 133-152- [c23]Katalin Fazekas, Florian Pollitt, Mathias Fleury, Armin Biere:
Certifying Incremental SAT Solving. LPAR 2024: 321-340 - [c22]Armin Biere, Katalin Fazekas, Mathias Fleury, Nils Froleyks:
Clausal Congruence Closure. SAT 2024: 6:1-6:25 - [c21]Robin Coutelier, Mathias Fleury, Laura Kovács:
Lazy Reimplication in Chronological Backtracking. SAT 2024: 9:1-9:19 - [c20]Hanna Lachnitt, Mathias Fleury, Leni Aniva, Andrew Reynolds, Haniel Barbosa, Andres Nötzli, Clark W. Barrett, Cesare Tinelli:
IsaRare: Automatic Verification of SMT Rewrites in Isabelle/HOL. TACAS (1) 2024: 311-330 - [i2]Mathias Fleury, Daniela Kaufmann:
Life span of SAT techniques. CoRR abs/2402.01202 (2024) - 2023
- [c19]Mathias Fleury, Peter Lammich:
A More Pragmatic CDCL for IsaSAT and Targetting LLVM (Short Paper). CADE 2023: 207-219 - [c18]Florian Pollitt, Mathias Fleury, Armin Biere:
Faster LRAT Checking Than Solving with CaDiCaL. SAT 2023: 21:1-21:12 - [c17]Armin Biere, Mathias Fleury, Nils Froleyks, Marijn J. H. Heule:
The SAT Museum. POS@SAT 2023: 72-87 - [c16]Hanna Lachnitt, Mathias Fleury, Leni Aniva, Andrew Reynolds, Haniel Barbosa, Andres Nötzli, Clark W. Barrett, Cesare Tinelli:
Automatic Verification of SMT Rewrites in Isabelle/HOL. SMT 2023: 78 - 2022
- [j7]Mathias Fleury, Armin Biere:
Mining definitions in Kissat with Kittens. Formal Methods Syst. Des. 60(3): 381-404 (2022) - [j6]Shaowei Cai, Xindi Zhang, Mathias Fleury, Armin Biere:
Better Decision Heuristics in CDCL through Local Search and Target Phases. J. Artif. Intell. Res. 74: 1515-1563 (2022) - [i1]Mathias Fleury, Armin Biere:
Scalable Proof Producing Multi-Threaded SAT Solving with Gimsatul through Sharing instead of Copying Clauses. CoRR abs/2207.13577 (2022) - 2021
- [c15]Hans-Jörg Schurr, Mathias Fleury, Martin Desharnais:
Reliable Reconstruction of Fine-grained Proofs in a Proof Assistant. CADE 2021: 450-467 - [c14]Mathias Fleury, Armin Biere:
Efficient All-UIP Learned Clause Minimization. SAT 2021: 171-187 - [c13]Hans-Jörg Schurr, Mathias Fleury, Martin Desharnais:
Abstract: Reliable Reconstruction of Fine-Grained Proofs in a Proof Assistant. SMT 2021: 64 - [c12]Hans-Jörg Schurr, Mathias Fleury, Haniel Barbosa, Pascal Fontaine:
Alethe: Towards a Generic SMT Proof Format (extended abstract). PxTP 2021: 49-54 - [e1]Chantal Keller, Mathias Fleury:
Proceedings Seventh Workshop on Proof eXchange for Theorem Proving, PxTP 2021, Pittsburg, PA, USA, July 11, 2021. EPTCS 336, 2021 [contents] - 2020
- [b1]Mathias Fleury:
Formalization of logical calculi in Isabelle/HOL. Saarland University, Saarbrücken, Germany, 2020 - [j5]Mathias Fleury, Daniela Kaufmann:
Practical Algebraic Calculus Checker. Arch. Formal Proofs 2020 (2020) - [j4]Haniel Barbosa, Jasmin Christian Blanchette, Mathias Fleury, Pascal Fontaine:
Scalable Fine-Grained Proofs for Formula Processing. J. Autom. Reason. 64(3): 485-510 (2020) - [c11]Daniela Kaufmann, Mathias Fleury, Armin Biere:
The Proof Checkers Pacheck and Pastèque for the Practical Algebraic Calculus. FMCAD 2020: 264-269 - [c10]Mathias Fleury, Christoph Weidenbach:
A Verified SAT Solver Framework including Optimization and Partial Valuations. LPAR 2020: 212-229 - [c9]Maximilian Heisinger, Mathias Fleury, Armin Biere:
Distributed Cube and Conquer with Paracooba. SAT 2020: 114-122
2010 – 2019
- 2019
- [c8]Martin Bromberger, Mathias Fleury, Simon Schwarz, Christoph Weidenbach:
SPASS-SATT - A CDCL(LA) Solver. CADE 2019: 111-122 - [c7]Mathias Fleury:
Optimizing a Verified SAT Solver. NFM 2019: 148-165 - [c6]Mathias Fleury, Hans-Jörg Schurr:
Reconstructing veriT Proofs in Isabelle/HOL. PxTP 2019: 36-50 - 2018
- [j3]Jasmin Christian Blanchette, Mathias Fleury, Peter Lammich, Christoph Weidenbach:
A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality. J. Autom. Reason. 61(1-4): 333-365 (2018) - [c5]Mathias Fleury, Jasmin Christian Blanchette, Peter Lammich:
A verified SAT solver with watched literals using imperative HOL. CPP 2018: 158-171 - 2017
- [c4]Julian Biendarra, Jasmin Christian Blanchette, Aymeric Bouzy, Martin Desharnais, Mathias Fleury, Johannes Hölzl, Ondrej Kuncar, Andreas Lochbihler, Fabian Meier, Lorenz Panny, Andrei Popescu, Christian Sternagel, René Thiemann, Dmitriy Traytel:
Foundational (Co)datatypes and (Co)recursion for Higher-Order Logic. FroCoS 2017: 3-21 - [c3]Jasmin Christian Blanchette, Mathias Fleury, Christoph Weidenbach:
A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality. IJCAI 2017: 4786-4790 - [c2]Jasmin Christian Blanchette, Mathias Fleury, Dmitriy Traytel:
Nested Multisets, Hereditary Multisets, and Syntactic Ordinals in Isabelle/HOL. FSCD 2017: 11:1-11:18 - 2016
- [j2]Jasmin Christian Blanchette, Mathias Fleury, Dmitriy Traytel:
Formalization of Nested Multisets, Hereditary Multisets, and Syntactic Ordinals. Arch. Formal Proofs 2016 (2016) - [j1]Jasmin Christian Blanchette, Sascha Böhme, Mathias Fleury, Steffen Juilf Smolka, Albert Steckermeier:
Semi-intelligible Isar Proofs from Machine-Generated Proofs. J. Autom. Reason. 56(2): 155-200 (2016) - [c1]Jasmin Christian Blanchette, Mathias Fleury, Christoph Weidenbach:
A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality. IJCAR 2016: 25-44
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
