[PDF][PDF] Lookahead in partitioning SMT
AEJ Hyvärinen, M Marescotti… - 2021 Formal Methods in …, 2021 - library.oapen.org
Lookahead in propositional satisfiability has proven efficient as a heuristic in pre-and in-
processing, for partitioning instances for parallel solving, and as the main driver of a …
processing, for partitioning instances for parallel solving, and as the main driver of a …
Picky CDCL: SMT-Solving with Flexible Literal Selection
SMT solvers have traditionally been optimized for determining the satisfiability of a query as
quickly as possible. However, they are increasingly being used in applications where the …
quickly as possible. However, they are increasingly being used in applications where the …
[PDF][PDF] The opensmt solver in SMT-COMP 2021
M Asadzade, M Blicha, AE Hyvärinen… - … (SMT-COMP 2021), 2021 - smt-comp.github.io
OpenSMT [5] is a T-DPLL based SMT solver [9] that has been developed at USI,
Switzerland, since 2008. The solver is written in C++ and currently supports the quantifier …
Switzerland, since 2008. The solver is written in C++ and currently supports the quantifier …
[PDF][PDF] The opensmt solver in smt-comp 2020
OpenSMT [9] is a T-DPLL based SMT solver [13] that has been developed at USI,
Switzerland, since 2008. The solver is written in C++ and currently supports the quantifier …
Switzerland, since 2008. The solver is written in C++ and currently supports the quantifier …
[PDF][PDF] Parallelization and modelling techniques for scalable SMT-based verification
M Marescotti - 2020 - verify.inf.usi.ch
Software systems are increasingly involved in our daily life tasks, making their failures
potentially damaging both in economic and human terms. As a result, proving the …
potentially damaging both in economic and human terms. As a result, proving the …
[PDF][PDF] The OpenSMT Solver in SMT-COMP 2019
OpenSMT [8] is a T-DPLL based SMT solver [13] that has been developed at USI,
Switzerland, since 2008. The solver is written in C++ and currently supports the quantifier …
Switzerland, since 2008. The solver is written in C++ and currently supports the quantifier …
[PDF][PDF] An Arboriculture Approach for Parallel SMT and Symbolic Model Checking
The inherent complexity of parallel computing makes development, resource monitoring,
and debugging for parallel constraint-solving-based applications difficult. This paper …
and debugging for parallel constraint-solving-based applications difficult. This paper …