Not registered as user yet
Name: Andrew Reynolds
Bio: 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.
Personal website: http://lara.epfl.ch/~reynolds/
POPL 2016 Activities
View general profile