UE SAT/SMT Solving

Diplômes intégrant cet élément pédagogique :

Descriptif

Understanding how decision procedures for SAT (Boolean satisfiability) and SMT (SAT enriched with arithmetic etc.) work, and how to use them in practice.

These procedures can be used in automatic analysis of software or hardware, in combinatorial optimisation or in search for solutions in operation research.

Contents :

  • SAT/SMT algorithms
  • Lab classes: using a SMT solver

Pré-requis

Basic mathematical logic : Boolean operators, quantifiers
Algorithmics
Programming

Bibliographie

Kroening & Strichman, Decision procedures
Bradley & Manna, The calculus of computation
Biere et al, ed., The Handbook of Satisfiability

Informations complémentaires

Méthode d'enseignement : En présence
Lieu(x) : Grenoble - Domaine universitaire
Langue(s) : Anglais