Year: 2006
Type: conference-paper
Abstract: We study the test sequence selection problem. Given a large number of tests for a protocol system, we want to select a subset of tests so that the number of tests is reduced yet the test coverage is not sacrificed. We discuss the complexity of the test selection problem and propose a class of algorithms for different protocol system information requirements, test coverage criteria, and cost. We report experimental results on ISDN connection control protocol system Q.931.
Authors: David Lee, Ruibing Hao
Language: English
Subfield: Software
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze
Funder: Peking University
OpenAlex ID: W1532034799
