Control Dependence for Extended Finite State Machines

Kelly Androutsopoulos, David Clark, Mark Harman, Zheng Li, Laurence Tratt

Research output: Chapter in Book/Report/Conference proceedingConference paper

40 Citations (Scopus)

Abstract

Though there has been nearly three decades of work on program slicing, there has been comparatively little work on slicing for state machines. One of the primary challenges that currently presents a barrier to wider application of state machine slicing is the problem of determining control dependence. We survey existing related definitions, introducing a new definition that subsumes one and extends another. We illustrate that by using this new definition our slices respect Weiser slicing's termination behaviour. We prove results that clarify the relationships between our definition and older ones, following this lip with examples to motivate the need for these differences.
Original languageEnglish
Title of host publicationUnknown
Place of PublicationBERLIN
PublisherSpringer
Pages216 - 230
Number of pages15
Volume5503
ISBN (Print)978-3-642-00592-3
Publication statusPublished - 2009
Event12th International Conference on Fundamental Applroaches to Software Engineering held in Conjuction with European Conference on Theroy and Practice of Software - York, ENGLAND
Duration: 22 Mar 200929 Mar 2009

Publication series

NameFUNDAMENTAL APPROACHES TO SOFTWARE ENGINEERING, PROCEEDINGS

Conference

Conference12th International Conference on Fundamental Applroaches to Software Engineering held in Conjuction with European Conference on Theroy and Practice of Software
CityYork, ENGLAND
Period22/03/200929/03/2009

Fingerprint

Dive into the research topics of 'Control Dependence for Extended Finite State Machines'. Together they form a unique fingerprint.

Cite this