1. Software Verification - a postpositivistic approach
Georg Weissenbacher
brought to you by

2. to assure that software fully satisfies all the expected requirements.
Verification?
to assure that software fully satisfies all the expected requirements.
empirical verification
can never be
conclusive!
(Sir Karl Popper)

3. ‘All swans are white.’ (in particular, there are no black ones)

6. Counterexamples
convincing
conclusive
irrefutable

7. Ariane 5 Disaster June 04, 1996 explosion after 42 sec
altitude 3700 meters
MC CPU, 18MHz
approx. 2.8 MIPS
42 s x 2.8 MI/s = 117,6 MI
3.17 x 104 instructions/m
geostationary orbit: km

10. i := i + 1 N
i = 1
i := 0

11. i := i * 5;
j := i + j;
i := 5N;
j := N * 5N; N

13. iN = 5N
jN = N * 5N N

14. Predicate
Abstraction
Widening/
Acceleration
Model
Checking
Invariant
Generation
Abstraction/
Refinement

15. Questions? Thank you for your attention. Please also have
a look at some of our papers:
* Counterexamples with Loops for Predicate Abstraction (CAV 2006). * A Complete Bounded Model Checking Algorithm for Pushdown Systems (SPIN 2007) * A Survey of Automated Techniques for Formal Software Verification (TCAD 2008) * more on