ACM Home Page
Please provide us with feedback. Feedback
Finding programming errors earlier by evaluating runtime monitors ahead-of-time
Full text PdfPdf (433 KB)
Source Foundations of Software Engineering archive
Proceedings of the 16th ACM SIGSOFT International Symposium on Foundations of software engineering table of contents
Atlanta, Georgia
SESSION: Program analysis table of contents
Pages 36-47  
Year of Publication: 2008
ISBN:978-1-59593-995-1
Authors
Eric Bodden  McGill University
Patrick Lam  University of Waterloo
Laurie Hendren  McGill University
Sponsor
SIGSOFT: ACM Special Interest Group on Software Engineering
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 18,   Downloads (12 Months): 158,   Citation Count: 2
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/1453101.1453109
What is a DOI?

ABSTRACT

Runtime monitoring allows programmers to validate, for instance, the proper use of application interfaces. Given a property specification, a runtime monitor tracks appropriate runtime events to detect violations and possibly execute recovery code. Although powerful, runtime monitoring inspects only one program run at a time and so may require many program runs to find errors. Therefore, in this paper, we present ahead-of-time techniques that can (1) prove the absence of property violations on all program runs, or (2) flag locations where violations are likely to occur. Our work focuses on tracematches, an expressive runtime monitoring notation for reasoning about groups of correlated objects. We describe a novel flow-sensitive static analysis for analyzing monitor states. Our abstraction captures both positive information (a set of objects could be in a particular monitor state) and negative information (the set is known not to be in a state). The analysis resolves heap references by combining the results of three points-to and alias analyses. We also propose a machine learning phase to filter out likely false positives. We applied a set of 13 tracematches to the DaCapo benchmark suite and SciMark2. Our static analysis rules out all potential points of failure in 50% of the cases, and 75% of false positives on average. Our machine learning algorithm correctly classifies the remaining potential points of failure in all but three of 461 cases. The approach revealed defects and suspicious code in three benchmark programs.


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
E. Bodden, F. Chen, and G. Roşu. Dependent advice: A general approach to optimizing history-based aspects (Extended version). Technical Report abc-2008-2, http://www.aspectbench.org/, March 2008.
 
7
E. Bodden, L. J. Hendren, and O. Lhoták. A staged static program analysis to improve the performance of runtime monitoring. In ECOOP, volume 4609 of LNCS, pages 525--549. Springer, 2007.
 
8
E. Bodden, P. Lam, and L. Hendren. Object representatives: a uniform abstraction for pointer information. In 1st International Academic Research Conference of the British Computer Society (BCS 2008), Sept. 2008. To appear.
 
9
R. DeLine and M. Fähndrich. Typestates for objects. In ECOOP, volume 3086 of LNCS, pages 465--490, 2004.
10
11
12
 
13
R. Kohavi. A study of cross-validation and bootstrap for accuracy estimation and model selection. In IJCAI, San Mateo, CA, pages 1137--1143, 1995.
14
 
15
H. Masuhara, G. Kiczales, and C. Dutchyn. A compilation and optimization model for aspect-oriented programs. In CC, volume 2622 of LNCS, pages 46--60, 2003.
16
 
17
R. Pozo and B. Miller. Scimark 2.0, June 2000. http://math.nist.gov/scimark.
18
 
19
20
 
21


Collaborative Colleagues:
Eric Bodden: colleagues
Patrick Lam: colleagues
Laurie Hendren: colleagues