PPT-Experiments in Software Verification using SMT Solvers

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. Program Analysis and Verification . Nikolaj Bj. ø. rner. Microsoft Research. Lecture 5. Overview of the lectures. Day. Topics. Lab. 1. Overview of SMT and applications. . SAT solving part I.. Program exploration with Pex. Yeting. . Ge. Clark Barrett. SMT . 2008. July 7 Princeton. SMT solvers are more complicated. CVC3 contains over 100,000 lines of code. Are SMT solvers correct?. . Quest for . correct. SMT solvers?. 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:. Nikolaj . Bj. ø. rner and Leonardo de Moura. Microsoft Research. Microsoft Corporation. McMaster University, November 28, 2007. Outline. Verificationeering. @ Microsoft. Introducing Z3, a . Satisfiability. A Tutorial. Nikolaj Bjørner . Microsoft Research. Dagstuhl . April 23, 2015. Plan. SMT in a nutshell. SMT solving walkthrough by example. Selected Theory solvers. Equalities. Arrays. Arithmetic. Combining Solvers. 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. : A Threaded Sparse LU factorization . utilizing Hierarchical Parallelism and Data Layouts. Siva Rajamanickam . Joshua Booth, Heidi . Thornquist. Sixth International Workshop on Accelerators and Hybrid . Guy Katz. Schloss. . Dagstuhl. , October 2016. Acknowledgements . Based on joint work with Clark Barrett, Cesare . Tinelli. , Andrew Reynolds and Liana . Hadarean. (. FMCAD’16. ). 2. Stanford . University. Verification is confirmation of eligibility for free and reduced price meals under NSLP and SBP. . Verification is . not . required for CEP schools or DC students. . Verification activities begin on Oct. 1 and must be concluded by November. Verification Tracking Flag. 2016-2017. 2017-2018. V1. Standard Verification Group. Standard Verification Group. V4. Custom Verification (HS Completion, Identity, SNAP, Child Support Paid). 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. 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. Sriram Rajamani. (based on notes/slides by Matt Fredrickson, Andre . Platzer. , . Emina Torlak and Leonardo . De Moura). Modern SAT solvers. First convert a formula to CNF (Conjunctive Normal Form). Use variant of DPLL (Davis Putnam . INTerpolation. and . Abstract . interpretation. Arie. . Gurfinkel. (SEI/CMU). with . Aws. . Albarghouthi. and Marsha . Chechik. (U. of Toronto). and . Sagar. . Chaki. (SEI/CMU), and Yi Li (U. of Toronto).