Issue No. 07 - July (2013 vol. 39)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TSE.2012.72
Kelly Androutsopoulos , University College London, London
David Clark , University College London, London
Mark Harman , University College London, London
Robert M. Hierons , Brunel University, Uxbridge, Middlesex
Zheng Li , Beijing University of Chemical Technology, Beijing
Laurence Tratt , King's Colledge London, London
Slicing is useful for many software engineering applications and has been widely studied for three decades, but there has been comparatively little work on slicing extended finite state machines (EFSMs). This paper introduces a set of dependence-based EFSM slicing algorithms and an accompanying tool. We demonstrate that our algorithms are suitable for dependence-based slicing. We use our tool to conduct experiments on 10 EFSMs, including benchmarks and industrial EFSMs. Ours is the first empirical study of dependence-based program slicing for EFSMs. Compared to the only previously published dependence-based algorithm, our average slice is smaller 40 percent of the time and larger only 10 percent of the time, with an average slice size of 35 percent for termination insensitive slicing.
Automata, Algorithm design and analysis, Approximation algorithms, Software algorithms, Unified modeling language, Educational institutions, Electronic mail, extended finite state machines, Slicing
M. Harman, L. Tratt, R. M. Hierons, K. Androutsopoulos, Z. Li and D. Clark, "Amorphous Slicing of Extended Finite State Machines," in IEEE Transactions on Software Engineering, vol. 39, no. , pp. 892-909, 2013.