2014/12/03 by Pierre-Loic Garoche, Arie Gurfinkel, Temesghen Kahsai
Computer Science · #cs.LO
paper · pdf · doi:10.4204/eptcs.169.4
published as EPTCS 169, 2014, pp. 19-30 · In Proceedings HCVS 2014, arXiv:1412.0825
arxiv created 2014/12/03 · arxiv updated 2014/12/04
In this paper, we explore different techniques to synthesize modular invariants for synchronous code encoded as Horn clauses. Modular invariants are a set of formulas that characterizes the validity of predicates. They are very useful for different aspects of analysis, synthesis, testing and program transformation. We describe two techniques to generate modular invariants for code written in the synchronous dataflow language Lustre. The first technique directly encodes the synchronous code in a modular fashion. While in the second technique, we synthesize modular invariants starting from a monolithic invariant. Both techniques, take advantage of analysis techniques based on property-directed reachability. We also describe a technique to minimize the synthesized invariants.