REPAIRING PROGRAMS WITH SEMANTIC CODE SEARCH. Yalin Ke Kathryn T. Stolee Claire Le Goues Yuriy Brun
|
|
|
- Helen Johnston
- 5 years ago
- Views:
Transcription
1 REPAIRING PROGRAMS WITH SEMANTIC CODE SEARCH Yalin Ke Kathryn T. Stolee Claire Le Goues Yuriy Brun Iowa State Iowa State Carnegie Mellon UMass Amherst 1
2 Input: buggy program, tests Output: fixed program SearchRepair Potential patches Uses semantic code search 2
3 CC BY-NC: Fir0002/Flagstaffotos 3
4 PROBLEM PATCH QUALITY 4
5 Input: buggy program, tests Automatic repair magic Output: fixed program Potential patches Performance on withheld tests? 5
6 OVERFITTING Does the patch generalize beyond the test cases used to create it? Edward K. Smith, Earl Barr, Claire Le Goues, and Yuriy Brun, Is the Cure Worse than the Disease? Overfitting in Automated Program Repair, ESEC/FSE
7 Input: buggy program, tests Output: fixed program SearchRepair Potential patches Performance on withheld tests! 7
8 COMPUTE THE MEDIAN OF THREE NUMBERS 8
9 int median(int a, int b, int c) { int result; } if ((b<=a && a<=c) (c<=a && a<=b)) result = a; if ((a<b && b <= c) (c<=b && b<a)) result = b; if ((a<c && c<b) (b<c && c<a)) result = c; return result; 9
10 int median(int a, int b, int c) { int result = 0; } if ((b<=a && a<=c) (c<=a && a<=b)) result = a; if ((a<b && b <= c) (c<=b && b<a)) result = b; if ((a<c && c<b) (b<c && c<a)) result = c; return result; 10
11 int median(int a, int b, int c) { int result = 0; } if ((b<=a && a<=c) (c<=a && a<=b)) result = a; if ((a<b && b <= c) (c<=b && b<a)) result = b; if ((a<c && c<b) (b<c && c<a)) result = c; return result; 11
12 int median(int a, int b, int c) { int result = 0; } if ((b<=a && a<=c) (c<=a && a<=b)) result = a; if ((a<b && b <= c) (c<=b && b<a)) result = b; if ((a<c && c<b) (b<c && c<a)) result = c; return result; 12
13 int median(int a, int b, int c) { int result = 0; } if ((b<=a && a<=c) (c<=a && a<=b)) result = a; if ((a<b && b <= c) (c<=b && b<a)) result = b; if ((a<c && c<b) (b<c && c<a)) result = c; return result; 13
14 int median(int a, int b, int c) { int result = 0; } if ((b<=a && a<=c) (c<=a && a<=b)) result = a; if ((a<b && b <= c) (c<=b && b<a)) result = b; if ((a<c && c<b) (b<c && c<a)) result = c; return result; 14
15 int median(int a, int b, int c) { int result = 0; } if ((b<=a && a<=c) (c<=a && a<=b)) result = a; if ((a<b && b <= c) if ((a<b && b <= c) (c<=b && b<a)) result = b; if ((a<c && c<b) (b<c && c<a)) result = c; return result; 15
16 int median(int a, int b, int c) { int result = 0; } if ((b<=a && a<=c) (c<=a && a<=b)) result = a; if ((a<b && b <= c) (c<=b && b<a)) result = b; if ((a<c && c<b) (b<c && c<a)) result = c; return result; 16
17 int med_broken(int a, int b, int c) { int result; } if ((a==b) (a==c) (b<a && a<c) (c<a && a<b)) result = a; else if ((b==c) (a<b && b<c) (c<b && b<a)) result = b; else if (a<c && c<b) result = c; return result; 17
18 int med_broken(int a, int b, int c) { int result; } if ((a==b) (a==c) (b<a && a<c) (c<a && a<b)) result = a; else if ((b==c) (a<b && b<c) (c<b && b<a)) result = b; else if (a<c && c<b) result = c; return result; 18
19 int med_broken(int a, int b, int c) { int result; } if ((a==b) (a==c) (b<a && a<c) (c<a && a<b)) result = a; else if ((b==c) (a<b && b<c) (c<b && b<a)) result = b; else if (a<c && c<b) result = c; return result; 19
20 int med_broken(int a, int b, int c) { int result; } if ((a==b) (a==c) (b<a && a<c) (c<a && a<b)) result = a; else if ((b==c) (a<b && b<c) (c<b && b<a)) result = b; else if (a<c && c<b) result = c; return result; Input Expected Pass? 0,0,0 0 2,0,1 1 X 0,0,1 0 0,1,0 0 0,2,1 1 0,2,3 2 20
21 int med_broken(int a, int b, int c) { int result; } if ((a==b) (a==c) (b<a && a<c) (c<a && a<b)) result = a; if (b < a) result = c; else if (b<a) (b==c) (a<b && b<c) (c<b && b<a)) result = b; else if (a<c && c<b) result = c; return result; Input Expected Pass? 0,0,0 0 2,0,1 1 X 0,0,1 0 0,1,0 0 0,2,1 1 0,2,3 2 21
22 int med_broken(int a, int b, int c) { int result; } if ((a==b) (a==c) (b<a && a<c) (c<a && a<b)) result = a; if (b < a) result = c; if (b<a) (b==c) (a<b && b<c) (c<b && b<a)) result = b; if (a<c && c<b) result = c; return result; Input Expected Pass? 0,0,0 0 2,0,1 1 X 0,0,1 0 0,1,0 0 0,2,1 1 0,2,3 2 22
23 int med_broken(int a, int b, int c) { int result; } if ((a==b) (a==c) (b<a && a<c) (c<a && a<b)) result = a; if (b < a) result = c; else if (b<a) (b==c) (a<b && b<c) (c<b && b<a)) result = b; else if (a<c && c<b) result = c; return result; Input Expected Pass? 0,0,0 0 2,0,1 1 0,0,1 0 0,1,0 0 0,2,1 1 0,2,3 2 23
24 int med_broken(int a, int b, int c) { int result; } if ((a==b) (a==c) (b<a && a<c) (c<a && a<b)) result = a; if ((b==c) (a<b && b<c) result = b; if (a<c && c<b) result = c; return result; (c<b && b<a)) Input Expected Pass? 2,6,8 6 2,8,6 6 6,2,8 6 6,8,2 6 8,2,6 6 X 8,6,2 6 9,9,9 9 24
25 int med_broken(int a, int b, int c) { int result; } if ((a==b) (a==c) (b<a && a<c) (c<a && a<b)) result = a; if (b < a) result = c; else if (b<a) (b==c) (a<b && b<c) (c<b && b<a)) result = b; else if (a<c && c<b) result = c; return result; Input Expected Pass? 0,0,0 0 2,0,1 1 0,0,1 0 0,1,0 0 0,2,1 1 0,2,3 2 Input Expected Pass? 2,6,8 6 2,8,6 6 6,2,8 6 X 6,8,2 6 8,2,6 6 8,6,2 6 X 9,9,9 9 25
26 26
27 WHAT IF Instead of trying to make small changes, we replaced buggy regions with code that correctly captures the overall desired logic? Principle: using human-written code to fix code at a higher granularity level leads to better quality repairs. 27
28 SearchRepair: THE PLAN 1. Localize bug to a region. 2. Create input/output examples that show what the code should do. 3. Use semantic code search to find snippets that do the right thing. 4. Construct and test candidate patches for each result from the search. 28
29 encoding Snippet DB Results patch construction Profile/ Queries fault localization + analysis 29
30 MODIFIED SB-FAULT LOCALIZATION int med_broken(int a, int b, int c) { int result; if ((a==b) (a==c) (b<a && a<c) (c<a && a<b)) result = a; else if ((b==c) (a<b && b<c) (c<b && b<a)) result = b; else if (a<c && c<b) result = c; return result; } Input Expected Pass? 6,2,8 6 6,8,2 6 8,2,6 6 X 8,6,2 6 James A. Jones, Mary Jean Harrold, and John Stasko. Visualization of test information to assist fault localization. ICSE M. Gabel and Z. Su. A study of the uniqueness of source code. FSE,
31 encoding Snippet DB Results patch construction Profile/ Queries fault localization + analysis 31
32 SEARCHREPAIR: HIGH-QUALITY AUTOMATED BUG REPAIR USING SEMANTIC SEARCH 32
33 SEMANTIC CODE SEARCH Keyword: C median three numbers Semantic: Input Expected 2,6,8 6 2,8,6 6 6,2,8 6 6,8,2 6 8,6,2 6 9,9,9 9 K. T. Stolee, S. Elbaum, M. B. Dwyer, "Code search with input/output queries: Generalizing, ranking, and assessment, JSS K. T. Stolee, S. Elbaum, and D. Dobos "Solving the Search for Source Code". TOSEM Steven P. Reiss. Semantics-based code search. ICSE,
34 Query 2,6,8 à 6 Code Search Engine Repository Results 34
35 Query Code Search Engine Matching Repository R a n k i n g Results Indexing 35
36 SEMANTIC CODE SEARCH 1. Store candidate snippets as symbolic constraints. 2. Search using input/output examples that show what the desired code should do. 3. See which symbolic constraints are cosatisfiable with the input/output examples constraints (Z3). 36
37 encoding Profile/ Queries Snippet DB Results Dynamic analysis captures types, values of variables before/after buggy region on the passing test cases. patch construction fault localization + analysis 37
38 int med_broken(int a, int b, int c) { int result; if ((a==b) (a==c) (b<a && a<c) (c<a && a<b)) result = a; } else if ((b==c) (a<b && b<c) (c<b && b<a)) result = b; else if (a<c && c<b) result = c; return result; Output: a=6, b=2, c=8, result=6 Input: a=6, b=2, c=8, result=* Input Expected Pass? 6,2,8 6 6,8,2 6 8,2,6 6 X 8,6,2 6 38
39 Input: a=6, b=2, c=8, result=* Output: a=6, b=2, c=8, result=6 Code Search Engine Repository (Eliding encoding details, but note that SMT solvers provide satisfying models; we use it to establish mapping between snippet and buggy context.) Match! if((x<=y && x>=z) (x>=y && x<=z)) m = x; else if((y<=x && y>=z) (y>=x && y<=z)) m = y; else m = z; 39
40 encoding Snippet DB Results patch construction Profile/ Queries fault localization + analysis 40
41 int med_broken(int a, int b, int c) { int result; if ((a==b) (a==c) (b<a && a<c) (c<a && a<b)) result = a; else if ((b==c) (a<b && b<c) (c<b && b<a)) result = b; else if (a<c && c<b) result = c; return result; } 41
42 int med_broken(int a, int b, int c) { int result; if ((a==b) (a==c) (b<a && a<c) (c<a && a<b)) result = a; else if ((b==c) (a<b && b<c) (c<b && b<a)) result = b; else if (a<c && c<b) result = c; return result; } 42
43 int med_broken(int a, int b, int c) { int result; if((x<=y && x>=z) (x>=y && x<=z)) m = x; else if((y<=x && y>=z) (y>=x && y<=z)) m = y; else m = z; } return result; 43
44 int med_broken(int a, int b, int c) { int result; if((a<=b && a>=c) (a>=b && a<=c)) result = a; else if((b<=a && b>=c) (b>=a && b<=c)) result = b; else result = c; } return result; 44
45 int med_broken(int a, int b, int c) { int result; if((a<=b && a>=c) (a>=b && a<=c)) result = a; else if((b<=a && b>=c) (b>=a && b<=c)) result = b; else result = c; return result; } 45
46 int med_broken(int a, int b, int c) { int result; if((a<=b && a>=c) (a>=b && a<=c)) result = a; else if((b<=a && b>=c) (b>=a && b<=c)) result = b; else result = c; return result; } Input Expected Pass? 6,2,8 6 6,8,2 6 8,2,6 6 8,6,2 6 46
47 encoding Snippet DB Results patch construction Profile/ Queries fault localization + analysis 47
48 RECALL GOAL: FIXING BUGS THIS WAY RESULTS IN HIGHER-QUALITY PATCHES. EVALUATION 48
49 INTROCLASS Dataset: benchmark of student-written C programs Key: two independent test suites. Use one for repair, one for validation of quality claims! Code DB constructed of other students answers. Program Versions Description checksum digits grade median smallest syllables check sum of a string digits of a number 226 grade from score Total 778 median of three numbers smallest of four numbers count vowels in string Le Goues et al., The ManyBugs and IntroClass Benchmarks for Automated Repair of C Programs, TSE
50 SUCCESS CRITERIA METRICS Defects repaired. Patch quality: percentage of held-out test cases that a patched program passes. COMPARISON Previous work: GenProg [1] AE [2] TrpAutoRepair/RSRepair [3, 4] [1] Claire Le Goues, ThanhVu Nguyen, Stephanie Forrest and Westley Weimer. GenProg: A Generic Method for Automated Software Repair. TSE [2] Westley Weimer, Zachary P. Fry, Stephanie Forrest: Leveraging Program Equivalence for Adaptive Program Repair: Models and First Results. ASE [3] Y. Qi, X. Mao, and Y. Lei. Efficient automated program repair through fault-recorded testing prioritization. ICSM [4] Yuhua Qi, Xiaoguang Mao, Yan Lei, Ziying Dai, and Chengsong Wang. The strength of random search on automated program repair. ICSE
51 program SearchRepair AE GenProg TrpAuto/ RSRepair Total checksum digits grade median smallest syllables total
52 CURRENT LIMITATIONS Snippet encoding: need support for more datatypes, library calls, console output, etc. Hand-rolled symbolic execution. Match queries: various inefficiencies, especially in mapping variables to context. 52
53 program SearchRepair AE GenProg TrpAuto/ RSRepair Total checksum digits grade median smallest syllables total unique program/bugs repaired total 53
54 RSRepair total: 247 RSRepair: GenProg: 42 0 AE: 1 GenProg total: 287 AE total:
55 SearchRepair total: 150 RSRepair total: 247 SearchRepair: 20 0 RSRepair: GenProg: 32 0 AE: 1 GenProg total: 287 AE total:
56 QUALITY Use the second test suite (from KLEE) to assess degree to which the patches generalize beyond the tests used to create them. Recall: Patched programs pass all tests used to create them by definition. SearchRepair GenProg RSRepair/ TRPAutoRepair AE 97.2% 68.7% 72.1% 64.2% 56
57 TAKEAWAY SearchRepair uses semantic search to fix bugs by looking for code that does the right thing. Compared to previous work, SearchRepair: Repairs different faults Produces patches of measurably higher quality. Code at: 57
An automated approach to program repair with semantic code search
Graduate Theses and Dissertations Iowa State University Capstones, Theses and Dissertations 2015 An automated approach to program repair with semantic code search Yalin Ke Iowa State University Follow
Upcoming. Repairing Automated Repair. Generalizing 3/19/18
Upcoming Homework 3 due March 22 Literature review due today March 20 Project plan assignment posted, due April 10 Repairing Automated Repair Paper presentation instructions: http://people.cs.umass.edu/~brun/class/2018spring/cs21/paperpresentation/paperpresentation.pdf
Program Synthesis. SWE 795, Spring 2017 Software Engineering Environments
Program Synthesis SWE 795, Spring 2017 Software Engineering Environments Today HW3 is due next week in class! Part 1 (Lecture)(~50 mins) Break! Part 2 (Discussion)(~60 mins) Discussion of readings Part
A Systematic Study of Automated Program Repair: Fixing 55 out of 105 Bugs for $8 Each
A Systematic Study of Automated Program Repair: Fixing 55 out of 105 Bugs for $8 Each Claire Le Goues (Virginia), Michael Dewey-Vogt (Virginia), Stephanie Forrest (New Mexico), Westley Weimer (Virginia)
Automated Program Repair by Using Similar Code Containing Fix Ingredients
Automated Program Repair by Using Similar Code Containing Fix Ingredients Tao Ji, Liqian Chen, Xiaoguang Mao, Xin Yi College of Computer National University of Defense Technology Changsha, China jitao
Course updates. Repairing Automated Repair. Generalizing 3/20/17. Literature review was due today Project plan assignment is posted, due April 11
3/20/17 Course updates Repairing Automated Repair Literature review was due today Project plan assignment is posted, due April 11 Homework 3 due this Thursday, 9 AM EDT Homework 4 in posted, due April
IntroClassJava: A Benchmark of 297 Small and Buggy Java Programs
IntroClassJava: A Benchmark of 297 Small and Buggy Java Programs Thomas Durieux, Martin Monperrus To cite this version: Thomas Durieux, Martin Monperrus. IntroClassJava: A Benchmark of 297 Small and Buggy
DynaMoth: Dynamic Code Synthesis for Automatic Program Repair
DynaMoth: Dynamic Code Synthesis for Automatic Program Repair AST 2016 Thomas Durieux & Martin Monperrus March 6, 2017 Inria & University of Lille Automatic test-suite based repair DynaMoth is an automatic
Precise Program Repair
Precise Program Repair Yingfei Xiong Peking University Background of Yingfei Xiong 2000~2004,UESTC, Undergraduate 2004~2006,Peking University, Graduate Adivsor: Hong Mei, Fuqing Yang 2006~2009,The University
Automatically Finding Patches Using Genetic Programming
Automatically Finding Patches Using Genetic Programming Authors: Westley Weimer, ThanhVu Nguyen, Claire Le Goues, Stephanie Forrest Presented by: David DeBonis, Qi Lu, Shuang Yang Department of Computer
Automatic Repair of Real Bugs in Java: A Large-Scale Experiment on the Defects4J Dataset
Automatic Repair of Real Bugs in Java: A Large-Scale Experiment on the Defects4J Dataset Matias Martinez, Thomas Durieux, Romain Sommerard, Jifeng Xuan, Martin Monperrus 1 Automatic Software Repair Automatic
Combining Bug Detection and Test Case Generation
Combining Bug Detection and Test Case Generation Martin Kellogg University of Washington, USA kelloggm@cs.washington.edu ABSTRACT Detecting bugs in software is an important software engineering activity.
Using Execution Paths to Evolve Software Patches
Using Execution Paths to Evolve Software Patches ThanhVu Nguyen*, Westley Weimer**, Claires Le Gouges**, Stephanie Forrest* * University of New Mexico ** University of Virginia Tuesday, March 31, 2009
An Unsystematic Review of Genetic Improvement. David R. White University of Glasgow UCL Crest Open Workshop, Jan 2016
An Unsystematic Review of Genetic Improvement David R. White University of Glasgow UCL Crest Open Workshop, Jan 2016 A Systematic Study of GI is currently under preparation. Justyna Petke Mark Harman Bill
EasyChair Preprint. A Study on the Use of IDE Features for Debugging
EasyChair Preprint 111 A Study on the Use of IDE Features for Debugging Afsoon Afzal and Claire Le Goues EasyChair preprints are intended for rapid dissemination of research results and are integrated
Precise Condition Synthesis for Program Repair
Precise Condition Synthesis for Program Repair Yingfei Xiong 1, Jie Wang 1, Runfa Yan 2, Jiachen Zhang 1, Shi Han 3, Gang Huang 1, Lu Zhang 1 1 Peking University 2 University of Electronic Science and
Fixing software bugs in 10 minutes or less using evolutionary computation
Fixing software bugs in 10 minutes or less using evolutionary computation University of New Mexico Stephanie Forrest ThanhVu Nguyen University of Virginia Claire Le Goues Westley Weimer Summary of method
Leveraging Program Equivalence for Adaptive Program Repair: Models and First Results. Westley Weimer, UVA Zachary P. Fry, UVA Stephanie Forrest, UNM
Leveraging Program Equivalence for Adaptive Program Repair: Models and First Results Westley Weimer, UVA Zachary P. Fry, UVA Stephanie Forrest, UNM Automated Program Repair Given a program, a notion of
LEVERAGING LIGHTWEIGHT ANALYSES TO AID SOFTWARE MAINTENANCE ZACHARY P. FRY PHD PROPOSAL
LEVERAGING LIGHTWEIGHT ANALYSES TO AID SOFTWARE MAINTENANCE ZACHARY P. FRY PHD PROPOSAL MAINTENANCE COSTS For persistent systems, software maintenance can account for up to 90% of the software lifecycle
The$credit$for$crea-ng$these$slides$belongs$to$ Fall$2014$CS$521/621$students.$$Student$names$ have$been$removed$per$ferpa$regula-ons.
The$credit$for$crea-ng$these$slides$belongs$to$ Fall$2014$CS$521/621$students.$$Student$names$ have$been$removed$per$ferpa$regula-ons.$ SemFix: Program Repair via Semantic Analysis Hoang Duong Thien Nguyen
SemFix: Program Repair via Semantic Analysis. Ye Wang, PhD student Department of Computer Science Virginia Tech
SemFix: Program Repair via Semantic Analysis Ye Wang, PhD student Department of Computer Science Virginia Tech Problem Statement Debugging takes much time and effort Even after root cause of a bug is identified,
AUTOMATIC PROGRAM REPAIR USING GENETIC PROGRAMMING
AUTOMATIC PROGRAM REPAIR USING GENETIC PROGRAMMING CLAIRE LE GOUES APRIL 22, 2013 http://www.clairelegoues.com 1 GENPROG STOCHASTIC SEARCH + TEST CASE GUIDANCE = AUTOMATIC, EXPRESSIVE, SCALABLE PATCH GENERATION
Automated Program Repair
#1 Automated Program Repair Motivation Software maintenance is expensive Up to 90% of the cost of software [Seacord] Up to $70 Billion per year in US [Jorgensen, Sutherland] Bug repair is the majority
Alleviating Patch Overfitting with Automatic Test Generation: A Study of Feasibility and Effectiveness for the Nopol Repair System
Alleviating Patch Overfitting with Automatic Test Generation: A Study of Feasibility and Effectiveness for the Nopol Repair System Zhongxing Yu Matias Martinez Benjamin Danglot Thomas Durieux Martin Monperrus
Claire Le Goues. Institute for Software Research +1 (412)
Claire Le Goues Institute for Software Research +1 (412) 268-6954 School of Computer Science clegoues@cs.cmu.edu Carnegie Mellon University http://www.cs.cmu.edu/ clegoues Research Interests and Approach
Leveraging Syntax-Related Code for Automated Program Repair
Leveraging Syntax-Related Code for Automated Program Repair Qi Xin, Steven P. Reiss Department of Computer Science Brown University Providence, RI, USA {qx5,spr}@cs.brown.edu Abstract We present our automated
Databases -Normalization I. (GF Royle, N Spadaccini ) Databases - Normalization I 1 / 24
Databases -Normalization I (GF Royle, N Spadaccini 2006-2010) Databases - Normalization I 1 / 24 This lecture This lecture introduces normal forms, decomposition and normalization. We will explore problems
Automatically Finding Patches Using Genetic Programming. Westley Weimer, Claire Le Goues, ThanVu Nguyen, Stephanie Forrest
Automatically Finding Patches Using Genetic Programming Westley Weimer, Claire Le Goues, ThanVu Nguyen, Stephanie Forrest Motivation Software Quality remains a key problem Over one half of 1 percent of
Program Repair Using Code Repositories
Program Repair Using Code Repositories Qi Xin Brown University qx5@cs.brown.edu Steven P. Reiss Brown University spr@cs.brown.edu Shriram Krishnamurthi Brown University sk@cs.brown.edu Abstract We present
arxiv: v2 [cs.se] 9 Jul 2018
![arxiv: v2 [cs.se] 9 Jul 2018](/thumbs/90/101199475.jpg "arxiv: v2 [cs.se] 9 Jul 2018")
Ultra-Large Repair Search Space with Automatically Mined Templates: the Cardumen Mode of Astor Matias Martinez 1 and Martin Monperrus 2 arxiv:1712.03854v2 [cs.se] 9 Jul 2018 1 University of Valenciennes,
ASTOR: A Program Repair Library for Java
ASTOR: A Program Repair Library for Java Matias Martinez University of Lugano, Switzerland Martin Monperrus University of Lille & Inria, France ABSTRACT During the last years, the software engineering
arxiv: v1 [cs.se] 25 Mar 2014
![arxiv: v1 [cs.se] 25 Mar 2014](/thumbs/74/70440123.jpg "arxiv: v1 [cs.se] 25 Mar 2014")
Do the Fix Ingredients Already Exist? An Empirical Inquiry into the Redundancy Assumptions of Program Repair Approaches Matias Martinez Westley Weimer Martin Monperrus University of Lille & INRIA, France
This lecture. Databases -Normalization I. Repeating Data. Redundancy. This lecture introduces normal forms, decomposition and normalization.
This lecture Databases -Normalization I This lecture introduces normal forms, decomposition and normalization (GF Royle 2006-8, N Spadaccini 2008) Databases - Normalization I 1 / 23 (GF Royle 2006-8, N
Trusted Software Repair for System Resiliency. Westley Weimer, Stephanie Forrest, Miryung Kim, Claire Le Goues, Patrick Hurley
Trusted Software Repair for System Resiliency, Stephanie Forrest, Miryung Kim, Claire Le Goues, Patrick Hurley For The Next 17 Minutes Program Repair: Resilient but Untrusted Can we assess post-repair
Substitution Based Rules for Efficient Code Duplication on Object Oriented Systems
I J C T A, 9(7), 2016, pp. 3109-3115 International Science Press ISSN: 0974-5572 Substitution Based Rules for Efficient Code Duplication on Object Oriented Systems Anoop Sreekumar R.S.* and R.V. Sivabalan**
Testing Process and Methods. CS 490MT/5555, Spring 2017, Yongjie Zheng
Testing Process and Methods CS 490MT/5555, Spring 2017, Yongjie Zheng Context of Software Testing Verification & Validation Verification: checking that the software conforms to its specification. Validation:
arxiv: v1 [cs.se] 1 Mar 2017
![arxiv: v1 [cs.se] 1 Mar 2017](/thumbs/75/71742971.jpg "arxiv: v1 [cs.se] 1 Mar 2017")
Test Case Generation for Program Repair: A Study of Feasibility and Effectiveness Zhongxing Yu, Matias Martinez, Benjamin Danglot, Thomas Durieux and Martin Monperrus arxiv:1703.00198v1 [cs.se] 1 Mar 2017
Raymond P.L. Buse and Westley R. Weimer. Presenter: Rag Mayur Chevuri
Raymond P.L. Buse and Westley R. Weimer {buse,weimer}@cs.virginia.edu Presenter: Rag Mayur Chevuri Maintenance consumes 70% of total life cycle cost Reading code Most time-consuming component of maintenance
Automatically Finding Patches Using Genetic Programming
Automatically Finding Patches Using Genetic Programming Westley Weimer, Stephanie Forrest, Claire Le Goues, ThanVu Nguyen, Ethan Fast, Briana Satchell, Eric Schulte Motivation Software Quality remains
CIS-331 Exam 2 Fall 2015 Total of 105 Points Version 1
Version 1 1. (20 Points) Given the class A network address 117.0.0.0 will be divided into multiple subnets. a. (5 Points) How many bits will be necessary to address 4,000 subnets? b. (5 Points) What is
Learning to Synthesize. Yingfei Xiong, Bo Wang, Guirong Fu, Linfei Zang Peking University June 2, 2018
Learning to Synthesize Yingfei Xiong, Bo Wang, Guirong Fu, Linfei Zang Peking University June 2, 2018 Outline GI and L2S Components of L2S Application Conclusion Genetic Improvement GI can systematically
Repair & Refactoring
S C I E N C E P A S S I O N T E C H N O L O G Y Repair & Refactoring Birgit Hofer Institute for Software Technology 1 u www.tugraz.at Outline Model-based Software Debugging o Traffic Light Example Repair
CIS-331 Fall 2014 Exam 1 Name: Total of 109 Points Version 1
Version 1 1. (24 Points) Show the routing tables for routers A, B, C, and D. Make sure you account for traffic to the Internet. Router A Router B Router C Router D Network Next Hop Next Hop Next Hop Next
Helping Programmers Debug Code Using Semantic Change Impact Analysis PROLANGS
Helping Programmers Debug Code Using Semantic Change Impact Analysis Dr. Barbara G. Ryder Rutgers University http://www.cs.rutgers.edu/~ryder This research is supported by NSF grants CCR-0204410 & CCR-0331797
Geometric Modeling. Mesh Decimation. Mesh Decimation. Applications. Copyright 2010 Gotsman, Pauly Page 1. Oversampled 3D scan data
Applications Oversampled 3D scan data ~150k triangles ~80k triangles 2 Copyright 2010 Gotsman, Pauly Page 1 Applications Overtessellation: E.g. iso-surface extraction 3 Applications Multi-resolution hierarchies
CS348B Lecture 2 Pat Hanrahan, Spring Greeks: Do light rays proceed from the eye to the light, or from the light to the eye?
Page 1 Ray Tracing Today Basic algorithms Overview of pbrt Ray-surface intersection for single surface Next lecture Acceleration techniques for ray tracing large numbers of geometric primitives Classic
A METRIC BASED EVALUATION OF TEST CASE PRIORITATION TECHNIQUES- HILL CLIMBING, REACTIVE GRASP AND TABUSEARCH
A METRIC BASED EVALUATION OF TEST CASE PRIORITATION TECHNIQUES- HILL CLIMBING, REACTIVE GRASP AND TABUSEARCH 1 M.Manjunath, 2 N.Backiavathi 1 PG Scholar, Department of Information Technology,Jayam College
Attention, Test Code is Low-quality!
Attention, Test Code is Low-quality! Xinye Tang State Key Laboratory of Computer Science Institute of Software, Chinese Academy of Sciences tangxinye@nfs.iscas.ac.cn ABSTRACT In this paper, we describe
Topic 3: Angle measurement traversing
Topic 3: Angle measurement traversing Aims -Learn what control surveys are and why these are an essential part of surveying -Understand rectangular and polar co-ordinates and how to transform between the
Identifying Patch Correctness in Test-based Program Repair. Yingfei Xiong, Xinyuan Liu, Muhan Zeng, Lu Zhang, Gang Huang Peking University
Identifying Patch Correctness in Test-based Program Repair Yingfei Xiong, Xinyuan Liu, Muhan Zeng, Lu Zhang, Gang Huang Peking University Test-based Program Repair Passing test Passing test Passing test
Model Counting with Applications to CodeHunt
Model Counting with Applications to CodeHunt Willem Visser Stellenbosch University South Africa CodeHunt is built on Model Counting SAT or UNSAT? And Some solutions # SAT solutions? Can we use this for
CIS-331 Fall 2013 Exam 1 Name: Total of 120 Points Version 1
Version 1 1. (24 Points) Show the routing tables for routers A, B, C, and D. Make sure you account for traffic to the Internet. NOTE: Router E should only be used for Internet traffic. Router A Router
AN EFFICIENT SOFTWARE DEFECT PREDICTION MODEL USING OPTIMIZED TABU SEARCH BRANCH AND BOUND PROCEDURE
AN EFFICIENT SOFTWARE DEFECT PREDICTION MODEL USING OPTIMIZED TABU SEARCH BRANCH AND BOUND PROCEDURE Pandiyan G. 1 and P. Krishnakumari 2 1 RVS College of Arts and Science, Coimbatore, India 2 Department
Testing & Symbolic Execution
Testing & Symbolic Execution Software Testing The most common way of measuring & ensuring correctness Input 2 Software Testing The most common way of measuring & ensuring correctness Input Observed Behavior
Automa'c, Efficient, and General Repair of So8ware Defects using Lightweight Program Analyses
Automa'c, Efficient, and General Repair of So8ware Defects using Lightweight Program Analyses Disserta'on Proposal Claire Le Goues September 22, 2010 So8ware Errors Are Expensive Everyday, almost 300 bugs
Precise Condition Synthesis for Program Repair
Precise Condition Synthesis for Program Repair Yingfei Xiong, Jie Wang, Runfa Yan, Jiachen Zhang, Shi Han, Gang Huang ( ), Lu Zhang Key Laboratory of High Confidence Software Technologies (Peking University),
A Comprehensive Study of Automatic Program Repair on the QuixBugs Benchmark
A Comprehensive Study of Automatic Program Repair on the QuixBugs Benchmark He Ye KTH Royal Institute of Technology heye@kth.se Matias Martinez University of Valenciennes matias.martinez@univ-valenciennes.fr
Graph Query Verification using Monadic 2 nd -Order Logic
1 Graph Query Verification using Monadic 2 nd -Order Logic Graph Kazuhiro Inaba ( 稲葉一浩 ) kinaba@nii.ac.jp Oct 10, 2010 1 st PKU-NII International Joint Workshop on Advanced Software Engineering 2 Goal
Bug Signature Minimization and Fusion
2011 IEEE 1th International Symposium on High-Assurance Systems Engineering Bug Signature Minimization and Fusion David Lo 1, Hong Cheng 2, and Xiaoyin Wang 1 School of Information Systems, Singapore Management
Semantic Program Repair Using a Reference Implementation
Sergey Mechtaev National University of Singapore mechtaev@comp.nus.edu.sg Manh-Dung Nguyen National University of Singapore nguyenmanhdung1710@gmail.com Yannic Noller Humboldt University of Berlin yannic.noller@informatik.hu-berlin.de
Identifying Patch Correctness in Test-Based Program Repair
Key Laboratory of High Confidence Software Technologies (Peking University), MoE Institute of Software, EECS, Peking University, Beijing, 100871, China {xiongyf,liuxinyuan,mhzeng,zhanglucs,hg}@pku.edu.cn
Mining Social Network Graphs
Mining Social Network Graphs Analysis of Large Graphs: Community Detection Rafael Ferreira da Silva rafsilva@isi.edu http://rafaelsilva.com Note to other teachers and users of these slides: We would be
Testing, Fuzzing, & Symbolic Execution
Testing, Fuzzing, & Symbolic Execution Software Testing The most common way of measuring & ensuring correctness Input 2 Software Testing The most common way of measuring & ensuring correctness Input Observed
For all questions, E. NOTA means none of the above answers is correct. Diagrams are NOT drawn to scale.
For all questions, means none of the above answers is correct. Diagrams are NOT drawn to scale.. In the diagram, given m = 57, m = (x+ ), m = (4x 5). Find the degree measure of the smallest angle. 5. The
Java Programming for Selenium
Video 5 - Java Control Flow, String Handling and Arrays Java Programming for Selenium 1) Conditional / Decision Making 2) Loop 3) Branching 4) String Handling in Java 5) Java Arrays 1) Conditional / Decision
A Generic Algorithm for Program Repair
A Generic Algorithm for Program Repair Besma Khaireddine University of Tunis Manar, Tunisia khaireddine.besma@gmail.com Aleksandr Zakharchenko NJIT, Newark NJ az68@njit.edu Ali Mili NJIT, Newark NJ mili@njit.edu
Representations and Operators for Improving Evolutionary Software Repair
Representations and Operators for Improving Evolutionary Software Repair Claire Le Goues University of Virginia Charlottesville, VA 22903 legoues@cs.virginia.edu Westley Weimer University of Virginia Charlottesville,
CIS-331 Final Exam Spring 2015 Total of 115 Points. Version 1
Version 1 1. (25 Points) Given that a frame is formatted as follows: And given that a datagram is formatted as follows: And given that a TCP segment is formatted as follows: Assuming no options are present
Automatically Repairing Concurrency Bugs with ARC MUSEPAT 2013 Saint Petersburg, Russia
Automatically Repairing Concurrency Bugs with ARC MUSEPAT 2013 Saint Petersburg, Russia David Kelk, Kevin Jalbert, Jeremy S. Bradbury Faculty of Science (Computer Science) University of Ontario Institute
COMPARISON AND EVALUATION ON METRICS
COMPARISON AND EVALUATION ON METRICS BASED APPROACH FOR DETECTING CODE CLONE D. Gayathri Devi 1 1 Department of Computer Science, Karpagam University, Coimbatore, Tamilnadu dgayadevi@gmail.com Abstract
Factoring. Factor: Change an addition expression into a multiplication expression.
Factoring Factor: Change an addition expression into a multiplication expression. 1. Always look for a common factor a. immediately take it out to the front of the expression, take out all common factors
ENGINEERS ACADEMY. 7. Given Boolean theorem. (a) A B A C B C A B A C. (b) AB AC BC AB BC. (c) AB AC BC A B A C B C.
Digital Electronics Boolean Function QUESTION BANK. The Boolean equation Y = C + C + C can be simplified to (a) (c) A (B + C) (b) AC (d) C. The Boolean equation Y = (A + B) (A + B) can be simplified to
Connecting Program Synthesis and Reachability: Automatic Program Repair using Test-Input Generation
University of Nebraska - Lincoln DigitalCommons@University of Nebraska - Lincoln CSE Technical reports Computer Science and Engineering, Department of 10-19-2016 Connecting Program Synthesis and Reachability:
CIS-331 Final Exam Spring 2016 Total of 120 Points. Version 1
Version 1 1. (25 Points) Given that a frame is formatted as follows: And given that a datagram is formatted as follows: And given that a TCP segment is formatted as follows: Assuming no options are present
n HW7 due in about ten days n HW8 will be optional n No CLASS or office hours on Tuesday n I will catch up on grading next week!
Announcements SMT Solvers, Symbolic Execution n HW7 due in about ten days n HW8 will be optional n No CLASS or office hours on Tuesday n I will catch up on grading next week! n Presentations n Some of
Integrated Impact Analysis for Managing Software Changes. Malcom Gethers, Bogdan Dit, Huzefa Kagdi, Denys Poshyvanyk
Integrated Impact Analysis for Managing Software Changes Malcom Gethers, Bogdan Dit, Huzefa Kagdi, Denys Poshyvanyk Change Impact Analysis Software change impact analysis aims at estimating the potentially
Finding a Best Fit Plane to Non-coplanar Point-cloud Data Using Non Linear and Linear Equations
AIJSTPME (013) 6(): 17-3 Finding a Best Fit Plane to Non-coplanar Point-cloud Data Using Non Linear and Linear Equations Mulay A. Production Engineering Department, College of Engineering, Pune, India
Request for Comments: 2. 1a1 Logical link 0 will be a control link between any two HOSTs on the network
Network Working Group Request for Comments: 2 Bill Duvall SRI [unknown title] [page 1 missing] 1 LINKS 1a Control Links 1a1 Logical link 0 will be a control link between any two HOSTs on the network 1a1a
Note: Definitions are always reversible (converse is true) but postulates and theorems are not necessarily reversible.
Honors Math 2 Deductive ing and Two-Column Proofs Name: Date: Deductive reasoning is a system of thought in which conclusions are justified by means of previously assumed or proven statements. Every deductive
Menu. Algebraic Simplification - Boolean Algebra EEL3701 EEL3701. MSOP, MPOS, Simplification
Menu Minterms & Maxterms SOP & POS MSOP & MPOS Simplification using the theorems/laws/axioms Look into my... 1 Definitions (Review) Algebraic Simplification - Boolean Algebra Minterms (written as m i ):
Ctcompare: Comparing Multiple Code Trees for Similarity
Ctcompare: Comparing Multiple Code Trees for Similarity Warren Toomey School of IT, Bond University Using lexical analysis with techniques borrowed from DNA sequencing, multiple code trees can be quickly
An Analysis of Patch Plausibility and Correctness for Generate-And-Validate Patch Generation Systems
An Analysis of Patch Plausibility and Correctness for Generate-And-Validate Patch Generation Systems Zichao Qi, Fan Long, Sara Achour, and Martin Rinard MIT EECS & CSAIL {zichaoqi, fanl, sarachour, rinard}@csail.mit.edu
csci 210: Data Structures Stacks and Queues in Solution Searching
csci 210: Data Structures Stacks and Queues in Solution Searching 1 Summary Topics Using Stacks and Queues in searching Applications: In-class problem: missionary and cannibals In-class problem: finding
Active Code Completion
[ICSE12] Active Code Completion Cyrus Omar Computer Science YoungSeok Yoon Software Engineering Thomas D. LaToza Software Engineering Brad A. Myers Human-Computer Interaction School of Computer Science
Spectrum Mutant. Evaluating and Improving Fault Localization
Evaluating and Improving Fault Localization Spencer Pearson Michael Ernst Debugging is expensive Your program has a bug. What do you do? Reproduce it Locate it Focus of this talk Fix it Fault localization
D-Optimal Designs. Chapter 888. Introduction. D-Optimal Design Overview
Chapter 888 Introduction This procedure generates D-optimal designs for multi-factor experiments with both quantitative and qualitative factors. The factors can have a mixed number of levels. For example,
This is a repository copy of XFix: An Automated Tool for the Repair of Layout Cross Browser Issues.
This is a repository copy of XFix: An Automated Tool for the Repair of Layout Cross Browser Issues. White Rose Research Online URL for this paper: http://eprints.whiterose.ac.uk/116992/ Version: Accepted
CIS-331 Exam 2 Fall 2014 Total of 105 Points. Version 1
Version 1 1. (20 Points) Given the class A network address 119.0.0.0 will be divided into a maximum of 15,900 subnets. a. (5 Points) How many bits will be necessary to address the 15,900 subnets? b. (5
Medium Term Plan Year 6: Autumn Term
Medium Term Plan Year 6: Autumn Term Block A1.a: Multiply integers and decimals by 10, 100 or 1000 AUTUMN TERM Block A1.b: Divide integers by 10, 100 or 1000, and divide decimals by 10 or 100 Block A1.c:
AVA: Supporting Debugging With Failure Interpretations
AVA: Supporting Debugging With Failure Interpretations Fabrizio Pastore and Leonardo Mariani University of Milano Bicocca Milan, Italy {pastore,mariani}@disco.unimib.it Abstract Several debugging techniques
EXERCISES (Software Engineering)
Chapter 1 1. What is Software Engineering? 2. What is Requirement Engineering? EXERCISES (Software Engineering) 3. What are the Different types of Architectures in Software Engineering? 4. How many subdisciplines
BOOLEAN ALGEBRA. 1. State & Verify Laws by using :
BOOLEAN ALGEBRA. State & Verify Laws by using :. State and algebraically verify Absorption Laws. (2) Absorption law states that (i) X + XY = X and (ii) X(X + Y) = X (i) X + XY = X LHS = X + XY = X( + Y)
An Empirical Study on Real Bug Fixes
An Empirical Study on Real Bug Fixes Hao Zhong Zhendong Su Department of Computer Science and Engineering, Shanghai Jiao Tong University, China University of California, Davis, USA zhonghao@sjtu.edu.cn,
Exploiting Symmetry in Relational Similarity for Ranking Relational Search Results
Exploiting Symmetry in Relational Similarity for Ranking Relational Search Results Tomokazu Goto, Nguyen Tuan Duc, Danushka Bollegala, and Mitsuru Ishizuka The University of Tokyo, Japan {goto,duc}@mi.ci.i.u-tokyo.ac.jp,
CSCI 220: Computer Architecture I Instructor: Pranava K. Jha. Simplification of Boolean Functions using a Karnaugh Map
CSCI 22: Computer Architecture I Instructor: Pranava K. Jha Simplification of Boolean Functions using a Karnaugh Map Q.. Plot the following Boolean function on a Karnaugh map: f(a, b, c, d) = m(, 2, 4,
Solutions to Final Examination
Prof. Li-Yan Yuan CMPUT 391: Database Management Systems Solutions to Final Examination December 15, 2005 It is a close-book examination and the time for the test is 120 minutes. There are twelve (12)
Scalable Statistical Bug Isolation
Post-Deployment Monitoring Scalable Statistical Bug Isolation Ben Liblit, Mayur Naik, Alice Zheng, Alex Aiken, and Michael Jordan University of Wisconsin, Stanford University, and UC Berkeley Goal: Measure
Software Engineering Chair November 26, 2008
Automated Debugging Software Engineering Chair November 26, 2008 Project 2: Comparing Coverage In this project, you write tools that collect and compare the coverage of multiple program runs in order to
CS154. Streaming Algorithms and Communication Complexity
CS154 Streaming Algorithms and Communication Complexity 1 Streaming Algorithms 2 Streaming Algorithms 01 42 3 L = {x x has more 1 s than 0 s} Initialize: C := 0 and B := 0 When the next symbol x is read,
A Characterization Study of Repeated Bug Fixes
A Characterization Study of Repeated Bug Fixes Ruru Yue 1,2 Na Meng 3 Qianxiang Wang 1,2 1 Key Laboratory of High Confidence Software Technologies (Peking University), MoE 2 Institute of Software, EECS,