ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
Capturing propagation of infected program states
Full text PdfPdf (751 KB)
Source
Foundations of Software Engineering archive
Proceedings of the the 7th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering table of contents
Amsterdam, The Netherlands
SESSION: Analysis and testing 1 table of contents
Pages: 43-52  
Year of Publication: 2009
ISBN:978-1-60558-001-2
Authors
Zhenyu Zhang  The University of Hong Kong, Hong Kong, Hong Kong
W. K. Chan  City University of Hong Kong, Hong Kong, Hong Kong
T. H. Tse  The University of Hong Kong, Hong Kong, Hong Kong
Bo Jiang  The University of Hong Kong, Hong Kong, Hong Kong
Xinming Wang  Hong Kong University of Science and Technology, Hong Kong, Hong Kong
Sponsors
ACM: Association for Computing Machinery
SIGSOFT: ACM Special Interest Group on Software Engineering
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 13,   Downloads (12 Months): 82,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1595696.1595705
What is a DOI?

ABSTRACT

Coverage-based fault-localization techniques find the fault-related positions in programs by comparing the execution statistics of passed executions and failed executions. They assess the fault suspiciousness of individual program entities and rank the statements in descending order of their suspiciousness scores to help identify faults in programs. However, many such techniques focus on assessing the suspiciousness of individual program entities but ignore the propagation of infected program states among them. In this paper, we use edge profiles to represent passed executions and failed executions, contrast them to model how each basic block contributes to failures by abstractly propagating infected program states to its adjacent basic blocks through control flow edges. We assess the suspiciousness of the infected program states propagated through each edge, associate basic blocks with edges via such propagation of infected program states, calculate suspiciousness scores for each basic block, and finally synthesize a ranked list of statements to facilitate the identification of program faults. We conduct a controlled experiment to compare the effectiveness of existing representative techniques with ours using standard bench-marks. The results are promising.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
2
3
 
4
5
6
 
7
 
8
9
 
10
 
11
 
12
13
14
15
16
17
18
 
19
 
20
M. Renieris and S. P. Reiss. Fault localization with nearest neighbor queries. In Proceedings of ASE 2003, pages 30--39. IEEE Computer Society Press, Los Alamitos, CA, 2003.
 
21
 
22
 
23
24
25
26
 
27
 
28
Z. Zhang, W. K. Chan, T. H. Tse, B. Jiang, and X. Wang. Capturing propagation of infected program states. Technical Report TR-2009-14. Department of Computer Science, The University of Hong Kong, Hong Kong, 2009.
 
29
 
30


Collaborative Colleagues:
Zhenyu Zhang: colleagues
W. K. Chan: colleagues
T. H. Tse: colleagues
Bo Jiang: colleagues
Xinming Wang: colleagues