loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Testing: Academic & Industrial Conference - Practice And Research Techniques (TAIC PART'06)
Identifying State Transitions and their Functions in Source Code
Windsor, United Kingdom
August 29-August 31
ISBN: 0-7695-2672-1
Neil Walkinshaw, The University of Sheffield, UK
Kirill Bogdanov, The University of Sheffield, UK
Mike Holcombe, The University of Sheffield, UK
Finite state machine specifications form the basis for a number of rigorous state-based testing techniques and can help to understand program behaviour. Unfortunately they are rarely maintained during software development, which means that these benefits can rarely be fully exploited. This paper describes a technique that, given a set of states that are of interest to a developer, uses symbolic execution to reverse-engineer state transitions from source code. A particularly novel aspect of our approach is that, besides determining whether or not a state transition can take place, it also precisely identifies the path(s) through the source code that govern a transition. The technique has been implemented as a prototype, enabling a preliminary evaluation of our technique with respect to real software systems.
Citation:
Neil Walkinshaw, Kirill Bogdanov, Mike Holcombe, "Identifying State Transitions and their Functions in Source Code," taic-part, pp.49-58, Testing: Academic & Industrial Conference - Practice And Research Techniques (TAIC PART'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.