Gopal, “Dynamic program slicing based on dependence realtions”, IEEE, pp 191-200, Aug. 1991.* |
Agrawl et al., “Dynamic program slicing”, ACM SIGPLAN PLDI, pp 246-256, Jun. 1990.* |
Korel et al., “Dynamic program slicing in understanding of program execution”, IEEE, pp 80-89, 1997.* |
Ashida et al., “Slicing methods using static and dynamic analysis onfromation”, IEEE pp 344-350, 1999.* |
Song et al., “Forward dynamic object orienetd progarm slicing”, IEEE, pp 230-237, Feb. 1999.* |
Korel et al, “Program slicing in undersatnding of large program”, IEEE pp 145-152, Mar. 1998.* |
Jiang et al., “Program slicing for C the problem in implementation”, IEEE pp 182-190, Aug. 1991.* |
Venkatesh, “The semantic approach to program slicing”, ACM SIGPLAN PLDI, pp 107-119, Jun. 1991.* |
Sinha et al, “System dependence graph based slicing of program with arbitaray interprocedural control flow”, ACMICSE, pp 432-441, 1999.* |
Binkey et al, “An empircal study of amorphous slicing as a program comprehension support tool”, IEEE, pp 161-170, 2000.* |
Zhao, “A slicing based approach to extracting reusable software architecturs”, IEEE, pp 1-9, 2000.* |
Visser et al, “Modle checking programs”, IEEE, pp 3-11, 2000.* |
Weiser, M., “Program Slices: Formal, Psychological, and Practical Investigations of an Automatic Program Abstraction Method”, UMI Dissertation Services, Degree Date: 1979. |
Weiser, M., “Program Slicing”, IEEE Transactions on Software Engineering, vol. SE-10, No. 4, Jul. 1984, p. 352-357. |
Aiken, A. et al., “The Complexity of Set Constraints”, Computer Science Logic. 7th Workshop, CSL '93 Selected Papers 1994, p. 1-17. |
Cytron, R. et al., “Efficiently Computing Static Single Assignment Form and the Control Dependence Graph”, ACM Transactions on Programming Languages & Systems, vol. 13, No. 4, Oct. 1991, p. 451-490. |
Fahndrich, M. et al., “Program Analysis Using Mixed Term and Set Constraints”, Static Analysis. 4th Int'l. Symposium, SAS '97 Proceedings 1997, p. 114-126. |
Ferrante, J. et al., “The Program Dependence Graph and Its Use in Optimization”, ACM Transactions on Programming Languages & Systems, vol. 9, No. 3, Jul. 1987, p. 319-349. |
Knight, K., “Unification: A Multidisciplinary Survey”, ACM Computing Surveys, vol. 21, No. 1, Mar. 1989, p. 93-124. |
Milner, R., “A Theory of Type Polymorphism in Programming”, Journal of Computer & System Sciences 17, 1978, p. 348-375. |
O'Callahan, R., et al., “Lackwit: A Program Understanding Tool Based on Type Inference”, Proceedings of the 1997 Int'l. Conference on Software Engineering, ICSE 97 1997 p. 338-348. |
Shapiro, M., et al., “Fast and Accurate Flow-Insensitive Points-to-Analysis”, Proceedings of the 1997 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '97 p. 1-14. |
Steensgaard, B., “Points-To Analysis By Type Inference of Programs With Structures and Unions”, Compiler Construction, 6th Int'l. Conference, CC'96, Linkoping, Sweden, Apr. 24-26, 1996 Proceedings, p. 136-150. |
Steensgaard, B., “Points-To Analysis in Almost Linear Time”, ACM Press Conference Record of POPL '96: The 23rd ACM Sigplan-Sigact Symposium on Principles of Program. Lang, St. Petersburg Beach, FL, Jan. 21-24, 1996 p. 32-41. |
Tip, F., “A Survey of Program Slicing Techniques”, Journal of Programming Languages 3, 1995, p. 121-189. |