Tutorial
Advances on SAT and SMT Solving
Propositional satisfiability (SAT) solvers and satisfiability modulo theories (SMT) solvers are the main engines in software and hardware verification. This tutorial provides a self-contained introduction of SAT and SMT algorithms, and aims to highlight some recent advances, including hybrid solvers, parallel solvers and LLM based solvers.
Slides: tutorial