Presentation is loading. Please wait.

Presentation is loading. Please wait.

Program Verification: Theory and Practice Sriram K. Rajamani Microsoft Research India (with thanks to Tom Ball for material from his course)

Similar presentations


Presentation on theme: "Program Verification: Theory and Practice Sriram K. Rajamani Microsoft Research India (with thanks to Tom Ball for material from his course)"— Presentation transcript:

1 Program Verification: Theory and Practice Sriram K. Rajamani Microsoft Research India (with thanks to Tom Ball for material from his course)

2 2 Organization Instructors –Deepak DSouza, IISc –Aditya Nori, MSR India –Sriram K. Rajamani, MSR India Teaching Assistant –Madhu Gopinathan, IISc

3 3 PROBLEM

4 4 Software validation problem Does the software work?

5 5 Software validation problem Does the software work? I hope it doesnt crash! I hope it still interoperates with my other software in the same way as the previous version! I hope some hacker cannot steal all my money, and publish all my on the web I hope it can handle my peak transaction load

6 6 How do we do software validation? Testing: The old-fashioned way Run it and see if it works Fix it if it doesnt work Ship it if it doesnt crash!

7 7 What is wrong with testing?

8 8

9 9 Program Verification The algorithmic discovery of properties of a program by inspection of the source text - Manna and Pnueli, Algorithmic Verification Also known as: static analysis, static program analysis, formal methods,….

10 10 Difficulty of program verification What will you prove? –Specification of a complex software is as complex as the software itself Deep specifications of software are hard to prove –State-of-art in tools and automation not good enough

11 11 Elusive triangle 11 Large programs Deep properties Automation We will let go of this one!

12 12

13 13 void Foo( int * ptr, int const * ptrToConst, int * const constPtr, int const * const constPtrToConst ) { *ptr = 0; ptr = 0; *ptrToConst = 0; ptrToConst = 0; *constPtr = 0; constPtr = 0; *constPtrToConst = 0; constPtrToConst = 0; }

14 14 void Foo( int * ptr, int const * ptrToConst, int * const constPtr, int const * const constPtrToConst ) { *ptr = 0; // OK: modifies the pointee ptr = 0; // OK: modifies the pointer *ptrToConst = 0; // Error! Cannot modify the pointee ptrToConst = 0; // OK: modifies the pointer *constPtr = 0; // OK: modifies the pointee constPtr = 0; // Error! Cannot modify the pointer *constPtrToConst = 0; // Error! Cannot modify the pointee constPtrToConst = 0; // Error! Cannot modify the pointer }

15 15

16 16

17 17

18 18

19 19

20 20

21 21 Worse is better, also called the New Jersey style, is the name of a computer software design approach (or design philosophy) in which simplicity of both interface and implementation is more important than any other system attribute (including correctness, consistency, and completeness). computersoftware designdesign philosophyinterface

22 22

23 23

24 24

25 25

26 26 Do I need to annotate my program before I can use the tool? How long does the tool take to run? How do I manage the huge number of error messages initially produced? How can I suppress false alarms (an incorrect error message)? What do I know about my program when the tool reports no errors? How can I extend the checking capability of the tool?

27 27 unreachable States reachable init unsafe

28 28

29 29

30 30

31 31 Reading assignment… Read Findbugs paper Read Java Bytecode Verification paper bytecode-verification.ps.gz


Download ppt "Program Verification: Theory and Practice Sriram K. Rajamani Microsoft Research India (with thanks to Tom Ball for material from his course)"

Similar presentations


Ads by Google