Output details
11 - Computer Science and Informatics
King's College London
Article title
Amorphous Slicing of Extended Finite State Machines
Type
D - Journal article
Title of journal
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING
Article number
-
Volume number
39
Issue number
7
First page of article
892
ISSN of journal
0098-5589
Year of publication
2013
URL
-
Number of additional authors
5
Additional information
<08>Slicing shrinks EFSMs in size, allowing industry to scale up its use of EFSMs. Compared to previous approaches our novel slicing algorithm accepts a larger class of EFSMs as inputs and produces smaller slices as output. It accepts non-terminating and multiply terminating EFSMs commonly used in industry. We formally establish the computational complexity of the algorithm, and use experiments to systematically compare slice size for different algorithms. The results are applicable to a wide category of related languages such as statecharts.
Interdisciplinary
-
Cross-referral requested
-
Research group
D - Software Modelling and Applied Logic
Citation count
0
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
