Interface-based Design 5. Tom Henzinger EPFL and UC Berkeley

Size: px

Start display at page:

Download "Interface-based Design 5. Tom Henzinger EPFL and UC Berkeley"

Zoe Margaret Hall
7 years ago
Views:

1 Interface-based Design Tom Henzinger PF and C Berkeley

2 Interface A Interface B Interface A Interface B Code a Code b

3 .. Interface A Interface B Interface A Interface B. Code a Code b. Interface compatibility checking: solving graph games CHIC [Chakrabarti]. Interface refinement checking: alternating simulation relations

4 ... Interface A Interface B Interface A Interface B.. Code a Code b. Interface compatibility checking: solving graph games. Interface refinement checking: alternating simulation relations. Conformance checking of code against interface BAST [Jhala,Majumdar,Sutre]

5 Interface Conformance Checking with BAST example () { : do { ; : if (*) { : ; new ++; } : } while (new!= old); : ; : return; } lock! unlock! Interface Automaton.

6 Interface Conformance Checking with BAST example () { : do { ; : if (*) { : ; new ++; } : } while (new!= old); : ; : return; } Monitor Automaton.

7 Control Flow Graph example () { : do { ; : if (*) { : ; new ++; } : } while (new!= old); : ; : return; } ;

8 Abstract Reachability ;

9 Abstract Reachability ;

10 Abstract Reachability ; ;

11 Abstract Reachability ; ;

12 Abstract Reachability ; ;

13 Concretize rror Trace ; ; true

14 Concretize rror Trace ; ; true true

15 Concretize rror Trace ; new = old ; true true

16 Concretize rror Trace new+ = old ; new = old ; true true

17 Concretize rror Trace new+ = old new+ = old ; new = old ; true true

18 Concretize rror Trace new+ = new new+ = old new+ = old ; new = old ; true true

19 Concretize rror Trace Spurious! new+ = new new+ = old new+ = old ; new = old ; true true

20 Concretize rror Trace Spurious! new+ = new new = old is a relevant predicate new+ = old new+ = old ; new = old ; true true

21 Refined Abstract Reachability, new = old ;

22 Refined Abstract Reachability, new = old, new = old ;, new old ;

23 Refined Abstract Reachability, new = old, new = old ;, new old ;

24 Refined Abstract Reachability, new = old, new = old ;, new old ;, new old

25 Refined Abstract Reachability covered, new = old ;, new = old ;, new old, new old

26 Refined Abstract Reachability, new = old, new = old ;, new old [new!= old], new = old ;, new old

27 Refined Abstract Reachability, new = old, new = old ;, new old [new!= old], new = old, new = old ;, new old

28 Abstract Reachability Tree, new = old ;, new = old ;, new old [new!= old], new = old, new = old, new = old, new old

29 Abstract Reachability Tree = Proof, new = old Inductive invariant: (pc=! Æ new=old) Æ (pc=! Æ new=old) Æ ;, new = old ;, new old [new!= old], new = old, new = old, new = old, new old

30 esson : Automatic Program Verification Abstract + Search Identify relevant facts. Track relevant facts. =

31 A Brief History (and Future) of Model Checking 980s: Theory of finite-state model checking [Clarke/merson, Sifakis, et al.] 990s: Techniques to combat state explosion Finite-state model checking penetrates the hardware industry [Fujitsu, Intel, Motorola, Siemens, etc.] Theory of infinite-state model checking 000s: Techniqes for automatic abstraction Infinite-state model checking penetrates the software industry!

Model Checking of Software

Model Checking of Software Patrice Godefroid Bell Laboratories, Lucent Technologies SpecNCheck Page 1 August 2001 A Brief History of Model Checking Prehistory: transformational programs and theorem proving