Proving Safety with Trace Automata and Bounded Model Checking

Download Now
Provided by: Cornell University
Topic: Software
Format: PDF
Loop under-approximation is a technique that enriches C programs with additional branches that represent the effect of a (limited) range of loop iterations. While this technique can speed up the detection of bugs significantly, it introduces the redundant execution traces which may complicate the verification of the program. This holds particularly true for verification tools based on bounded model checking, which incorporate simplistic heuristics to determine whether all feasible iterations of a loop have been considered.
Download Now

Find By Topic