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.
Saturation-based testing of concurrent programs
Full text PdfPdf (1.74 MB)
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: 53-62  
Year of Publication: 2009
ISBN:978-1-60558-001-2
Authors
Elena Sherman  University of Nebraska, Lincoln, NE, USA
Matthew B. Dwyer  University of Nebraska, Lincoln, NE, USA
Sebastian Elbaum  University of Nebraska, Lincoln, NE, USA
Sponsors
ACM: Association for Computing Machinery
SIGSOFT: ACM Special Interest Group on Software Engineering
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 43,   Downloads (12 Months): 124,   Citation Count: 0
Additional Information:

abstract   references   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.1595706
What is a DOI?

ABSTRACT

Coverage measures help to determine whether a test suite exercises a program adequately according to a testing criterion. Many existing measures, however, are defined over coverage domains that cannot be precisely calculated, rendering them of limited value in assessing the extent of testing activities. To exploit the use of such measures, we formalize saturation-based test adequacy, a form of adequacy focused on the rate at which coverage increases during test suite execution. We define a family of coverage metrics for concurrent program testing that are well-suited to saturation-based adequacy and present a study that explores their cost and effectiveness. The results of this study suggest that saturation-based testing can serve as an effective complement to traditional notions of coverage-based testing.


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
R-squared. http://en.wikipedia.org/wiki/R-squared.
2
3
4
 
5
 
6
M. B. Dwyer, J. Hatcliff, M. Hoosier, V. Ranganath, Robby, and T. Wallentine. Evaluating the effectiveness of program slicing for model reduction of concurrent object-oriented programs. In Proc. of the Twelfth Int'l. Conf. Tools and Alg. for the Const. and Anal. of Sys., 2006.
7
 
8
O. Edelstein, E. Farchi, Y. Nir, G. Ratsaby, and S. Ur. Multithreaded java program test generation. IBM Systems Journal, 41(1):111--125, 2002.
 
9
 
10
 
11
12
13
 
14
 
15
 
16
17
 
18
A. P. Mathur. Foundations of Software Testing. Pearson, 2008.
 
19
NASA Ames Research Center. Java PathFinder. http://javapathfinder.sourceforge.net.
20
 
21
22
 
23
 
24
Sable Research Group. Soot. http://www.sable.mcgill.ca/soot.
25
26
 
27
E. Sherman. State coverage for the dynamic analysis of concurrent programs. Master's thesis, University of Nebraska-Lincoln, 2008.
 
28
S. D. Stoller. Testing concurrent Java programs using randomized scheduling. In Proc. Second Workshop on Runtime Verification (RV), volume 70(4) of Electronic Notes in Theoretical Computer Science. Elsevier, July 2002.
 
29
30
 
31
T. Williams, M. Mercer, J. Mucha, and R. Kapur. Code coverage, what does it mean in terms of quality? In Proceedings of the Reliability and Maintainability Symposium, pages 420--424, 2001.
32
33
 
34

Collaborative Colleagues:
Elena Sherman: colleagues
Matthew B. Dwyer: colleagues
Sebastian Elbaum: colleagues