SAT and SMT solvers are versatile and powerful tools in the toolbox of any PL researcher, and if you are not using them, you are probably missing out. In this talk I will demonstrate how to use an SMT solver to perform three common tasks: declarative program execution, program verification, and program synthesis.

Nadia Polikarpova is an Assistant Professor of Computer Science and Engineering at the University of California, San Diego. She received her PhD from ETH Zurich (Switzerland), and spent a couple of years as a postdoc at MIT CSAIL. She is a 2020 Sloan Fellow and a recipient of the 2020 NSF Career Award. Her research interests are in program synthesis, program verification, and type systems.