Control Dependence for Extended Finite State Machines

  • Authors:
  • Kelly Androutsopoulos;David Clark;Mark Harman;Zheng Li;Laurence Tratt

  • Affiliations:
  • Department of Computer Science, King's College London, Strand, London, United Kingdom WC2R 2LS;Department of Computer Science, King's College London, Strand, London, United Kingdom WC2R 2LS;Department of Computer Science, King's College London, Strand, London, United Kingdom WC2R 2LS;Department of Computer Science, King's College London, Strand, London, United Kingdom WC2R 2LS;Bournemouth University, Poole, Dorset, United Kingdom BH12 5BB

  • Venue:
  • FASE '09 Proceedings of the 12th International Conference on Fundamental Approaches to Software Engineering: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

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 up with examples to motivate the need for these differences.