TRI Author: Soonho Kong
All Authors: Jeevana Priya Inala, Sicun Gao, Soonho Kong, Armando Solar-Lezama
In this paper, we present ReaS, a technique that combines numerical optimization with SAT solving to synthesize unknowns in a program that involves discrete and floating point computation. ReaS makes the program end-to-end differentiable by smoothing any Boolean expression that introduces discontinuity such as conditionals and relaxing the Boolean unknowns so that numerical optimization can be performed. On top of this, ReaS uses a SAT solver to help the numerical search overcome local solutions by incrementally fixing values to the Boolean expressions. We evaluated the approach on 5 case studies involving hybrid systems and show that ReaS can synthesize programs that could not be solved by previous SMT approaches. Read More
Citation: Inala, Jeevana Priya, Sicun Gao, Soonho Kong, and Armando Solar-Lezama. "REAS: combining numerical optimization with SAT solving." arXiv preprint arXiv:1802.04408 (2018).