Accelerating Syntax-Guided Invariant Synthesis [chapter]

Grigory Fedyukovich, Rastislav Bodík
2018 Lecture Notes in Computer Science  
We present a fast algorithm for syntax-guided synthesis of inductive invariants which combines enumerative learning with inductive-subset extraction, leverages counterexamples-to-induction and interpolation-based bounded proofs. It is a variant of a recently proposed probabilistic method, called FreqHorn, which is however less dependent on heuristics than its predecessor. We present an evaluation of the new algorithm on a large set of benchmarks and show that it exhibits a more predictable
more » ... ior than its predecessor, and it is competitive to the state-of-the-art invariant synthesizers based on Property Directed Reachability.
doi:10.1007/978-3-319-89960-2_14 fatcat:bgsvtbu26zbrjnwunbesdkrtam