1. By D. Beyer et. al. Simon Fraser University (Spring 09) Presentation By: Pashootan Vaezipoor

2.  Model Checking is a technique to verify a system desc against a spec  Input: ▪ Program source (system desc) ▪ Temporal safty property (spec)  Output: ▪ Proof of correctness ▪ Counterexample Simon Fraser University (Spring 09) Presentation By: Pashootan Vaezipoor

3.  The paradigm behind some verification tools:  CounterExample Guided Abstraction Refinement

4.  Software Model Checking  Checking Memory Safety  Generating Test Simon Fraser University (Spring 09) Presentation By: Pashootan Vaezipoor

5.  Automatic Software Verification Tools:  Execution-based ▪ Find bugs ▪ Scale the search to large state spaces  Abstraction-based ▪ Proving correctness ▪ Improve precision  But CEGAR combines these two!  Automatic precision adjustment  Keeps the state space small Simon Fraser University (Spring 09) Presentation By: Pashootan Vaezipoor

6.  Memory Safety  First we use CC URED to mark possible locations  Use Blast to eliminate unreachable error marks  Identify usage scenarios leading to errors  Test Case Generation  We need a spec or a set of coverage goals  Instead of the error path, BLAST creates a test vector ▪ Test vector to the state q that always satisfies p ▪ Test vector to the state q that never satisfies p ▪ Test vector to the state q that smt satisfies p but smt not Simon Fraser University (Spring 09) Presentation By: Pashootan Vaezipoor

7. Simon Fraser University (Spring 09) Presentation By: Pashootan Vaezipoor

8. Simon Fraser University (Spring 09) Presentation By: Pashootan Vaezipoor

9. Simon Fraser University (Spring 09) Presentation By: Pashootan Vaezipoor