Patches as better bug reports

Proceedings of the 5th International Conference on Generative Programming and Component Engineering, GPCE'06

Volumn , Issue , 2006, Pages 181-190

  Weimer, Westley ^a  

^a UNIVERSITY OF VIRGINIA   (United States)

Author keywords

Bug; Bug report; Counterexample; Error; Explanation; Localization; Patch

Indexed keywords

BUG REPORT; COUNTEREXAMPLES; QUALITY OF SOFTWARE; SAFETY-POLICY VIOLATIONS;

AUTOMATIC PROGRAMMING; COMPUTER AIDED SOFTWARE ENGINEERING; ERROR DETECTION; MATHEMATICAL MODELS; PROGRAM DEBUGGING;

COMPUTER VIRUSES;

EID: 34547432561     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1173706.1173734     Document Type: Conference Paper

References (45)

1. M. Abramowitz and I. A. Stegun. Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables. Dover, New York, ninth Dover printing, tenth GPO printing edition, 1964.
2. A. V. Aho and T. G. Peterson. A minimum-distance error-correcting parser for context-free languages. SIAM Journal of Computation, 1(4):305-312, Dec. 1972.
3. R. Alur, P. Cerny, P. Madhusudan, and W. Nam. Synthesis of interface specifications for Java classes. In ACM Symposium on Principles of Programming Languages, 2005.
4. G. Ammons, R. Bodik, and J. R. Larus. Mining specifications. In Principles of Programming Languages (POPL), pages 4-16, 2002.
5. T. Ball and J. R. Laras. Efficient path profiling. In International Symposium on Microarchitecture, pages 46-57, 1996.
6. T. Ball, M. Naik, and S. K. Rajamani. From symptom to cause: localizing errors in counterexample traces. SIGPLAN Not., 38(1):97-105, 2003.
7. T. Ball and S. K. Rajamani. Automatically validating temporal safety properties of interfaces. In SPIN 2001, Workshop on Model Checking of Software, volume 2057 of Lecture Notes in Computer Science, pages 103-122, May 2001.
8. L. Carter, B. Simon, B. Calder, L. Carter, and J. Ferrante. Path analysis and renaming for predicated instruction scheduling. International Journal of Parallel Programming, 28(6):563-588, 2000.
9. S. Chaki, A. Groce, and O. Strichman. Explaining abstract counterexamples. In Foundations of Software Engineering (FSE), pages 73-82, New York, NY, USA, 2004. ACM Press.
10. H. Chen, D. Dean, and D. Wagner. Model checking one million lines of C code. In Network and Distributed System Security Symposium (NDSS), San Diego, CA, Feb. 2004.
11. E. M. Clarke, O. Grumberg, K. L. McMillan, and X. Zhao. Efficient generation of counterexamples and witnesses in symbolic model checking. In Conference on Design Automation (DAC), pages 427-432, New York, NY, USA, 1995. ACM Press.
12. J. C. Corbett, M. B. Dwyer, J. Hatcliff, and Robby. Bandera: a source-level interface for model checking java programs. In International Conference on Software Engineering (ICSE), pages 762-765, New York, NY, USA, 2000. ACM Press.
13. L. Cosmides, J. Tooby, A. Montaldi, and N. Thrall. Character counts: Cheater detection is relaxed for honest individuals. In 11th Annual Meeting of the Human Behavior and Evolution Society, Salt Lake City, Utah, June 1999.
14. R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. K. Zadeck. Efficiently computing static single assignment form and the control dependence graph. ACM Transactions on Programming Languages and Systems, 13(4):451-490, October 1991.
15. M. Das. Unification-based pointer analysis with directional assignments. In Programming Language Design and Implementation (PLDI), pages 35-46, New York, NY, USA, 2000. ACM Press.
16. M. Das, S. Lerner, and M. Seigle. ESP: path-sensitive program, verification in polynomial time. SIGPLAN Notices, 37(5):57-68, 2002.
17. P. Degano and C. Priami. Comparison of syntactic error handling in LR parsers. Software ?Practice and Experience, 25(6):657-679, 1995.
18. R. DeLine and M. Fähndrich. Enforcing high-level protocols in low-level software. In ACM Conference on Programming Language Design and Implementation, pages 59-69, 2001.
19. D. Detlefs, G. Nelson, and J. B. Saxe. Simplify: a theorem prover for program checking. J. ACM, 52(3):365-473, 2005.
20. D. Duggan and F. Bent. Explaining type inference. Sci. Comput. Program., 27(1):37-83, 1996.
21. P. Eggert, M. Haertel, D. Hayes, R. Stallman, and L. Tower. diff - compare files line by line. In http://www.gnu.org/software/diffutils/ diffutils.html, 2005.
22. D. Engler, B. Chelf, A. Chou, and S. Hallem. Checking system rules using system-specific, programmer-written compiler extensions. In Symposium on Operating Systems Design and Implementation, 2000.
23. C. Flanagan, K. R. M. Leino, M. Lillibridge, G. Nelson, J. B. Saxe, and R. Stata. Extended static checking for java. In Programming Language Design and Implementation (PLDI), pages 234-245, New York, NY, USA, 2002. ACM Press.
24. D. Freedman, R. Pisani, and R. Purves. Statistics. Third edition. W. W. Norton, 1998.
25. G. Gigerenzer and K. Hug. Domain-specific reasoning: social contracts, cheating and perspective change. In Cognition, volume 43, pages 127-171, 1992.
26. A. Groce. Error explanation with distance metrics. In Lecture Notes in Computer Science, volume 2988, pages 108-122, Jan. 2004.
27. A. Groce and D. Kroening. Making the most of bmc counterexamples. In Electronic Notes in Theoretical Computer Science, volume 119, pages 67-81, 2005.
28. A. Groce and W. Visser. What went wrong: Explaining counterexamples. In Lecture Notes in Computer Science, volume 2648, pages 121-135, Jan. 2003.
29. T. A. Henzinger, R. Jhala, R. Majumdar, and G. Sutre. Lazy abstraction. In Principles of Programming Languages (POPL), pages 58-70, 2002.
30. D. Hovemeyer and W. Pugh. Finding bugs is easy. In Companion to the 19th annual ACM SIGPLAN conference on Object-oriented programming systems, languages, and applications (OOPSLA), pages 132-136, New York, NY, USA, 2004. ACM Press.
31. R. Jhala and R. Majumdar. Path slicing. In Programming Language Design and Implementation (PLDI), pages 38-47, New York, NY, USA, 2005. ACM Press.
32. R. E. Korf. Depth-first iterative deepening: an optimal admissible tree search. Artificial Intelligence, 27(1):97-109, Sept. 1985.
33. T. Kremenek, K. Ashcraft, J. Yang, and D. Engler. Correlation exploitation in error ranking. In Foundations of Software Engineering (FSE), pages 83-93, New York, NY, USA, 2004. ACM Press.
34. T. Kremenek and D. Engler. Z-ranking: Using statistical analysis o counter the impact of static analysis approximations. In Static Analysis, 10th International Symposium (SAS), pages 295-315, Jan. 2003.
35. K. R. M. Leino, T. Millstein, and J. B. Saxe. Generating error traces from verification-condition counterexamples. In Science of Computer Programming, volume 55, pages 209-226, Mar. 2005.
36. U. Manber and S. Wu. Fast text search allowing errors. Communications of the ACM, 35(10):83-91, 1992.
37. R. Manevich, M. Sridharan, S. Adams, M. Das, and Z. Yang. Pse: Explaining program, failures via postmortem static analysis. In R. N. Taylor, editor, Foundations of Software Engineering (FSE). ACM, nov 2004.
38. V. P. Ranganath, T. Amtoft, A. Banerjee, M. B. Dwyer, and J. Hatcliff. A new foundation for control-dependence and slicing for modern program structures. In European Symposium on Programming (ESOP), pages 77-93, Jan. 2005.
39. T. Robschink and G. Snelting. Efficient path conditions in dependence graphs. In International Conference on Software Engineering (ICSE), pages 478-488, New York, NY, USA, 2002. ACM Press.
40. U. Shankar, K. Talwar, J. S. Foster, and D. Wagner. Detecting format string vulnerabilities with, type qualifiers. In USENIX Security Symposium, pages 201-220, 2001.
41. M. Sipser. Introduction to the Theory of Computation. Second edition. PWS, 1997.
42. F. Tip and T. B. Dinesh. A slicing-based approach for locating type errors. ACM Trans. Softw. Eng. Methodol, 10(1):5-55, 2001.
43. W. Weimer and G. Necula. Finding and preventing run-time error handling mistakes. In ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications, Vancouver, British Columbia, Canada, Oct. 2004.
44. J. Whaley, M. C. Martin, and M. S. Lam. Automatic extraction of object-oriented component interfaces. In International Symposium of Software Testing and Analysis, 2002.
45. J. Yang, D. Evans, D. Bhardwaj, T. Bhat, and M. Das. Perracotta: mining temporal API rules from imperfect traces. In ICSE '06: Proceeding of the 28th international conference on Software engineering, pages 282-291, New York, NY, USA, 2006. ACM Press.