Re:CS294: Program Synthesis for Everyone
by tikhonj on Tuesday November 22, 2016 @05:48PM
(#13018379)
I'm not sure what you mean by this question. What that lecture covers is essentially how to express an approximation of the operational semantics of a simple language as a logic formula in a very specific kind of logic (ie one of the theories supported by the Z3 SMT solver). It only supports a small number of constructs and data types, and handles infinite loops by placing an arbitrary bound on how far a program can run. It doesn't tell you anything about "all programs" or "all functions".
Just curious, are the products of all programs formula? Worded differently, are the products of all functions formula?