k-Step Relative Inductive Generalization

Details k-Step Relative Inductive Generalization k-Step Relative Inductive Generalization

2010-03-18

arxiv.org/abs/1003.3649v1

Computer Science

Discrete Mathematics

14 pages

Scientific paper

We introduce a new form of SAT-based symbolic model checking. One common idea in SAT-based symbolic model checking is to generate new clauses from states that can lead to property violations. Our previous work suggests applying induction to generalize from such states. While effective on some benchmarks, the main problem with inductive generalization is that not all such states can be inductively generalized at a given time in the analysis, resulting in long searches for generalizable states on some benchmarks. This paper introduces the idea of inductively generalizing states relative to $k$-step over-approximations: a given state is inductively generalized relative to the latest $k$-step over-approximation relative to which the negation of the state is itself inductive. This idea motivates an algorithm that inductively generalizes a given state at the highest level $k$ so far examined, possibly by generating more than one mutually $k$-step relative inductive clause. We present experimental evidence that the algorithm is effective in practice.

Affiliated with

Also associated with

No associations

Rating

k-Step Relative Inductive Generalization 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 k-Step Relative Inductive Generalization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and k-Step Relative Inductive Generalization will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-700840