DagSemProc.05451.5.pdf
- Filesize: 148 kB
- 12 pages
Document
And-Or Dependence Graphs for Slicing Statecharts
Authors
-
Part of:
Volume:
Dagstuhl Seminar Proceedings, Volume 5451
Series: Dagstuhl Seminar Proceedings (DagSemProc) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2006-07-07
Cite AsGet BibTex
Chris Fox and Arthorn Luangsodsai. And-Or Dependence Graphs for Slicing Statecharts. In Beyond Program Slicing. Dagstuhl Seminar Proceedings, Volume 5451, pp. 1-12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
https://doi.org/10.4230/DagSemProc.05451.5
https://doi.org/10.4230/DagSemProc.05451.5
Abstract
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.
Keywords
- Slicing
- statecharts
- And-Or depdence graphs
- interference
- conditioning
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads