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.
@InProceedings{fox_et_al:DagSemProc.05451.5, 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 = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05451.5}, URN = {urn:nbn:de:0030-drops-4932}, doi = {10.4230/DagSemProc.05451.5}, annote = {Keywords: Slicing, statecharts, And-Or depdence graphs, interference, conditioning} }
Feedback for Dagstuhl Publishing