When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.05451.5
URN: urn:nbn:de:0030-drops-4932
Go to the corresponding Portal

Fox, Chris ; Luangsodsai, Arthorn

And-Or Dependence Graphs for Slicing Statecharts

05451.FoxChris.Paper.493.pdf (0.1 MB)


The construction of an And-Or dependence graphs is illustrated,
and its use in slicing statecharts is described. The additional
structure allows for more precise slices to be constructed in the
event of additional information, such as may be provided by
static analysis and model checking, and with constraints on the
global state and external events.

BibTeX - Entry

  author =	{Fox, Chris and Luangsodsai, Arthorn},
  title =	{{And-Or Dependence Graphs for Slicing Statecharts}},
  booktitle =	{Beyond Program Slicing},
  pages =	{1--12},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{5451},
  editor =	{David W. Binkley and Mark Harman and Jens Krinke},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{},
  URN =		{urn:nbn:de:0030-drops-4932},
  doi =		{10.4230/DagSemProc.05451.5},
  annote =	{Keywords: Slicing, statecharts, And-Or depdence graphs, interference, conditioning}

Keywords: Slicing, statecharts, And-Or depdence graphs, interference, conditioning
Collection: 05451 - Beyond Program Slicing
Issue Date: 2006
Date of publication: 07.07.2006

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI