Andrew Reynolds


I am a Post-Doc at the LARA group at EPFL in Lausanne, Switzerland, working with Viktor Kuncak. My research focus is on various aspects of Satisfiability Modulo Theories, including quantified formulas, decision procedures, and proof checking. I am the primary developer of the module for handling quantified formulas in the SMT solver CVC4. My current focus is developing new techniques for handling quantified formulas within SMT solvers, including heuristic E-matching, finite model finding, model-based instantiation, methods for automating proofs by induction, and approaches for synthesis conjectures.

Publications

Papers

Technical Reports

Dissertation

Presentations

Competitions

My work in CVC4 has been entered in the following competitions:

Program Committee Experience


Contact Info

E-mail: andrew.j.reynolds@gmail.com