On slicing programs with jump statements
- 1 June 1994
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 29 (6) , 302-312
- https://doi.org/10.1145/773473.178456
Abstract
No abstract availableThis publication has 22 references indexed in Scilit:
- Debugging with dynamic slicing and backtrackingSoftware: Practice and Experience, 1993
- Using program slicing in software maintenanceIEEE Transactions on Software Engineering, 1991
- The semantic approach to program slicingACM SIGPLAN Notices, 1991
- Dynamic slicing of computer programsJournal of Systems and Software, 1990
- Integrating noninterfering versions of programsACM Transactions on Programming Languages and Systems, 1989
- The semantics of program dependenceACM SIGPLAN Notices, 1989
- A fast algorithm for finding dominators in a flowgraphACM Transactions on Programming Languages and Systems, 1979
- Certification of programs for secure information flowCommunications of the ACM, 1977
- An Algorithm for Structuring FlowgraphsJournal of the ACM, 1977
- Algorithm 430 [H]: Immediate predominators in a directed graphCommunications of the ACM, 1972