Effective, automatic procedure extraction

Proceedings - IEEE Workshop on Program Comprehension

Volumn 2003-May, Issue , 2003, Pages 33-42

  Komondoor, R ^a   Horwitz, S ^a  

^a UNIVERSITY OF WISCONSIN MADISON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; EXTRACTION; SEMANTICS;

AUTOMATIC APPROACHES; AUTOMATIC EXTRACTION; AUTOMATIC PROCEDURES; LEGACY CODE; NONLOCAL; PROCEDURE CALL;

ALGORITHMS;

EID: 84978946107     PISSN: 10928138     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WPC.2003.1199187     Document Type: Conference Paper

References (24)

1. E. Ashcroft and Z. Manna. The translation of 'go to' programs to 'while' programs. In Proc. Inf. Processing '71, pages 250-255. North-Holland Publishing Company, 1972.
2. B. Baker. On finding duplication and near-duplication in large software systems. In Proc. IEEE Working Conf. on Reverse Eng., pages 86-95, July 1995.
3. T. Ball and S. Horwitz. Slicing programs with arbitrary control flow. In Lecture Notes in Computer Science, volume 749, pages 206-222. Springer-Verlag, 1993.
4. S. Bates and S. Horwitz. Incremental program testing using program dependence graphs. In Proc. ACM Symp. on Principles of Prog. Langs., pages 384-396, Jan. 1993.
5. R. Bowdidge and W. Griswold. Supporting the restructuring of data abstractions through manipulation of a program visualization. ACM Trans. on Software Eng. and Methodology, 7(2):109-157, Apr. 1998.
6. J. Choi and J. Ferrante. Static slicing in the presence of goto statements. ACM Trans. on Prog. Langs. and Systems, 16(4):1097-1113, July 1994.
7. K. Cooper and N. McIntosh. Enhanced code compression for embedded RISC processors. In Proc. ACM Conf. on Prog. Lang. Design and Impl., pages 139-149, May 1999.
8. S. Debray, W. Evans, R. Muth, and B. DeSutter. Compiler techniques for code compaction. ACM Trans. on Prog. Langs. and Systems, 22(2):378-415, Mar. 2000.
9. M. Fowler. Refactoring - Improving the design of existing code. Addison Wesley Longman, Reading, Mass., 1999.
10. W. Griswold and D. Notkin. Automated assistance for program restructuring. ACM Trans. on Software Eng. and Methodology, 2(3):228-269, July 1993.
11. R. Komondoor and S. Horwitz. Semantics-preserving procedure extraction. In Proc. ACM Symp. on Principles of Prog. Langs., pages 155-169, Jan. 2000.
12. R. Komondoor and S. Horwitz. Using slicing to identify duplication in source code. In Proc. Int. Symp. on Static Analysis, pages 40-56, July 2001.
13. K. Kontogiannis, R. Demori, E. Merlo, M. Galler, and M. Bernstein. Pattern matching for clone and concept detection. Automated Software Eng., 3(1-2):77-108, 1996.
14. D. Kuck, R. Kuhn, D. Padua, B. Leasure, and M. Wolfe. Dependence graphs and compiler optimizations. In Proc. ACM Symp. on Principles of Prog. Langs., pages 207-218, Jan. 1981.
15. S. Kumar and S. Horwitz. Better slicing of programs with jumps and switches. In Proc. Fundamental Approaches to Software Eng., pages 96-112, Apr. 2002.
16. B. Lague, D. Proulx, J. Mayrand, E. Merlo, and J. Hudepohl. Assessing the benefits of incorporating function clone detection in a development process. In Int. Conf. on Software Maintenance, pages 314-321, 1997.
17. A. Lakhotia and J. Deprez. Restructuring programs by tucking statements into functions. Inf. and Software Technology, 40(11-12):677-689, Nov. 1998.
18. F. Lanubile and G. Visaggio. Extracting reusable functions by flow graph-based program slicing. IEEE Trans. on Software Eng., 23(4):246-258, Apr. 1997.
19. S. Letovski and E. Soloway. Delocalized plans and program comprehension. IEEE Software, pages 198-204, May 1986.
20. G. Oulsnam. Unravelling unstructured programs. The Computer Journal, 25(3):379-387, Aug. 1982.
21. S. Rugaber, K. Stirewalt, and L. Wills. Understanding interleaved code. Automated Software Eng., 3(1-2):47-76, June 1996.
22. H. Sneed and G. Jandrasics. Software recycling. In Proc. Conf. Software Maintenance, pages 82-90, 1987.
23. V. Waddle and A. Malhotra. An E log E line crossing algorithm for leveled graphs. In Lecture Notes in Computer Science, volume 1731, pages 59-71. Springer-Verlag, 1999.
24. M. Zastre. Compacting object code via parameterized procedural abstraction. Master's thesis, Department of Computer Science, University of Victoria, British Columbia, 1995.