An evaluation of exhaustive testing for data structures

An evaluation of exhaustive testing for data structures (2003)

Cached

Download Links

by Darko Marinov , Alexandr Andoni , Dumitru Daniliuc , Sarfraz Khurshid , Martin Rinard

Venue:	MIT Computer Science and Artificial Intelligence Laboratory Report MIT -LCS-TR-921
Citations:	27 - 14 self

Versions

Version History

Metadata Version 1

Datum	Value	Source
TITLE	An evaluation of exhaustive testing for data structures	INFERENCE
AUTHOR NAME	Darko Marinov	SVM HeaderParse 0.2
AUTHOR AFFIL	MIT Computer Science and Artificial Intelligence Laboratory	SVM HeaderParse 0.2
AUTHOR ADDR	200 Technology Square; Cambridge, MA 02139	SVM HeaderParse 0.2
AUTHOR NAME	Alexandr Andoni	SVM HeaderParse 0.2
AUTHOR AFFIL	MIT Computer Science and Artificial Intelligence Laboratory	SVM HeaderParse 0.2
AUTHOR ADDR	200 Technology Square; Cambridge, MA 02139	SVM HeaderParse 0.2
AUTHOR NAME	Dumitru Daniliuc	SVM HeaderParse 0.2
AUTHOR AFFIL	MIT Computer Science and Artificial Intelligence Laboratory	SVM HeaderParse 0.2
AUTHOR ADDR	200 Technology Square; Cambridge, MA 02139	SVM HeaderParse 0.2
AUTHOR NAME	Sarfraz Khurshid	SVM HeaderParse 0.2
AUTHOR AFFIL	MIT Computer Science and Artificial Intelligence Laboratory	SVM HeaderParse 0.2
AUTHOR ADDR	200 Technology Square; Cambridge, MA 02139	SVM HeaderParse 0.2
AUTHOR NAME	Martin Rinard	SVM HeaderParse 0.2
AUTHOR AFFIL	MIT Computer Science and Artificial Intelligence Laboratory	SVM HeaderParse 0.2
AUTHOR ADDR	200 Technology Square; Cambridge, MA 02139	SVM HeaderParse 0.2
ABSTRACT	We present an evaluation of exhaustive testing of linked data structures with sophisticated structural constraints. Specifically, we use the Korat testing framework to systematically enumerate all legal inputs within a certain size. We then evaluate the quality of this test suite according to several measurements: ability to detect injected faults in the original correct implementations, code coverage, and specification coverage. Our results indicate that it is feasible to use exhaustive testing to obtain, within a reasonable amount of time, a high-quality test suite that can detect almost all faults and achieve complete code and specification coverage. Moreover, our results show that our exhaustive tests are of higher quality than randomly selected test suites that contain the same number of inputs selected from a larger potential input set. We conclude that exhaustive testing is a practical and effective testing methodology for sophisticated linked data structures. 1.	SVM HeaderParse 0.2
YEAR	2003	INFERENCE
VENUE	MIT Computer Science and Artificial Intelligence Laboratory Report MIT -LCS-TR-921	INFERENCE
VENUE TYPE	TECHREPORT	INFERENCE
TECH	Technical Report MIT-LCS-TR-921, MIT CSAIL	INFERENCE
CITATIONS	50 found	ParsCit 1.0