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. Lecturer: . Qinsi. Wang. May 2, 2012. Z3. high-performance theorem . prover. being developed at Microsoft Research.. mainly by Leonardo de . Moura. and . Nikolaj. . Bjørner. . . Free (online interface, APIs, …) . To AMWG. June 16. , 2015. Status Update of AMWG Change . Requests. Status of AMWG Change Requests . 3. Summary: 42 . Total AMWG Change Requests . 9 . AMWG Change Requests . Delivered . 2014. 1 . AMWG Change . Quantized State Systems. in Applied Mathematics. Fran. çois. E. Cellier. Computer Science Department. ETH Zurich. History of Physical System Simulation I. In the early days of digital physical system simulation (1955-1990), simulation software, such as . Arithmetic Computations . in Embedded Software Code. Presented by: Kuldeep S. Meel. Adapted from slides by Hassan Eldib and Chao Wang (Virginia Tech). A Robotic Dream. Having a tool that automatically synthesizes the optimum version of a software program.. Provers. . Software Engineering Institute. Carnegie Mellon University. Pittsburgh, PA 15213. Arie Gurfinkel. based on joint work with . Teme. . Kahsai. , Jorge A. . Navas. , . Anvesh. . Komuravelli. Nikolaj . Bj. ø. rner and Leonardo de Moura. Microsoft Research. Microsoft Corporation. McMaster University, November 28, 2007. Outline. Verificationeering. @ Microsoft. Introducing Z3, a . Satisfiability. Shaz Qadeer. Research in Software Engineering. Microsoft Research. Satisfiability. modulo theories. (. a .  . c) . (. b .  . c). (. a .  . b . . . c. ). c = . true . b . = . true . Nishant Totla. , . Aditya. . Devarakonda. , . Sanjit. . Seshia. SAT Solving. Given a propositional logic formula in conjunctive normal form (CNF), does there exist a satisfying assignment?. . 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. 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. 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. SMT workshop 2012. Nikolaj . Bjørner. , Ken McMillan, . Andrey. . Rybalchenko. Microsoft Research. Takeaways. Program Verification . as . Solving Recursive Horn Clauses . . as . Satisfiability. By Connor Sample. What is Simultaneous Multithreading (SMT)?. Describes the ability for a processor to execute multiple instructions from multiple distinct threads at the same time.. Goal: Increased processor throughput as well as optimized utilization of system resources.. 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.