Extract Method Refactoring by Successive Edge Contraction

08/13/2019
by   Omkarendra Tiwari, et al.
0

Segmentation, a new approach based on successive edge contraction is introduced for extract method refactoring. It targets identification of distinct functionalities implemented within a method. Segmentation builds upon data and control dependencies among statements to extract functionalities from code by successive contraction of edges in the Structure Dependence Graph (SDG). Three edge contractions are explored, namely structural control edge contraction, exclusive data dependence edge contraction, and sequential data dependence edge contraction. The SDG is first constructed from the program, which is then collapsed into a segment graph that captures dependence between subtasks. An intermediate representation for data and control dependencies among statements keeps the technique language independent. The approach is evaluated on four case studies, including three from the open source domain, and the findings are reported.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/27/2020

Reducing the domination number of P_3+kP_2-free graphs via one edge contraction

In this note, we consider the following problem: given a connected graph...
research
09/18/2020

Blocking total dominating sets via edge contractions

In this paper, we study the problem of deciding whether the total domina...
research
05/31/2019

Parameterization of tensor network contraction

We present a conceptually clear and algorithmically useful framework for...
research
07/20/2023

Parameterized Complexity of Biclique Contraction and Balanced Biclique Contraction

In this work, we initiate the complexity study of Biclique Contraction a...
research
02/26/2019

A Unifying Framework for Spectrum-Preserving Graph Sparsification and Coarsening

How might one "reduce" a graph? That is, generate a smaller graph that p...
research
01/14/2022

Cut query algorithms with star contraction

We study the complexity of determining the edge connectivity of a simple...
research
07/03/2023

A contraction-recursive algorithm for treewidth

Let tw(G) denote the treewidth of graph G. Given a graph G and a positiv...

Please sign up or login with your details

Forgot password? Click here to reset