The program dependence graph and its use in optimization
ACM Transactions on Programming Languages and Systems (TOPLAS)
Statecharts: A visual formalism for complex systems
Science of Computer Programming
Interprocedural slicing using dependence graphs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Reduction and slicing of hierarchical state machines
ESEC '97/FSE-5 Proceedings of the 6th European SOFTWARE ENGINEERING conference held jointly with the 5th ACM SIGSOFT international symposium on Foundations of software engineering
Slicing Hierarchical Automata for Model Checking UML Statecharts
ICFEM '02 Proceedings of the 4th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
On the Effectiveness of Slicing Hierarchical State Machines: A Case Study
EUROMICRO '98 Proceedings of the 24th Conference on EUROMICRO - Volume 1
ICSM '03 Proceedings of the International Conference on Software Maintenance
A brief survey of program slicing
ACM SIGSOFT Software Engineering Notes
Formal Validation of Hierarchical State Machines against Expectations
ASWEC '07 Proceedings of the 2007 Australian Software Engineering Conference
A new foundation for control dependence and slicing for modern program structures
ACM Transactions on Programming Languages and Systems (TOPLAS) - Special Issue ESOP'05
AIC'09 Proceedings of the 9th WSEAS international conference on Applied informatics and communications
Bridging the Gap between Fault Trees and UML State Machine Diagrams for Safety Analysis
APSEC '10 Proceedings of the 2010 Asia Pacific Software Engineering Conference
Hi-index | 0.00 |
Program slicing is a useful reduction technique in many areas such as debugging and testing, and thus, there has also been some research to try and apply slicing techniques to flat state-based models at the design level, for their maintenance and quality improvement. However, such state-based models have difficulties in specifying large and complex software systems, and so the benefit obtained from slicing such models, is very limited. In contrast, UML state machine diagrams can properly describe the behavior of large software systems; but it is difficult to apply a slicing algorithm to automatically reduce the diagram with respect to a point of interest, because of the unique properties (such as hierarchy and orthogonality) of these diagrams. In this paper, we identify important issues relevant to the slicing of UML state machine diagrams with regards to data and control dependence. We also show why the unique properties of these diagrams are important to consider when retrieving data and control dependence information, by virtue of an illustrative example.