• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

DMCA

Heuristics for automatic localization of software faults (1992)

Cached

  • Download as a PDF

Download Links

  • [www2.umassd.edu:16080]
  • [www2.umassd.edu]
  • [www.cs.purdue.edu]
  • [hesperus.oboe.com]
  • [www.serc.net]
  • [spaf.cerias.purdue.edu]
  • [www.cerias.purdue.edu]
  • [homes.cerias.purdue.edu]
  • [www.cerias.purdue.edu]
  • [spaf.cerias.purdue.edu]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Hsin Pan , Eugene H. Spafford
Citations:19 - 0 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@TECHREPORT{Pan92heuristicsfor,
    author = {Hsin Pan and Eugene H. Spafford},
    title = {Heuristics for automatic localization of software faults},
    institution = {},
    year = {1992}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

Developing effective debugging strategies to guarantee the reliability of software is important. By analyzing the debugging process used by experienced programmers, four distinct tasks are found to be consistently performed: (1) determining statements involved in program failures, (2) selecting suspicious statements that might contain faults, (3) making hypotheses about suspicious faults (variables and locations), and (4) restoring program state to a specific statement for verification. If all four tasks could be performed with direct assistance from a debugging tool, the debugging effort would become much easier. We have built a prototype debugging tool, Spyder, to assist users in conducting the first and last tasks. Spyder executes the first task by using dynamic program slicing and the fourth task by backward execution. This research focuses on the second task, reducing the search domain containing faults, referred to as fault localization. Several heuristics are presented here based on dynamic program slices and information obtained from testing. A family tree of the heuristics is constructed to study effective application of the heuristics. The relationships among the heuristics and the potential order of using them are also explored. A preliminary

Keyphrases

software fault    automatic localization    family tree    fault localization    experienced programmer    program failure    fourth task    search domain    second task    making hypothesis    specific statement    distinct task    debugging effort    suspicious fault    effective debugging strategy    program state    several heuristic    dynamic program slice    debugging process    first task    potential order    backward execution    last task    dynamic program slicing    direct assistance    effective application    suspicious statement   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University