ATTENTION: The software behind KU ScholarWorks is being upgraded to a new version. Starting July 15th, users will not be able to log in to the system, add items, nor make any changes until the new version is in place at the end of July. Searching for articles and opening files will continue to work while the system is being updated.
If you have any questions, please contact Marianne Reed at mreed@ku.edu .
Using Vapnik-Chervonenkis Dimension to Analyze the Testing Complexity of Program Segments
dc.contributor.author | Romanik, Kathleen | |
dc.contributor.author | Vitter, Jeffrey Scott | |
dc.date.accessioned | 2011-03-21T18:08:55Z | |
dc.date.available | 2011-03-21T18:08:55Z | |
dc.date.issued | 1996 | |
dc.identifier.citation | K. Romanik and J. S. Vitter. “Using Vapnik-Chervonenkis Dimension to Analyze the Testing Complexity of Program Segments,” Information and Computation, 128(2), August 1, 1996, 87–108. An extended abstract appears in “Using Computational Learning Theory to Analyze the Testing Complexity of Program Segments,” Proceedings of the 17th Annual IEEE International Computer Software and Applications Conference (COMPSAC ’93), Phoenix, AZ, 1993, 367–373. http://dx.doi.org/10.1006/inco.1996.0065 | |
dc.identifier.uri | http://hdl.handle.net/1808/7205 | |
dc.description.abstract | We examine the complexity of testing di erent program constructs. We do this by de ning a measure of testing complexity known as VCP-dimension, which is similar to the Vapnik-Chervonenkis dimension, and applying it to classes of programs, where all programs in a class share the same syntactic structure. VCP-dimension gives bounds on the number of test points needed to determine that a program is approximately correct, so by studying it for a class of programs we gain insight into the di culty of testing the program construct represented by the class. We investigate the VCP-dimension of straight line code, if-then- else statements, and for loops. We also compare the VCP-dimension of nested and sequential if-then-else statements as well as that of two types of for loops with embedded if-then-else statements. Finally, we perform an empirical study to estimate the expected complexity of straight line code. | |
dc.language.iso | en_US | |
dc.publisher | Elsevier | |
dc.title | Using Vapnik-Chervonenkis Dimension to Analyze the Testing Complexity of Program Segments | |
dc.type | Article | |
kusw.kuauthor | Vitter, Jeffrey Scott | |
kusw.oastatus | fullparticipation | |
dc.identifier.doi | 10.1006/inco.1996.0065 | |
kusw.oaversion | Scholarly/refereed, author accepted manuscript | |
kusw.oapolicy | This item meets KU Open Access policy criteria. | |
dc.rights.accessrights | openAccess |