MoVe
[Séminaire MoVe] Souheib Baarir (MoVe, LIP6) : Parallel and Domain-Aware SAT Solving: Application to Blockchain Analysis
Vendredi 10 avril 2026Souheib Baarir (MoVe, LIP6)
This talk presents research contributions on Boolean Satisfiability (SAT) solving and its application to the analysis of discrete systems. The first part focuses on parallel SAT solving, addressing key issues such as modular solver design, the articulation between divide-and-conquer and portfolio approaches, and effective learned-clause sharing. In this context, the PaInleSS framework is introduced as a generic platform for building efficient parallel SAT solvers. The second part considers domain-aware SAT solving through programmatic extensions of CDCL, showing how problem-specific knowledge can improve solving strategies, especially in bounded model checking. The presentation concludes with an application to the verification of blockchain smart contracts, where SAT-based reasoning provides a promising basis for analyzing security- and safety-critical properties at scale.
Plus d’informations ici …
Dylan.Marinho (at)
nulllip6.fr