Please use this identifier to cite or link to this item:
Title: Amorphous slicing of extended finite state machines
Authors: Androutsopoulos, K
Clark, D
Harman, M
Hierons, RM
Li, Z
Tratt, L
Keywords: Slicing;Extended finite state machines
Issue Date: 2013
Publisher: Institute of Electrical and Electronics Engineers
Citation: IEEE Transactions on Software Engineering, 39(7), 892 - 909, 2013
Abstract: 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 dependency 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 ten 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% of the time and larger only 10% of the time, with an average slice size of 35% for termination insensitive slicing.
ISSN: 0098-5589
Appears in Collections:Computer Science
Dept of Computer Science Research Papers

Files in This Item:
File Description SizeFormat 
Fulltext.pdf1.06 MBUnknownView/Open

Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.