Program Slicing

IEEE Transactions on Software Engineering

Volumn SE-10, Issue 4, 1984, Pages 352-357

  Weiser, Mark ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

Data flow analysis; debugging; human factors; Index Terms; parallel processing; program maintenance; program metrics; slicing; software tools

Indexed keywords

PROGRAM SLICING;

COMPUTER PROGRAMMING;

EID: 0021457061     PISSN: 00985589     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSE.1984.5010248     Document Type: Article

References (25)

1. J. J. Arsac, “Syntactic source to source transformations and program manipulation,” Commun. ACM, vol. 22, pp. 43–53, Jan. 1979.
2. E. A. Ashcroft and Z. Manna, The Translation of Goto Programs into While Programs. Amsterdam, The Netherlands: North-Holland, 1973. Information Processing 71.
3. B. O. Aygun, “Dynamic analysis of execution-possibilities, techniques, and problems,” Ph.D. dissertation, Comput. Sci., Dep. Carnegie-Mellon Univ., Tech Rep. CMU-083, Sept. 1973.
4. B. Baker, “An algorithm for structuring flowgraphs,” J. Ass. Comput. Mach., vol. 24, pp. 98–120, Jan. 1977.
5. J. M. Barth, “A practical interprocedural dataflow analysis algorithm,” Commun. Ass. Comput. Mach., vol. 21, pp. 724–736, Sept. 1978.
6. V. R. Basili and R. W. Reiter, “An investigation of human factors in software development,” Comput., vol. 12, pp. 21–38, Dec. 1979.
7. J. C. Browne and D. B. Johnson, “FAST: A second generation program analysis system,” in Proc. Third Int. Conf. Software Eng., pp. 142–148, May 1978. IEEE Catalog 78CH1317-7C.
8. D. E. Denning and P. J. Denning, “Certification of programs for secure information flow,” Commun. Ass. Comput. Mach., vol. 20, pp. 504–513, July 1977.
9. J. D. Gannon and J. Rosenberg, “Implementing data abstraction features in a stack-based language,” Software-Practice and Experience 9, pp. 547-560, 1979.
10. S. Gerhart, “Correctness preserving program transformations,” in Proc. ACM Second Conf. Principles of Programming Languages, pp. 54–66, Jan. 1975.
11. S. L. Graham and M. Wegman, “A fast and usually linear algorithm for global flow analysis,” J. Ass. Comput. Mach., vol. 23, pp. 172-202, Jan. 1976.
12. J. D. Ichbiah et. al., “Preliminary Ada reference manual and rationale,” Sigplan Notices, vol. 14, no. 6, 1979.
13. J. King, “Program reduction using symbolic evaluation,” ACM SIGSOFT, Software Engineering Notes 6, Jan. 1, 1981.
14. T. Lengauer and R. E. Tarjan, “A fast algorithm for finding dominators in a flowgraph,” ACM Trans. Programming Languages and Systems, vol. 1, pp. 121–141, July 1979.
15. B. Liskov, A. Snyder, R. Atkinson, and C. Schaffert, “Abstraction mechanisms in CLU,” Commun. ACM, vol. 20, pp. 564–576, Aug. 1977.
16. D. B. Loveman, “Program improvement by source to source transformation, ” J. Ass. Comput. Mach., vol. 24, pp. 121–145, Jan. 1977.
17. T. W. Pratt, Programming Languages: Design and Implementation. Englewood Cliffs, NJ: Prentice-Hall, 1975.
18. J. T. Schwartz, “An overview of bugs,” in Debugging Techniques in Large Systems, R. Rustin, Ed. Englewood Cliffs, NJ: Prentice-Hall, 1971.
19. B. Wegbreit, “Goal-directed program transformation,” IEEE Trans. Software Eng., vol. SE-2, pp. 69–80, June 1976.
20. M. Weiser, “Program slices: Formal, psychological, and practical investigations of an automatic program abstraction method,” Ph.D. dissertation, Univ. Michigan, Ann Arbor, MI, 1979.
21. M. Weiser, ” in Proc. Fifth Int. Conf. Software Eng., San Diego, CA, Mar. 1981.
22. M. Weiser, “Programmers use slices when debugging,” Commun. ACM, vol. 25, pp. 446–452, July, 1982.
23. M. Weiser, ” J. Comput. Languages, to be published, 1983.
24. M. Weiser, “Reconstructing sequential behavior from parallel behavior projections,” Inform. Processing Lett., vol. 17, pp. 129–135, Oct. 5, 1983.
25. W. A. Wulf, R. L. London, and M. Shaw, “An introduction to the construction and verification of Alphard programs,” IEEE Trans. Software Eng., vol. 2, no. 4, pp. 253–265, 1976.