Effective, automatic procedure extraction

Komondoor, Raghavan; Horwitz, Susan

doi:10.1109/wpc.2003.1199187

Cited by 49 publications

(34 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As another example, Komondoor and Horwitz developed a semanticspreserving procedure extraction algorithm that runs on PDGbased clones [22,23]. Finally, CCShaper [17] filters the output of CCFinder to find good candidates for the extract method and pull up method refactoring patterns.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

An empirical study of code clone genealogies

Kim

Sazawal

Notkin

et al. 2005

Proceedings of the 10th European Software Engineering Conference Held Jointly With 13th ACM SIGSOFT International Symposium on

274

149

View full text Add to dashboard Cite

It has been broadly assumed that code clones are inherently bad and that eliminating clones by refactoring would solve the problems of code clones. To investigate the validity of this assumption, we developed a formal definition of clone evolution and built a clone genealogy tool that automatically extracts the history of code clones from a source code repository. Using our tool we extracted clone genealogy information for two Java open source projects and analyzed their evolution.Our study contradicts some conventional wisdom about clones. In particular, refactoring may not always improve software with respect to clones for two reasons. First, many code clones exist in the system for only a short time; extensive refactoring of such short-lived clones may not be worthwhile if they are likely diverge from one another very soon. Second, many clones, especially long-lived clones that have changed consistently with other elements in the same group, are not easily refactorable due to programming language limitations. These insights show that refactoring will not help in dealing with some types of clones and open up opportunities for complementary clone maintenance tools that target these other classes of clones.

show abstract

Section: Related Workmentioning

confidence: 99%

“…Many efforts have focused on automatically identifying code clones [6,10,13,18,19,22,24,26,30] and on using the output of clone detection as a basis for refactoring [8,17,23]. Some methodologists have educated programmers about how to avoid or remove code clones.…”

Section: Introductionmentioning

confidence: 99%

An empirical study of code clone genealogies

Kim

Sazawal

Notkin

et al. 2005

Proceedings of the 10th European Software Engineering Conference Held Jointly With 13th ACM SIGSOFT International Symposium on

274

149

View full text Add to dashboard Cite

show abstract

“…Previous works include a wide range of techniques from code compression [10][11][12][13] to procedure abstraction [14][15][16] and dead code elimination [17].…”

Section: Related Workmentioning

confidence: 99%

“…Komondoor and Horvitz propose procedure extraction at the source code level [14,15]. Zmily and Kozyrakis propose BLISS which successfully targets reducing text space, energy use and execution time [20].…”

Section: Related Workmentioning

confidence: 99%

Profile-Driven Selective Program Loading

Ince

Hollingsworth

2010

Euro-Par 2010 - Parallel Processing

View full text Add to dashboard Cite

Abstract. Complex software systems use many shared libraries frequently composed of large off-the-shelf components. Only a limited number of functions are used from these shared libraries. Historically demand paging prevented this from wasting large amounts of memory. Many high end systems lack virtual memory and thus must load the entire shared library into each node's memory. In this paper we propose a system which decreases the memory footprint of applications by selectively loading only the used portions of the shared libraries. After profiling executables and shared libraries, our system rewrites all target shared libraries with a new function ordering and updated ELF program headers so that the loader only loads those functions that are likely to be used by a given application and includes a fallback user-level paging system to recover in the case of failures in our analysis. We present a case study that shows our system achieves more than 80% reduction in the number of pages that are loaded for several HPC applications while causing no performance overhead for reasonably long running programs.

show abstract

“…Program slicing has been applied to several stages of the reverse engineering process, such as program restructuring [4,9,10,28,31] program comprehension [14,18,28,29,30] regression testing [5] and program integration [26]. In all these applications, the important aspect of slicing is the way in which it allows the reverse engineer to extract a semantically meaningful sub-computation, based on a slicing criterion which captures the aspect of the overall computation.…”

Section: Introductionmentioning

confidence: 99%