A testability transformation approach for state-based programs

AbdulSalam Kalaji, Robert Mark Hierons, Stephen Swift

Research output: Chapter in Book/Report/Conference proceedingConference contribution book

6 Citations (Scopus)

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 languageEnglish
Title of host publication2009 1st International Symposium on Search Based Software Engineering
PublisherIEEE
Pages85-88
Number of pages4
ISBN (Print)978-0-7695-3675-0
DOIs
Publication statusPublished - 29 May 2009
Event2009 1st International Symposium on Search Based Software Engineering - Windsor, UK
Duration: 13 May 200915 May 2009

Conference

Conference2009 1st International Symposium on Search Based Software Engineering
Period13/05/0915/05/09

Keywords

  • Automatic testing
  • Software testing
  • System testing
  • Equations
  • Software engineering
  • Information systems
  • Performance evaluation
  • Automation
  • Application software
  • Particle measurements

Fingerprint

Dive into the research topics of 'A testability transformation approach for state-based programs'. Together they form a unique fingerprint.

Cite this