Premium
Automated discovery of state transitions and their functions in source code
Author(s) -
Walkinshaw Neil,
Bogdanov Kirill,
Ali Shaukat,
Holcombe Mike
Publication year - 2008
Publication title -
software testing, verification and reliability
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.216
H-Index - 49
eISSN - 1099-1689
pISSN - 0960-0833
DOI - 10.1002/stvr.380
Subject(s) - computer science , state (computer science) , source code , finite state machine , reverse engineering , set (abstract data type) , code (set theory) , programming language , software , software engineering , transition (genetics) , theoretical computer science , biochemistry , chemistry , gene
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 identifies the paths through the source code that govern a transition. The technique has been implemented as a prototype, enabling its preliminary evaluation with respect to real software systems. Copyright © 2007 John Wiley & Sons, Ltd.