Mathias Preiner

Orcid: 0000-0002-7142-6258

Affiliations:
  • Stanford University, CA, USA
  • Johannes Kepler University, Linz, Austria (former)


According to our database1, Mathias Preiner authored at least 36 papers between 2012 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Publisher Correction: Algorithm selection for SMT.
Int. J. Softw. Tools Technol. Transf., December, 2023

Generating and Exploiting Automated Reasoning Proof Certificates.
Commun. ACM, October, 2023

Algorithm selection for SMT.
Int. J. Softw. Tools Technol. Transf., April, 2023

IPASIR-UP: User Propagators for CDCL.
Proceedings of the 26th International Conference on Theory and Applications of Satisfiability Testing, 2023

Bitwuzla.
Proceedings of the Computer Aided Verification - 35th International Conference, 2023

2022
Bit-Precise Reasoning via Int-Blasting.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2022

cvc5: A Versatile and Industrial-Strength SMT Solver.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2022

The FMCAD 2022 Student Forum.
Proceedings of the 22nd Formal Methods in Computer-Aided Design, 2022

Reconstructing Fine-Grained Proofs of Rewrites Using a Domain-Specific Language.
Proceedings of the 22nd Formal Methods in Computer-Aided Design, 2022

Murxla: A Modular and Highly Extensible API Fuzzer for SMT Solvers.
Proceedings of the Computer Aided Verification - 34th International Conference, 2022

Flexible Proof Production in an Industrial-Strength SMT Solver.
Proceedings of the Automated Reasoning - 11th International Joint Conference, 2022

2021
Towards Satisfiability Modulo Parametric Bit-vectors.
J. Autom. Reason., 2021

On solving quantified bit-vector constraints using invertibility conditions.
Formal Methods Syst. Des., 2021

MachSMT: A Machine Learning-based Algorithm Selector for SMT Solvers.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2021

Syntax-Guided Quantifier Instantiation.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2021

ddSMT 2.0: Better Delta Debugging for the SMT-LIBv2 Language and Friends.
Proceedings of the Computer Aided Verification - 33rd International Conference, 2021

2020
Bitwuzla at the SMT-COMP 2020.
CoRR, 2020

Abstract: MachSMT: A Machine Learning-based Algorithm Selector for SMT Solvers.
Proceedings of the 18th International Workshop on Satisfiability Modulo Theories co-located with the 10th International Joint Conference on Automated Reasoning (IJCAR 2020), 2020

Ternary Propagation-Based Local Search for more Bit-Precise Reasoning.
Proceedings of the 2020 Formal Methods in Computer Aided Design, 2020

2019
DRAT-based Bit-Vector Proofs in CVC4.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2019, 2019

Syntax-Guided Rewrite Rule Enumeration for SMT Solvers.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2019, 2019

Invertibility Conditions for Floating-Point Formulas.
Proceedings of the Computer Aided Verification - 31st International Conference, 2019

Towards Bit-Width-Independent Proofs in SMT Solvers.
Proceedings of the Automated Deduction - CADE 27, 2019

2018
CVC4 at the SMT Competition 2018.
CoRR, 2018

Btor2 , BtorMC and Boolector 3.0.
Proceedings of the Computer Aided Verification - 30th International Conference, 2018

Solving Quantified Bit-Vectors Using Invertibility Conditions.
Proceedings of the Computer Aided Verification - 30th International Conference, 2018

2017
Propagation based local search for bit-precise reasoning.
Formal Methods Syst. Des., 2017

Counterexample-Guided Model Synthesis.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2017

Model-Based API Testing for SMT Solvers.
Proceedings of the 15th International Workshop on Satisfiability Modulo Theories affiliated with the International Conference on Computer-Aided Verification (CAV 2017), Heidelberg, Germany, July 22, 2017

2016
Precise and Complete Propagation Based Local Search for Satisfiability Modulo Theories.
Proceedings of the Computer Aided Verification - 28th International Conference, 2016

2015
Better Lemmas with Lambda Extraction.
Proceedings of the Formal Methods in Computer-Aided Design, 2015

2014
Boolector 2.0.
J. Satisf. Boolean Model. Comput., 2014

Turbo-charging Lemmas on demand with don't care reasoning.
Proceedings of the Formal Methods in Computer-Aided Design, 2014

2013
Analysis of Portfolio-Style Parallel SAT Solving on Current Multi-Core Architectures.
Proceedings of the POS-13. Fourth Pragmatics of SAT workshop, 2013

Lemmas on Demand for Lambdas.
Proceedings of the Second International Workshop on Design and Implementation of Formal Tools and Systems, 2013

2012
Resolution-Based Certificate Extraction for QBF - (Tool Presentation).
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2012, 2012


  Loading...