PPT-SMT solvers in Program Analysis and Verification

Nikolaj Bj ø rner Microsoft Research Lecture 2 Overview of the lectures Day Topics Lab 1 Overview of SMT and applications SAT solving Z3 Encoding combinatorial problems with Z3 2 Congruence closure. 0368-. 4479. http://www.cs.tau.ac.il/~maon/teaching/2013-2014/paav/paav1314b.html. Noam Rinetzky. Lecture . 4: . Denotational Semantics. Slides . credit: Roman . Manevich. , . Mooly. . Sagiv. , . Eran. can . be incorporated in teaching. K. Rustan M. Leino. Research in Software Engineering (. RiSE. ). Microsoft Research, Redmond, WA, USA. Invited talk. Informatics Education in Europe (IEE III’08). Teaching & Learning Conference. Jane Nolan MBE. Entrepreneur in Residence and Development Officer (Careers Service). Katie Wray. Lecturer in Enterprise (SAgE Faculty). Entrepreneurial Students. Some statistics:. Shaz Qadeer. Research in Software Engineering. Microsoft Research. Satisfiability. modulo theories. (. a .  . c) . (. b .  . c). (. a .  . b . . . c. ). c = . true . b . = . true . Richard Peng. Georgia Tech. Based on . recent works . joint with:. Serban . Stan (Yale. ), . Haoran. . Xu (MIT. ),. Shen . Chen Xu (CMU. ), . Saurabh. . Sawlani. (. GaTech. ). John . Gilbert (UCSB. Lecture 15. Introduction to Program. Analysis. Program Analysis. auxiliary information. (hints, proof steps, types). Can come . from compiler or user. Goal:. Automatically computes potentially useful information about the program.. Preprocessing. Can . Efficiently. . Simulate. Resolution. Paul . Beame. *. . Ashish Sabharwal. . *. Computer Science and Engineering, University of Washington, Seattle, WA, USA. . Allen Institute for Artificial Intelligence, Seattle, WA, USA. SMT workshop 2012. Nikolaj . Bjørner. , Ken McMillan, . Andrey. . Rybalchenko. Microsoft Research. Takeaways. Program Verification . as . Solving Recursive Horn Clauses . . as . Satisfiability. Lecture 1: Introduction. Roman . Manevich. Ben-Gurion University. December 31, 2008. 30GB . Zunes. all over the world fail en masse. 2. Zune bug. 1 while (days > 365) { . 2 if (. IsLeapYear. (year)) { . FEKOBy offering a selection of different solvers FEKO users can choose the method that is most suitable to the problem that they are trying to solve or use more than one solver for cross validation pu VS Experiments 2008 . –. Toronto, Canada. Leonardo de Moura. Microsoft Research. Agenda. What is SMT?. Experiments:. Windows kernel verification.. Extending SMT solvers.. Garbage collector (Singularity) verification. K. Rustan M. Leino. RiSE. , Microsoft Research, Redmond. PROLE 2009. 09/09/2009. San Sebastian, Spain. Software quality assurance. A major software engineering concern. Costly. Relies heavily on testing. Jaideep. . Nijjar. . Tevfik Bultan. University of California, Santa Barbara. ASE 2012. Web . Software Everywhere. Commerce, entertainment, social interaction. We will rely on web apps more in the future. George Varghese. 1. NETWORK VERIFICATION: . WHEN . HOARE . MEETS . CERF. George Varghese. (based on a tutorial with . Nikolaj. . Bjorner. of MSR). 2. FOR PUBLIC CLOUDS, PRIVATE CLOUDS, ENTERPRISE NETWORKS, ISPs, .