TACO: Efficient SAT-Based Bounded Verification Using Symmetry Breaking and Tight Bounds
IEEE Transactions on Software Engineering
By Juan P. Galeotti,Nicolas Rosner,Carlos G. Lopez Pombo,Marcelo F. Frias
Issue Date:September 2013
SAT-based bounded verification of annotated code consists of translating the code together with the annotations to a propositional formula, and analyzing the formula for specification violations using a SAT-solver. If a violation is found, an execution tra...