The program dependence graph and its use in optimization
ACM Transactions on Programming Languages and Systems (TOPLAS)
The semantics of program dependence
PLDI '89 Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation
Interprocedural slicing using dependence graphs
ACM Transactions on Programming Languages and Systems (TOPLAS)
The semantic approach to program slicing
PLDI '91 Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation
The Z notation: a reference manual
The Z notation: a reference manual
Slicing object-oriented software
Proceedings of the 18th international conference on Software engineering
The Semantics of Program Slicing and Program Integration
TAPSOFT '89 Proceedings of the International Joint Conference on Theory and Practice of Software Development, Volume 2: Advanced Seminar on Foundations of Innovative Software Development II and Colloquium on Current Issues in Programming Languages
The program dependence graph in a software development environment
SDE 1 Proceedings of the first ACM SIGSOFT/SIGPLAN software engineering symposium on Practical software development environments
Construction of the System Dependence Graph for Web Application Slicing
SCAM '02 Proceedings of the Second IEEE International Workshop on Source Code Analysis and Manipulation
Z User Studio: An Integrated Support Tool for Z Specifications
APSEC '01 Proceedings of the Eighth Asia-Pacific on Software Engineering Conference
Non-Standard Semantics for Program Slicing
Higher-Order and Symbolic Computation
Formalizing Executable Dynamic and Forward Slicing
SCAM '04 Proceedings of the Source Code Analysis and Manipulation, Fourth IEEE International Workshop
ACM SIGPLAN Notices
| Hi-index | 0.01 |
Program slicing is a well-known technique that has been used in a variety of software engineering areas, such as comprehension, understanding, maintenance, debugging, testing, reuse, metrics, etc. This paper discusses how the formal specification language Z schema calculus may be used to specify program slicing. General aspects of program slicing are considered, i.e. dependence graphs and program slicing algorithms. This formalization could help in the correct understanding of program slicing and also the correct application of a desired slicing regime in a rigorous way.