Sciweavers

Share
GECCO
2010
Springer

Superstate identification for state machines using search-based clustering

9 years 10 months ago
Superstate identification for state machines using search-based clustering
State machines are a popular method of representing a syshigh level of abstraction that enables developers to gain an overview of the system they represent and quickly understand it. Several techniques have been developed to reverse engineer state machines from software, so as to produce a concise and up-to-date document of how a system works. However, the machines that are recovered are usually flat and conarge number of states. This means that the abstract picture they are supposed to provide is often itself very complex, requiring effort to understand. This paper proposes the use of search-based clustering as a means of overcoming this problem. Clustering state machines opens up the possibility of recovering the structural hierarchy of a state machine, such that superstates may be identified. An evaluation study is performed using the Bunch search-based clustering tool, which demonstrates the usefulness of the approach. Categories and Subject Descriptors D.2.2 [Software Engineering...
Mathew Hall, Phil McMinn, Neil Walkinshaw
Added 06 Dec 2010
Updated 06 Dec 2010
Type Conference
Year 2010
Where GECCO
Authors Mathew Hall, Phil McMinn, Neil Walkinshaw
Comments (0)
books