Using dynamic information in the interprocedural static slicing of binary executables

Software Quality Journal

Volumn 13, Issue 3, 2005, Pages 227-245

  Kiss, Ákos ^a   Jász, Judit ^a   Gyimóthy, Tibor ^a  

^a UNIVERSITY OF SZEGED   (Hungary)

Author keywords

Binary executables; Call graph; Dynamic information; Indirect function call; Interprocedural slicing; Static slicing

Indexed keywords

COSINE TRANSFORMS; HIGH LEVEL LANGUAGES;

BINARY EXECUTABLES; CALL GRAPHS; DYNAMIC INFORMATION; FUNCTION CALLS; INTERPROCEDURAL SLICING; STATIC SLICING;

APPLICATION PROGRAMS;

EID: 23744431865     PISSN: 09639314     EISSN: 15731367     Source Type: Journal    
DOI: 10.1007/s11219-005-1751-x     Document Type: Review

References (30)

1. Agrawal, H. 1994. On slicing programs with jump statements, In Proc. ACM SIGPLAN Conference on Programming Languages, Design and Implementation, pp. 302-312.
2. Antoniol, G., Calzolari, F., and Tonella, P. 1999. Impact of function pointers on the call graph, In Proc. of the 3rd European Conference on Software Maintenance and Reengineering (CSMR), pp. 51-59.
3. Ball, T. and Horwitz, S. 1993. Slicing program with arbitrary control-flow, In Proc. International Workshop on Automated and Algorithmic Debugging, pp. 206-222.
4. Bergeron, J., Debbabi, M., Erhioui, M.M., and Ktari, B. 1999. Static analysis of binary code to isolate malicious behaviors, In Proc. IEEE International Workshop on Enterprise Security.
5. Beszédes, Á., Faragó, C., Szabó, Z.M., Csirik, J., and Gyimóthy, T. 2002, Union slices for program maintenance. In Proc. IEEE International Conference on Software Maintenance (ICSM 2002) pp. 12-21.
6. Beszédes, Á., Gergely, T., Szabó, Z.M., Csirik, J., and Gyimóthy, T. 2001. Dynamic slicing method for maintenance of large C programs, In Proc. Fifth European Conference on Software Maintenance and Reengineering (CSMR 2001), pp. 105-113.
7. Binkley, D. and Gallagher, K.B. 1996. Program slicing, Advances in Computers 43:1-50.
8. Canfora, G., Cimitile, A., and De Lucia, A. 1998. Conditioned program slicing, In Information and Software Technology Special Issue on Program Slicing, Vol. 40, pp. 595-607.
9. Choi, J. and Ferrante, J. 1994. Static slicing in the presence of goto statements, ACM Trans. Program. Lang. Syst. 16(4): 1097-1113.
10. Cifuentes, C. and Fraboulet, A. 1997. Intraprocedural static slicing of binary executables, In Proc. International Conference on Software Maintenance, pp. 188-195.
11. Debray, S.K., Evans, W., Muth, R., and Sutter, B.D. 2000. Compiler techniques for code compaction, ACM Trans. Program. Lang. Syst. 22(2): 378-415.
12. Ferrante, J., Ottenstein, K.J., and Warren, J.D. 1987. The program dependence graph and its use in optimization, ACM Trans. Program. Lang. Syst. 9(3): 319-349.
13. Harman, M., Binkley, D.W., and Danicic, S. 2003. Amorphous program slicing, Journal of Systems and Software 68(1):45-64.
14. Horwitz, S., Reps, T., and Binkley, D. 1990. Interprocedural slicing using dependence graphs, ACM Trans. Program. Lang. Syst. 12(1): 26-61.
15. Kiss, Á., Jász, J., Lehotai, G., and Gyimóthy, T. 2003. Interprocedural static slicing of binary executables, in Proc. Third IEEE International Workshop on Source Code Analysis and Manipulation (SCAM 2003), pp. 118-127.
16. Korel, B. and Laski, J. 1988. Dynamic program slicing, Information Processing Letters 29(2): 155-163.
17. Krinke, J. 2003. Advanced slicing of sequential and concurrent programs, Ph.D. thesis, Universität Passau.
18. Kumar, S. and Horwitz, S. 2002. Better slicing of programs with jumps and switches, In Proc. FASE 2002: Fundamental Approaches to Software Engineering.
19. Larus, J.R. and Schnarr, E. 1995. EEL: Machine-independent executable editing, ACM SIGPLAN Notices 30(6): 291-300.
20. Lee, C., Potkonjak, M., and Mangione-Smith, W.H. 1997. MediaBench: A tool for evaluating and synthesizing multimedia and communicatons Systems, In Proc. International Symposium on Microarchitecture, pp. 330-335.
21. Lengauer, T. and Tarjan, R.E. 1979. A fast algorithm for finding dominators in a flowgraph, ACM Trans. Program. Lang. Syst. 1(1): 121-141.
22. Microsoft Corporation. 1999. Microsoft portable executable and common object file format specification version 6.0. http://www.microsoft.com/hwdev/ hardware/PECOFF.asp.
23. Mock, M., Atkinson, D.C., Chambers, C., and Eggers, S.J. 2002. Improving program slicing with dynamic points-to data, In Proc. 10th ACM SIGSOFT Symposium on the Foundations of Software Engineering, pp. 71-80.
24. Ottenstein, K.J. and Ottenstein, L.M. 1984. The program dependence graph in a software development environment, In Proc. ACM SIGSOFT/SIGPLAN Software. Engineering Symposium on Practical Software Development Environments, pp. 177-184.
25. Reps, T., Horwitz, S., Sagiv, M., and Rosay, G. 1994. Speeding up slicing, In Proc. ACM SIGSOFT Symposium on the Foundations of Software Engineering, pp. 11-20.
26. Shapiro, M. and Horwitz, S. 1997. Fast and accurate flow-insensitive points-to analysis, In Proc. 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages.
27. Standard Performance Evaluation Corporation (SPEC). 2000. SPEC CINT2000 Benchmarks, http://www.spec.org/osg/cpu2000/CINT2000/.
28. Tip, F. 1995. A survey of program slicing techniques, Journal of Programming Languages 3, 121-189.
29. TIS Committee. 1995. Tool interface standard (TIS) executable and linking format (ELF) version 1.2. http: //www.x86.org/ftp/manuals/tools/elf.pdf.
30. Weiser, M. 1984. Program slicing, IEEE Trans. Software Eng. 10(4):352-357.