ACM Home Page
Please provide us with feedback. Feedback
Statistical debugging using compound boolean predicates
Full text PdfPdf (223 KB)
Source
International Symposium on Software Testing and Analysis archive
Proceedings of the 2007 international symposium on Software testing and analysis table of contents
London, United Kingdom
SESSION: Debugging table of contents
Pages: 5 - 15  
Year of Publication: 2007
ISBN:978-1-59593-734-6
Authors
Piramanayagam Arumuga Nainar  University of Wisconsin-Madison
Ting Chen  University of Wisconsin-Madison
Jake Rosin  University of Wisconsin-Madison
Ben Liblit  University of Wisconsin-Madison
Sponsors
ACM: Association for Computing Machinery
SIGSOFT: ACM Special Interest Group on Software Engineering
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 60,   Citation Count: 5
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/1273463.1273467
What is a DOI?

ABSTRACT

Statistical debugging uses dynamic instrumentation and machine learning to identify predicates on program state that are strongly predictive of program failure. Prior approaches have only considered simple, atomic predicates such as the directions of branches or the return values of function calls. We enrich the predicate vocabulary by adding complex Boolean formulae derived from these simple predicates. We draw upon three-valued logic, static program structure, and statistical estimation techniques to efficiently sift through large numbers of candidate Boolean predicate formulae. We present qualitative and quantitative evidence that complex predicates are practical, precise, and informative. Furthermore, we demonstrate that our approach is robust in the face of incomplete data provided by the sparse random sampling that typifies postdeployment statistical debugging.


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
N. Dodoo, A. Donovan, L. Lin, and M. D. Ernst. Selecting predicates for implications in program analysis, March 16, 2002. Draft. http://pag.csail.mit.edu/~mernst/pubs/invariants-implications.ps.
3
 
4
5
 
6
 
7
8
9
10
 
11
A. Lal, J. Lim, M. Polishchuk, and B. Liblit. Path optimization in programs and its application to debugging. In P. Sestoft, editor, 15th European Symposium on Programming, pages 246--263, Vienna, Austria, Mar. 2006. Springer.
12
13
 
14
 
15
M. Litzkow, M. Livny, and M. Mutka. Condor - a hunter of idle workstations. In Proceedings of the 8th International Conference of Distributed Computing Systems, pages 104--111, June 1988.
16
 
17
G. Rothermel, S. Elbaum, A. Kinneer, and H. Do. Software-artifact intrastructure repository. http://sir.unl.edu/portal/, Sept. 2006.
 
18
E. W. Weisstein. Boolean function. MathWorld-A Wolfram Web Resource, Dec.20 2006. http://mathworld.wolfram.com/BooleanFunction.html.
19


Collaborative Colleagues:
Piramanayagam Arumuga Nainar: colleagues
Ting Chen: colleagues
Jake Rosin: colleagues
Ben Liblit: colleagues