Symbolic Execution for Verification

Details Symbolic Execution for Verification Symbolic Execution for Verification

2011-03-10

arxiv.org/abs/1103.2027v1

Computer Science

Programming Languages

15 pages

Scientific paper

In previous work, we presented a symbolic execution method which starts with a concrete model of the program but progressively abstracts away details only when these are known to be irrelevant using interpolation. In this paper, we extend the technique to handle unbounded loops. The central idea is to progressively discover the strongest invariants through a process of loop unrolling. The key feature of this technique, called the minimax algorithm, is intelligent backtracking which directs the search for the next invariant. We then present an analysis of the main differences between our symbolic execution method and mainstream techniques mainly based on abstract refinement (CEGAR). Finally, we evaluate our technique against available state-of-the-art systems.

Affiliated with

Also associated with

No associations

Rating

Symbolic Execution for Verification does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Symbolic Execution for Verification, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Symbolic Execution for Verification will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-631416