DocumentCode
1967023
Title
Position statement: Can testing prove software has no bug?
Author
Zhu, Hong
Author_Institution
Dept. of Comput. & Commun. Technol., Oxford Brookes Univ., Oxford, UK
fYear
2012
fDate
16-20 July 2012
Firstpage
255
Lastpage
255
Abstract
The author presents a theorem that states that the correctness of a software system can be validated by testing on a finite number of test cases provided that the program and specification are in a learnable set of functions. Moreover, such testing can be performed without writing down a formal specification. This lays a foundation of the current practice of software testing where formal specifications are not available. This theorem implies that what current testing practice lacks is an analysis of the "complexity" of the program to determine a learnable set within which the program and the specification vary.
Keywords
computational complexity; program testing; program complexity; software system correctness; software testing; Reliability theory; Software reliability; Software systems; Software testing;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Software and Applications Conference (COMPSAC), 2012 IEEE 36th Annual
Conference_Location
Izmir
ISSN
0730-3157
Print_ISBN
978-1-4673-1990-4
Electronic_ISBN
0730-3157
Type
conf
DOI
10.1109/COMPSAC.2012.109
Filename
6340152
Link To Document