Abstract
Search based testing approaches are efficient in test data generation; however they are likely to perform poorly when applied to programs with state variables. The problem arises when the target function includes guards that reference some of the program state variables whose values depend on previous function calls. Thus, merely considering the target function to derive test data is not sufficient. This paper introduces a testability transformation approach based on the analysis of control and data flow dependencies to bypass the state variable problem. It achieves this by eliminating state variables from guards and/ or determining which functions to call in order to satisfy guards with state variables. A number of experiments demonstrate the value of the proposed approach.
| Original language | English |
|---|---|
| Title of host publication | 2009 1st International Symposium on Search Based Software Engineering |
| Publisher | IEEE |
| Pages | 85-88 |
| Number of pages | 4 |
| ISBN (Print) | 978-0-7695-3675-0 |
| DOIs | |
| Publication status | Published - 29 May 2009 |
| Event | 2009 1st International Symposium on Search Based Software Engineering - Windsor, UK Duration: 13 May 2009 → 15 May 2009 |
Conference
| Conference | 2009 1st International Symposium on Search Based Software Engineering |
|---|---|
| Period | 13/05/09 → 15/05/09 |
Keywords
- Automatic testing
- Software testing
- System testing
- Equations
- Software engineering
- Information systems
- Performance evaluation
- Automation
- Application software
- Particle measurements