Dynamic inference of likely data preconditions over predicates by tree learning
Sriram Sankaranarayanan, Swarat Chaudhuri, Franjo Ivančić, Aarti Gupta · 2008
We present a technique to infer likely data preconditions forprocedures written in an imperative programming language. Given a procedure and a set of predicates over its inputs, our technique enumerates different truth assignments to the predicates, deriving test cases from each feasible truth assignment. The predicates themselves are derived automatically using simple heuristics. The enumeration of truth assignments is performed using a propositional SAT solver along with a theory satisfiability checker capable of generating unsatisfiable cores.