Amorphous Slicing of Extended Finite State Machines
Amorphous Slicing of Extended Finite State Machines
复制标题
DOI：
10.1109/tse.2012.72
复制
发表时间：
2013-07
影响因子：
7.4
通讯作者：
K. Androutsopoulos;D. Clark;M. Harman;R. Hierons;Zheng Li;L. Tratt
中科院分区：
文献类型：
--
作者：
K. Androutsopoulos;D. Clark;M. Harman;R. Hierons;Zheng Li;L. Tratt
切片对于许多软件工程应用是有用的，并且已经被广泛研究了三十年，但是对扩展有限状态机（EFSM）切片的工作相对较少。本文介绍了一套基于依赖关系的EFSM切片算法和相应的工具。我们证明了我们的算法是适合于基于依赖的切片。我们使用我们的工具进行实验的10 EFSM，包括基准和工业EFSM。我们的是第一个实证研究的依赖为基础的程序切片的EFSM。与之前唯一发布的基于依赖关系的算法相比，我们的平均切片在40%的时间内较小，仅在10%的时间内较大，对于终止不敏感切片，平均切片大小为35%。
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.