Write a Blog >>
ICFP 2020
Thu 20 - Fri 28 August 2020
Sun 23 Aug 2020 10:30 - 11:10 at PLMW - Session 2

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.

Sun 23 Aug
Times are displayed in time zone: Eastern Time (US & Canada) change

10:30 - 12:30: Session 2PLMW @ ICFP / PLMW @ ICFP Catering at PLMW
10:30 - 11:10
Constraint Solvers for the Working PL Researcher
Nadia PolikarpovaUniversity of California, San Diego
11:10 - 11:50
Managing your Research, your Advisor, your PhD
Amal AhmedNortheastern University, USA
11:50 - 12:30
Basic Mechanics of Operational Semantics
David Van HornUniversity of Maryland, USA