MachSMT: A machine learning-based algorithm selector for SMT solvers

J Scott, A Niemetz, M Preiner, S Nejati… - … Conference on Tools and …, 2021 - Springer
In this paper, we present MachSMT, an algorithm selection tool for Satisfiability Modulo
Theories (SMT) solvers. MachSMT supports the entirety of the SMT-LIB language. It employs …

MedleySolver: online SMT algorithm selection

N Pimpalkhare, F Mora, E Polgreen… - Theory and Applications of …, 2021 - Springer
Satisfiability modulo theories (SMT) solvers implement a wide range of optimizations that are
often tailored to a particular class of problems, and that differ significantly between solvers …

Algorithm selection for SMT: MachSMT: machine learning driven algorithm selection for SMT solvers

J Scott, A Niemetz, M Preiner, S Nejati… - International Journal on …, 2023 - Springer
This paper presents MachSMT, an algorithm selection tool for Satisfiability Modulo Theories
(SMT) solvers. MachSMT supports the entirety of the SMT-LIB language and standardized …

BanditFuzz: fuzzing SMT solvers with multi-agent reinforcement learning

J Scott, T Sudula, H Rehman, F Mora… - … Symposium on Formal …, 2021 - Springer
We present BanditFuzz, a multi-agent reinforcement learning (RL) guided performance
fuzzer for state-of-the-art Satisfiability Modulo Theories (SMT) solvers. BanditFuzz constructs …

SMT solving for the validation of B and Event-B models

J Schmidt, M Leuschel - International Journal on Software Tools for …, 2022 - Springer
ProB provides a constraint solver for the B-method written in Prolog and can make use of
different backends based on SAT and SMT solving. One such backend translates B and …

Reinforcement Learning and Data-Generation for Syntax-Guided Synthesis

J Parsert, E Polgreen - Proceedings of the AAAI Conference on Artificial …, 2024 - ojs.aaai.org
Program synthesis is the task of automatically generating code based on a specification. In
Syntax-Guided Synthesis (SyGuS) this specification is a combination of a syntactic template …

Internal and External Performance Fuzzing of Well-Defined Constraints for the B Method

J Dunkelau, M Leuschel - Formal Aspects of Computing, 2025 - dl.acm.org
The B method is a formal method supported by a variety of tools. Those tools, like any
complex piece of software, may suffer from performance issues and vulnerabilities. In this …

[PDF][PDF] Enhancing symbolic execution by machine learning based solver selection

SH Wen, WL Mow, WN Chen, CY Wang… - Proceedings of the …, 2019 - ruoyuwang.me
Constraint solving creates a serious performance bottleneck in symbolic execution.
Examining a plethora of SMT solvers with diverse capabilities, we address the following …

Reinforcement Learning for Syntax-Guided Synthesis

J Parsert, E Polgreen - arxiv preprint arxiv:2307.09564, 2023 - arxiv.org
Program synthesis is the task of automatically generating code based on a specification. In
Syntax-Guided Synthesis (SyGuS) this specification is a combination of a syntactic template …

Timeout Prediction for Software Analyses

N Thoben, J Haltermann, H Wehrheim - International Conference on …, 2023 - Springer
Software verification tools automatically prove the correctness of programs with respect to
user supplied specifications. Today, such tools implement a range of different types of …