research-article

Superstate identification for state machines using search-based clustering

Authors:

Neil WalkinshawAuthors Info & Claims

GECCO '10: Proceedings of the 12th annual conference on Genetic and evolutionary computation

Pages 1381 - 1388

https://doi.org/10.1145/1830483.1830736

Published: 07 July 2010 Publication History

Abstract

State machines are a popular method of representing a system at a high 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 contain a large 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.

References

[1]

G. Ammons, R. Bodík, and J. Larus. Mining Specifications. In 29th SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), pages 4--16, Portland, Oregon, 2002.

Digital Library

[2]

K. Androutsopoulos, N. Gold, M. Harman, Z. Li, and L. Tratt. A theoretical and empirical study of EFSM dependence. In Proceedings of the International Conference on Software Maintenance (ICSM'09), pages 287--296. IEEE, 2009.

[3]

C. Becker, S. Glomb, and M. Graf. Uml notation and ilogix rhapsody tool. Seminar on Tool-supported modeling of Tamagotchi, University of Kaiserslautern, 1998.

[4]

E. Börger. Abstract state machines and high-level system design and analysis. Theoretical Computer Science, 336(2-3):205--207, 2005.

Digital Library

[5]

K. Cheng and A. Krishnakumar. Automatic functional test generation using the extended finite state machine model. In 30th ACM/IEEE Design Automation Conference, pages 86--91, 1993.

Digital Library

[6]

E. J. Chikofsky and J. H. C. II. Reverse engineering and design recovery: A taxonomy. IEEE Software, 7(1):13--17, 1990.

Digital Library

[7]

M. Cohen, S. B. Kooi, and W. Srisa-an. Clustering the heap in multi-threaded applications for improved garbage collection. In GECCO '06: Proceedings of the 8th annual conference on Genetic and evolutionary computation, pages 1901--1908, New York, NY, USA, 2006. ACM.

Digital Library

[8]

J. Cook and A. Wolf. Discovering models of software processes from event-based data. ACM Transactions on Software Engineering and Methodology, 7(3):215--249, July 1998.

Digital Library

[9]

C. Damas, B. Lambeau, P. Dupont, and A. van Lamsweerde. Generating annotated behavior models from end-user scenarios. IEEE Transactions on Software Engineering, 31:1056--1073, 2005.

Digital Library

[10]

D. Harel. Statecharts: A Visual Formalism for Complex Systems. Science of Computer Programming, 8:231--274, 1987.

Digital Library

[11]

M. Harman, S. Swift, and K. Mahdavi. An empirical study of the robustness of two module clustering fitness functions. In Genetic and Evolutionary Computation Conference, 2005.

Digital Library

[12]

M. Heimdahl and M. Whalen. Reduction and Slicing of Hierarchical State Machines. In Proceedings of the 6th European conference held jointly with the 5th ACM SIGSOFT international symposium on Foundations of software engineering (FSE'97), 1997.

Digital Library

[13]

V. I. Levenshtein. Binary codes capable of correcting deletions, insertions and reversals. Soviet Physics-Doklady No 8, 10:707--710, 1966.

[14]

H. Li, Y. Min, and Z. Li. Clustering of behavioral phases in FSMs and its applications to VLSI test. Science in China Series F: Information Sciences 45(6), 462--478. (2002), 2002.

[15]

B. Mitchell. A Heuristic Search Approach to Solving the Software Clustering Problem. PhD thesis, Drexel Universit, Philadelphia, PA, 2002.

Digital Library

[16]

B. Mitchell and S. Mancoridis. On the automatic modularization of software systems using the bunch tool. In IEEE Transactions on Software Engineering, 2006.

Digital Library

[17]

M. J. Rattigan, M. Maier, D. Jensen, B. Wu, X. Pei, J. Tan, and Y. Wang. Exploiting network structure for active inference in collective classification. In ICDM Workshops, pages 429--434, 2007.

Digital Library

[18]

M. E. Romera. Using finite automata to represent mental models. Master's thesis, San Jose State University, 2000.

[19]

N. Walkinshaw. Statechum project website.

[20]

N. Walkinshaw, K. Bogdanov, M. Holcombe, and S. Salahuddin. Reverse Engineering State Machines by Interactive Grammar Inference. In 14th IEEE International Working Conference on Reverse Engineering (WCRE), 2007.

Digital Library

[21]

N. Walkinshaw, J. Derrick, and Q. Guo. Iterative refinement of reverse-engineered models by model-based testing. In Proceedings of FM 2009: Formal Methods, volume 5850 of Lecture Notes in Computer Science, pages 305--320. Springer, 2009.

Digital Library

[22]

M. Weiser. Program Slicing. IEEE Transactions on Software Engineering, SE-10(4):352--357, July 1984.

Digital Library

Cited By

Amtoft TAndroutsopoulos KClark D(2020)Correctly Slicing Extended Finite State MachinesFrom Lambda Calculus to Cybersecurity Through Program Analysis10.1007/978-3-030-41103-9_6(149-197)Online publication date: 15-Feb-2020
https://doi.org/10.1007/978-3-030-41103-9_6
Hall M(2011)Complexity metrics for hierarchical state machinesProceedings of the Third international conference on Search based software engineering10.5555/2042243.2042257(76-81)Online publication date: 10-Sep-2011
https://dl.acm.org/doi/10.5555/2042243.2042257
Hall MGyimóthy TZeller A(2011)Search based hierarchy generation for reverse engineered state machinesProceedings of the 19th ACM SIGSOFT symposium and the 13th European conference on Foundations of software engineering10.1145/2025113.2025170(392-395)Online publication date: 5-Sep-2011
https://dl.acm.org/doi/10.1145/2025113.2025170
Show More Cited By

Index Terms

Superstate identification for state machines using search-based clustering
1. Software and its engineering
  1. Software creation and management
    1. Software post-development issues
      1. Documentation
      2. Software reverse engineering
  2. Software organization and properties
    1. Software system structures
      1. Software system models
        State systems

Recommendations

Search based hierarchy generation for reverse engineered state machines
ESEC/FSE '11: Proceedings of the 19th ACM SIGSOFT symposium and the 13th European conference on Foundations of software engineering

Abstraction is a valuable tool that can play an important role in reducing the cost of maintenance of software systems. Despite the cost reduction abstract documentation can provide, the cost of generating documentation that offers an implementation-...
A metric towards evaluating understandability of state machines: An empirical study

Context: State machines are widely used to describe the dynamic behavior of objects, components, and systems. As a communication tool between various stakeholders, it is essential that state machines be easily and correctly comprehensible. Poorly ...
A pattern story for combining crosscutting concern state machines
PLOP '07: Proceedings of the 14th Conference on Pattern Languages of Programs

This paper describes a solution to a real world problem using a combination of well-known patterns. The problem deals with combining state machines that represent core concerns and crosscutting concerns in a loosely coupled manner. The state based ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences

GECCO '10: Proceedings of the 12th annual conference on Genetic and evolutionary computation

July 2010

1520 pages

ISBN:9781450300728

DOI:10.1145/1830483

General Chair:
Martin Pelikan
University of Missouri, USA
,
Program Chair:
Jürgen Branke
University of Warwick, Coventry, UK

Copyright © 2010 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGEVO: ACM Special Interest Group on Genetic and Evolutionary Computation

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 07 July 2010

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

GECCO '10

Sponsor:

SIGEVO

GECCO '10: Genetic and Evolutionary Computation Conference

July 7 - 11, 2010

Oregon, Portland, USA

Acceptance Rates

Overall Acceptance Rate 1,669 of 4,410 submissions, 38%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
116
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 03 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Amtoft TAndroutsopoulos KClark D(2020)Correctly Slicing Extended Finite State MachinesFrom Lambda Calculus to Cybersecurity Through Program Analysis10.1007/978-3-030-41103-9_6(149-197)Online publication date: 15-Feb-2020
https://doi.org/10.1007/978-3-030-41103-9_6
Hall M(2011)Complexity metrics for hierarchical state machinesProceedings of the Third international conference on Search based software engineering10.5555/2042243.2042257(76-81)Online publication date: 10-Sep-2011
https://dl.acm.org/doi/10.5555/2042243.2042257
Hall MGyimóthy TZeller A(2011)Search based hierarchy generation for reverse engineered state machinesProceedings of the 19th ACM SIGSOFT symposium and the 13th European conference on Foundations of software engineering10.1145/2025113.2025170(392-395)Online publication date: 5-Sep-2011
https://dl.acm.org/doi/10.1145/2025113.2025170
Hall M(2011)Complexity Metrics for Hierarchical State MachinesSearch Based Software Engineering10.1007/978-3-642-23716-4_10(76-81)Online publication date: 2011
https://doi.org/10.1007/978-3-642-23716-4_10

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten