DocumentCode :
3532301
Title :
Verification-Based Test Case Generation for Full Feasible Branch Coverage
Author :
Gladisch, Christoph
Author_Institution :
Dept. of Comput. Sci., Univ. of Koblenz-Landau, Koblenz
fYear :
2008
fDate :
10-14 Nov. 2008
Firstpage :
159
Lastpage :
168
Abstract :
The goal of this work is to improve the testing of programs that contain loops and complex methods. We achieve this goal with verification-based testing, which is a technique that can generate test cases not only from source code but also from loop invariants and method specifications provided by the user. These test cases ensure the execution of interesting program paths that are likely to be missed by existing testing techniques that are based on symbolic program execution. These techniques would require an exhaustive inspection of all execution paths, which is hard to achieve in presence of complex methods and impossible if loops are involved. Verification-based testing takes a different approach.
Keywords :
formal specification; program control structures; program verification; exhaustive inspection; full feasible branch coverage; loop invariant; program testing; symbolic program execution; verification-based test case generation; Arithmetic; Calculus; Computer science; Concrete; Inspection; Java; Logic testing; Programming; Software engineering; Software testing; Branch Coverage; Dynamic Logic; Java; Precondition; Specification-based Testing; Verification-based Testing; White-box Testing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Software Engineering and Formal Methods, 2008. SEFM '08. Sixth IEEE International Conference on
Conference_Location :
Cape Town
Print_ISBN :
978-0-7695-3437-4
Type :
conf
DOI :
10.1109/SEFM.2008.22
Filename :
4685803
Link To Document :
بازگشت