Dynamic slicing in the presence of unconstrained pointers
- 1 October 1991
- conference paper
- Published by Association for Computing Machinery (ACM)
Abstract
Program slices are useful in debugging. Most work on program slicing to date has concentrated on finding slices of programs involving only scalar variables. Pointers and composite variables do not lend themselves well to static analysis, especially when the language involved is not strongly-typed. When debugging a program, however, we are interested in analyzing the program behavior for testcases that reveal a fault. In this paper, we present a uniform approach to handling pointers and...Keywords
This publication has 16 references indexed in Scilit:
- A formal model of program dependences and its implications for software testing, debugging, and maintenanceIEEE Transactions on Software Engineering, 1990
- Analysis of pointers and structuresACM SIGPLAN Notices, 1990
- Dynamic program slicingACM SIGPLAN Notices, 1990
- Interprocedural slicing using dependence graphsACM Transactions on Programming Languages and Systems, 1990
- Integrating noninterfering versions of programsACM Transactions on Programming Languages and Systems, 1989
- Dynamic program slicingInformation Processing Letters, 1988
- The program dependence graph and its use in optimizationACM Transactions on Programming Languages and Systems, 1987
- Information-flow and data-flow analysis of while-programsACM Transactions on Programming Languages and Systems, 1985
- The program dependence graph in a software development environmentPublished by Association for Computing Machinery (ACM) ,1984
- Programmers use slices when debuggingCommunications of the ACM, 1982