Opti Code Pro: A Heuristic Search-based Approach to Code Refactoring

Sourena Khanzadeh, Samad Alias Nyein Chan, Richard Valenzano, Manar Alalfi
5/12/2023
cs.SEcs.AI

No confident code implementation found for this paper. 3 possible matches can be shown below.

Abstract

This paper presents an approach that evaluates best-first search methods to code refactoring. The motivation for code refactoring could be to improve the design, structure, or implementation of an existing program without changing its functionality. To solve a very specific problem of coupling and cohesion, we propose using heuristic search-based techniques on an approximation of the full code refactoring problem, to guide the refactoring process toward solutions that have high cohesion and low coupling. We evaluated our approach by providing demonstrative examples of the effectiveness of this approach on random state problems and created a tool to implement the algorithm on Java projects.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 3 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{khanzadeh2023opti,
  title  = {Opti Code Pro: A Heuristic Search-based Approach to Code Refactoring},
  author = {Sourena Khanzadeh and Samad Alias Nyein Chan and Richard Valenzano and Manar Alalfi},
  year   = {2023},
  eprint = {2305.07594},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2305.07594v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2305.07594.svg)](https://codeofpaper.com/paper/2305.07594)

Discussion