Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Coverage-Checked Random Testing of Data Structures
 

Summary: Coverage-Checked Random Testing
of Data Structures:
The Sourceforge Case Study
James H. Andrews
Report No. DCS-285-IR, April 2004
Department of Computer Science
University of Victoria
Victoria, BC, Canada
V8W 3P6

Abstract: We study coverage-checked random unit testing (CRUT), the
practice of repeatedly testing units on sequences of random function calls until
given code coverage goals are achieved. Previous research has shown that this
practice can be a useful complement to traditional testing methods. However,
questions remain as to the breadth of applicability of the practice.
In this report, we present the results of a case study into using CRUT for
testing data structures. We applied CRUT to the testing of two data structures
packages taken from the Sourceforge open-source code repository. Despite the
maturity of the packages and the fact that they had been extensively tested, we
identi ed faults in the units.

  

Source: Andrews, Jamie - Department of Computer Science, University of Western Ontario

 

Collections: Computer Technologies and Information Sciences