Comparison of Model-Based Error Localization algorithms for C designs

The paper addresses Model-Based Design Error Localization in C designs. We consider a localization algorithm that is implemented with Dynamic Slicing and simulation using C code animation. The localization algorithm has been integrated into the FoREnSiC automated debugging system. Different ranking algorithms are compared and their ranking accuracy for Error Localization is measured by experimental results on the Siemens benchmark set. A new contribution of the paper is the observation that a simple error ranking metric that takes into account only information from failed sequences has the least average deviation from exact localization.

[1]  David W. Binkley,et al.  Program slicing , 2008, 2008 Frontiers of Software Maintenance.

[2]  James R. Larus,et al.  The use of program profiling for software maintenance with applications to the year 2000 problem , 1997, ESEC '97/FSE-5.

[3]  W. Eric Wong,et al.  Using Mutation to Automatically Suggest Fixes for Faulty Programs , 2010, 2010 Third International Conference on Software Testing, Verification and Validation.

[4]  William K. Lam Hardware Design Verification: Simulation and Formal Method-Based Approaches (Prentice Hall Modern Semiconductor Design Series) , 2005 .

[5]  Eric A. Brewer,et al.  Pinpoint: problem determination in large, dynamic Internet services , 2002, Proceedings International Conference on Dependable Systems and Networks.

[6]  Anil K. Jain,et al.  Algorithms for Clustering Data , 1988 .

[7]  Alexander S. Kamkin Simulation-based hardware verification with time-abstract models , 2011, 2011 9th East-West Design & Test Symposium (EWDTS).

[8]  Peter Zoeteweij,et al.  An Evaluation of Similarity Coefficients for Software Fault Localization , 2006, 2006 12th Pacific Rim International Symposium on Dependable Computing (PRDC'06).

[9]  Andreas Zeller,et al.  Lightweight Defect Localization for Java , 2005, ECOOP.