Loading in 5 sec....

Interpolation-Sequence Based Model CheckingPowerPoint Presentation

Interpolation-Sequence Based Model Checking

- 84 Views
- Uploaded on
- Presentation posted in: General

Interpolation-Sequence Based Model Checking

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -

Yakir Vizel1,2

and

Orna Grumberg1

Interpolation-Sequence Based Model Checking

Computer Science Department, The Technion, Haifa, Israel.

Architecture, System Level and Validation Solutions, Intel Development Center, Haifa, Israel

Formal Methods in Computer Aided Design, Austin, Texas 2009

- Introduction
- Model checking
- Forward Reachability Analysis
- Bounded Model Checking

- Interpolation
- Interpolation
- Interpolation-Sequence

- Interpolation-Sequence Based Model Checking
- Experimental Results

Formal Methods in Computer Aided Design, Austin, Texas 2009

Formal Methods in Computer Aided Design, Austin, Texas 2009

- Given a system and a specification, does the system satisfy the specification.

System

AGq

MC

?

- The specification is given in temporal logic – e.g. LTL.
- We deal with specifications of the form AGq.

Formal Methods in Computer Aided Design, Austin, Texas 2009

…… Sn

S2

BAD ¬q

S1

INIT

Formal Methods in Computer Aided Design, Austin, Texas 2009

- Does the system have a counterexample of length k?

.

.

.

Formal Methods in Computer Aided Design, Austin, Texas 2009

S3

S2

S1

INIT

BAD ¬q

I3

I1

I2

INIT

Formal Methods in Computer Aided Design, Austin, Texas 2009

Formal Methods in Computer Aided Design, Austin, Texas 2009

- Given the following BMC formula.

A

B

I

Formal Methods in Computer Aided Design, Austin, Texas 2009

- The same BMC formula partitioned in a different manner:

A1

Ak+1

A2

A3

Ak

I1

I2

I3

Ik-1

Ik

Formal Methods in Computer Aided Design, Austin, Texas 2009

- Can easily be computed. For 1 ≤ j < n
- A = A1Ù … Ù Aj
- B = Aj+1 Ù … Ù An
- Ijis the interpolant for the pair (A,B)

Formal Methods in Computer Aided Design, Austin, Texas 2009

Formal Methods in Computer Aided Design, Austin, Texas 2009

I1,1

I1

I1,2

I2,2

Formal Methods in Computer Aided Design, Austin, Texas 2009

- A way to do reachability analysis using a SAT solver.
- Uses the original BMC loop and adds an inclusion check for full verification.
- Similar sets to those computed by Forward Reachability Analysis but over-approximated.

Formal Methods in Computer Aided Design, Austin, Texas 2009

- Use BMC to search for bugs.
- Partition the checked BMC formula and extract the interpolation sequence

I1,N

IN-1,N

IN,N

I2,N

Formal Methods in Computer Aided Design, Austin, Texas 2009

S3

S2

S1

INIT

BAD ¬q

I3

I2

I1

I1

I2

INIT

I1,3

I2,3

I3,3

I1,1

I1,2

I2,2

Formal Methods in Computer Aided Design, Austin, Texas 2009

- The computation itself is different.
- Uses basic interpolation.
- Successive calls to BMC for the same bound.
- Not incremental.

- The sets computed are different.

J1

I1

S1

Formal Methods in Computer Aided Design, Austin, Texas 2009

Formal Methods in Computer Aided Design, Austin, Texas 2009

- Experiments were conducted on two future CPU designs from Intel (two different architectures/tocks)

Formal Methods in Computer Aided Design, Austin, Texas 2009

Formal Methods in Computer Aided Design, Austin, Texas 2009

Formal Methods in Computer Aided Design, Austin, Texas 2009

Formal Methods in Computer Aided Design, Austin, Texas 2009

- False properties is always faster.
- True properties – results vary. Heavier properties favor ISB where the easier favor IB.
- Some properties cannot be verified by one method but can be verified by the other and vise-versa.

Formal Methods in Computer Aided Design, Austin, Texas 2009

- A new SAT-based method for unbounded model checking.
- BMC is used for falsification.
- Simulating forward reachability analysis for verification.

- Method was successfully applied to industrial sized systems.

Formal Methods in Computer Aided Design, Austin, Texas 2009

Thank You!

Formal Methods in Computer Aided Design, Austin, Texas 2009