Incremental slicing based on data-dependences types

IEEE International Conference on Software Maintenance, ICSM

Volumn , Issue , 2001, Pages 158-167

  Orso, Alessandro ^a   Sinha, Saurabh ^a   Harrold, Mary Jean ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA DEPENDENCE; INCREMENTAL SLICING; PROGRAM SLICING;

ALGORITHMS; C (PROGRAMMING LANGUAGE); COMPUTATIONAL COMPLEXITY; COMPUTER SOFTWARE MAINTENANCE; DATA FLOW ANALYSIS; PROGRAM DEBUGGING;

COMPUTER SOFTWARE SELECTION AND EVALUATION;

EID: 77956615330     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICSM.2001.972726     Document Type: Conference Paper

References (24)

1. H. Agrawal, R. A. DeMillo, and E. H. Spafford. Dynamic slicing in the presence of unconstrained pointers. In Proceedings of the symposium on Testing, Analysis, and Verification, pages 60-73, Oct. 1991.
2. Aristotle Research Group. ARISTOTLE: Software engineering tools. http://www.cc.gatech.edu/aristotle/, 2000.
3. D. C. Atkinson and W. G. Griswold. Effective whole-program analysis in the presence of pointers. In Proceedings of ACM SIGSOFT 6th Intl. Symposium on the Found. of Software Engineering, pages 46-55, Nov. 1998.
4. L. Bent, D. C. Atkinson, and W. G. Griswold. A comparative study of two whole-program slicers for C. Technical Report UCSD TR CS2000-0643, University of California at San Diego, May 2000.
5. D. W. Binkley and J. R. Lyle. Application of the pointer state subgraph to static program slicing. The Journal of Systems and Software, 40(1):17-27, Jan. 1998.
6. G. Canfora, A. Cimitile, and A. D. Lucia. Conditioned program slicing. Information and Software Technology, 40(11-12):595-608, Nov. 1998.
7. J. Ferrante, K. J. Ottenstein, and J. D. Warren. The program dependence graph and its use in optimization. ACM Transactions on Programming Languages and Systems, 9(3):319-349, Jul. 1987.
8. P. G. Frankl and E. J. Weyuker. An applicable family of data flow testing criteria. IEEE Transactions on Software Engineering, 14(10):1483-1498, Oct. 1988.
9. M. Harman and S. Danicic. Amorphous program slicing. In Proceedings of the 5th Intl. Workshop on Program Comprehension, pages 70-79, Mar. 1997.
10. M. J. Harrold and N. Ci. Reuse-driven interprocedural slicing. In Proceedings of the 20th Intl. Conference on Software Engineering, pages 74-83, Apr. 1998.
11. S. Horwitz, T. Reps, and D. Binkley. Interprocedural slicing using dependence graphs. ACM Transactions on Programming Languages and Systems, 12(1):26-60, Jan. 1990.
12. W. Landi and B. G. Ryder. A safe approximate algorithm for interprocedural pointer aliasing. In Proceedings of the ACM SIGPLAN '92 Conference on Program Language Design and Implementation, pages 235-248, Jun. 1992.
13. W. Landi, B. G. Ryder, and S. Zhang. Interprocedural modification side effect analysis with pointer aliasing. In Proceedings of the ACM SIGPLAN '93 Conference on Program Language Design and Implementation, pages 56-67, Jun. 1993.
14. D. Liang and M. J. Harrold. Efficient points-to analysis for whole-program analysis. In Proceedings of ESEC/FSE '99, vol. 1687 of LNCS, pages 199-215. Springer-Verlag, Sep. 1999.
15. D. Liang and M. J. Harrold. Reuse-driven interprocedural slicing in the presence of pointers and recursion. In Proceedings of the Intl. Conference on Software Maint., pages 421-432, Aug. 1999.
16. E. Merlo and G. Antoniol. A static measure of a subset of intra-procedural data flow testing coverage based on node coverage. In Proceedings of CASCON '99, pages 173-186, Nov. 1999.
17. A. Orso, S. Sinha, and M. J. Harrold. Effects of pointers on data dependences. In Proceedings of the 9th Intl. Workshop on Program Comprehension, pages 39-49, May 2001.
18. T. J. Ostrand and E. J. Weyuker. Data flow-based test adequacy analysis for lang. with pointers. In Proceedings of the Symposium on Testing, Analysis, and Verification, pages 74-86, Oct. 1991.
19. Programming Language Research Group. PROLANGS Analysis Framework. http://www.prolangs.rutgers.edu/, Rutgers University, 1998.
20. S. Rapps and E. J. Weyuker. Selecting software test data using data flow information. IEEE Transactions on Software Engineering, SE-11(4):367-375, Apr. 1985.
21. M. Shapiro and S. Horwitz. The effects of the precision of pointer analysis. In 4th Intl. Static Analysis Symposium, vol. 1302 of LNCS, pages 16-34, Sept. 1997.
22. S. Sinha, M. J. Harrold, and G. Rothermel. System-dependence-graph-based slicing of programs with arbitrary interprocedural control flow. In Proceedings of the 21st Intl. Conference on Software Engineering, pages 432-441, May 1999.
23. P. Tonella. Effects of different flow insensitive points-to analyses on DEF/USE sets. In Proceedings of the 3rd European Conference on Software Maint. and Reengineering, pages 62-69, Mar. 1999.
24. M. Weiser. Program slicing. IEEE Transactions on Software Engineering, 10(4):352-357, July 1984.