Incremental Test Case Generation for UML-RT Models Using Symbolic Execution

2012 ◽  
Author(s):  
Eric James Rapos ◽  
Juergen Dingel
Keyword(s):  
Symbolic Execution ◽  
Test Case Generation ◽  
Test Case ◽  
Incremental Test

scholarly journals Test case generation for object-oriented imperative languages in CLP

2010 ◽  
Vol 10 (4-6) ◽  
pp. 659-674 ◽  
Author(s):  
MIGUEL GÓMEZ-ZAMALLOA ◽  
ELVIRA ALBERT ◽  
GERMÁN PUEBLA
Keyword(s):  
Symbolic Execution ◽  
Object Oriented ◽  
Test Case Generation ◽  
Test Case ◽  
Test Cases ◽  
Software Development Process ◽  
Java Programs ◽  
Promising Application ◽  
Account Due ◽  
Imperative Language

AbstractTesting is a vital part of the software development process. Test Case Generation (TCG) is the process of automatically generating a collection of test-cases which are applied to a system under test. White-box TCG is usually performed by means of symbolic execution, i.e., instead of executing the program on normal values (e.g., numbers), the program is executed on symbolic values representing arbitrary values. When dealing with an object-oriented (OO) imperative language, symbolic execution becomes challenging as, among other things, it must be able to backtrack, complex heap-allocated data structures should be created during the TCG process and features like inheritance, virtual invocations and exceptions have to be taken into account. Due to its inherent symbolic execution mechanism, we pursue in this paper that Constraint Logic Programming (CLP) has a promising application field in tcg. We will support our claim by developing a fully CLP-based framework to TCG of an OO imperative language, and by assessing it on a corresponding implementation on a set of challenging Java programs.

Sign in / Sign up

Export Citation Format

Share Document