Interactive And Dynamic Search Based Approach To Software Refactoring Recommendations
AssigneeThe Regents of the University of Michigan
InventorsMarouane KESSENTINI, Vahid ALIZADEH, Mohamed Wiem MKAOUER
Life of this patent
Estimating the term…
Loading patent…
AssigneeThe Regents of the University of Michigan
InventorsMarouane KESSENTINI, Vahid ALIZADEH, Mohamed Wiem MKAOUER
Estimating the term…
Refactoring improves he software design while preserving overall functionality and behavior, and is an important technique in managing the growing complexity of software systems. This disclosure introduces an interactive way to refactor software systems using innovization and interactive dynamic multi-objective optimization. The interactive approach supports the adaption of refactoring solutions based on developer feedback while also taking into account other code changes that the developer may have performed in parallel with the refactoring activity.
A computer-implemented method for refactoring software, comprising:
The computer-implemented method 1 further comprises identifying a given candidate solution by calculating a composite ranking score for each candidate solution in the set of candidate solutions, where the composite ranking score is calculated by computing a ranking score for each refactor operation in a given candidate solution based upon frequency of the refactor operation across the set of candidate solution and summing the ranking score for each refactor operation in the given candidate solution to yield the composite ranking score, such that the particular candidate solution is the candidate solution having highest composite ranking score in the set of candidate solutions.
A computer-implemented method for refactoring software, comprising:
The computer-implemented method 11 further comprises identifying a given candidate solution by calculating a composite ranking score for each candidate solution in the set of candidate solutions, where the composite ranking score is calculated by computing a ranking score for each refactor operation in a given candidate solution based upon frequency of the refactor operation across the set of candidate solution and summing the ranking score for each refactor operation in the given candidate solution to yield the composite ranking score, such that the particular candidate solution is the candidate solution having highest composite ranking score in the set of candidate solutions.
A computer-implemented method for refactoring software, comprising:
Dependencies are inferred from the claim text.