Search Based Automated Program Repair for Multiple Faults

目录

声明

ABSTRACT

摘要

Table Of Contents

CHAPTER 1 INTRODUCTION

1．1 Significance of Research

1．2 Research Progress

1．2．1 Research Progress on Fault Localization

1．2．2 Research Progress on Automatic Program Repair

1．3 Research Contents

1．4 Organization of Thesis

CHAPTER 2 BACKGROUND AND RELATED WORK

2．1 Multiple Fault Localization

2．2 Mutation Technique

2．2．1 Use of Mutation in Automatic Program Repair

2．2．2 Combination of Mutation and Fault Localization

2．3 Search Based Software Engineering

2．3．1 Genetic Algorithm

2．3．2 Genetic Programming

2．4 Chapter Summary

CHAPTER 3 MULTIPLE FAULT LOCALIZATION USING DSTAR AND K—MEDOIDS CLUSTERING

3．1 Method Framework

3．2 Representation of failed test cases

3．3 Revised Kendall Tau Distance

3．4 Clustering

3．4．1 Estimating the number of clusters and assigning them initial medoids

3．4．2 K-medoids Clustering

3．5 Multiple Fault localization using K-medoids and Dstar Fault localization formula

3．6 Chapter Summary

CHAPTER 4 SEARCH BASED AUTOMATED REPAIR FOR MULTIPLE FAULTS USING MUTATION

4．1 Method Framework

4．2 Fine Grained Binary Representation

4．3 Non Random Initial Population

4．4 Fitness function based on test execution results

4．5 Hybrid Crossover Strategy

4．6Automatic Multi Fault Repair Method

4．7 Chapter Summary

CHAPTER 5 EMPERICAL STUDY

5．1 Research Questions

5．2 Subject Programs

5．3 Experimental Design and Evaluation

5．4 Experimental Results and Analysis

5．4．1 Effect of Using Dstar with K-medoids for multiple Localization in terms of Statements Examined

5．4．2 Effect of Using Dstar with K-medoids for multiple Localization in terms of number of clusters estimated

5．4．3 Repair Ability of Search Based Automated Program Repair for Multiple Faults

5．4．4 Repair Efficiency of ourApproach for Automatic Multiple Fault Repair

5．5 Chapter Summary

CHAPTER6 CONCLUSION AND FUTURE WORK

6．1 Conclusion

6．2 Future work

REFERENCES

ACKNOWLEDGMENT

INTRODUCTION TO AUTHOR AND SUPERVISOR