PPT-Loop-Invariant Synthesis using Techniques from Constraint P

Antoine Miné Jason Breck Thomas Reps Dagstuhl November 2015 The Pliny Project Question for future work How can we make the best use of loop invariants to support code search synthesis and repair. 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 15. 14. A Chessboard Problem. ?. A . Bishop . can only move along a diagonal. Can a . bishop . move from its current position to the question mark?. . March 9, 2012. Speaker:. Meng . Qi. co-authors . : . Thanh-Tung . Cao, Tiow-Seng Tan. 1. Outline. Background. Motivation & Algorithm Overview. GPU-CDT. Proof & Analysis. Experiment Results. Nafi Diallo. Computer Science. NJIT. Advisor: Dr. Ali Mili. . Outline. 1. Introduction. 2. Progress. 3. . Prospects. 4. Conclusion. Introduction. Research Progress. Proposed work. Conclusion. Neil . mcculloch. and Dalia Zileviciute. Energy and economic growth research programme. 3-4 November, Washington . d.c.. The questions and the answers. Is electricity supply a binding constraint to economic growth in developing countries?. fonts used in EMF. . Read the . TexPoint. manual before you delete this box.: . A. A. Sumit. . Gulwani. (Microsoft Research, Redmond, USA). Symbolic Bound Computation. Art of Invariant Generation. Introduction to Programming. Prof. Dr. Bertrand Meyer. Lecture 8: Control Structures I. In this (double) lecture. The notion of algorithm. Basic control structures: sequence, conditional, loop. Decision structures: variants of conditional instruction. Rahul Sharma and Alex Aiken (Stanford University). 1. Randomized Search. x. = . i. ;. y = j;. while . y!=0 . do. . x = x-1;. . y = y-1;. if( . i. ==j ). assert x==0. No!. Yes!.  . 2. Invariants. Discuss with your group.. Be prepared to share your answers. . The Hardest Part. The synthesis section is the hardest part of the exam. It is worth . 47. % . of the entire exam!. 17 % -- multiple choice. . Parts 1-4 – Data Extraction, Quality Assessment, Synthesising Across Studies, . Completing the Analysis. Workshop: . Framework Synthesis, Meta-Ethnography and Realist Synthesis . Shared Topic: . Srinivas Pinisetty. Based on material from . Atze van der . Ploeg. , Wolfgang . Aherndt. ,... Weakest precondition rules. wp is a . computable. function!. wp(x . := e , . R. ) . = . R. [x . →e]. wp(. Preconditions . for . Compiler Optimizations. Nuno Lopes. Advisor. : José Monteiro. Automatic. . Synthesis. . of. . Weakest. . Preconditions. for . Compiler. . Optimizations. Expectations for Compilers. Strategies for organizationClimactic orderarranges the most important/persuasive evidence last since this is what is remembered Problem/solutionestablishes the problem in the introduction then offers Find a bottle:. 4. Categories. Instances. Find these two objects. Can’t do. unless you do not . care about few errors…. Can nail it. Building a Panorama. M. Brown and D. G. Low. e. . Recognising Panorama. University of Pennsylvania. 1. Program Verification. 2. Verifier. Proof of correctness or Witness of a bug. Specification S. Program P. Classical Program Synthesis. 3. Synthesizer. Specification S. High Level.