4

[2107.08699] Detecting Oxbow Code in Erlang Codebases with the Highest Degree of...

 2 years ago
source link: https://arxiv.org/abs/2107.08699
Go to the source link to view the article. You can view the picture content, updated content and better typesetting reading experience. If the link is broken, please click the button below to view the snapshot at that time.

[Submitted on 19 Jul 2021]

Detecting Oxbow Code in Erlang Codebases with the Highest Degree of Certainty

Download PDF

The presence of source code that is no longer needed is a handicap to project maintainability. The larger and longer-lived the project, the higher the chances of accumulating dead code in its different forms.
Manually detecting unused code is time-consuming, tedious, error-prone, and requires a great level of deep knowledge about the codebase. In this paper, we examine the kinds of dead code (specifically, oxbow code) that can appear in Erlang projects, and formulate rules to identify them with high accuracy.
We also present an open-source static analyzer that implements these rules, allowing for the automatic detection and confident removal of oxbow code in Erlang codebases, actively contributing to increasing their quality and maintainability.

Comments: 13 pages, 1 figure, 2 tables Subjects: Software Engineering (cs.SE) MSC classes: 68-04 ACM classes: D.2.9 DOI: 10.1145/3471871.3472961 Cite as: arXiv:2107.08699 [cs.SE]   (or arXiv:2107.08699v1 [cs.SE] for this version)

About Joyk


Aggregate valuable and interesting links.
Joyk means Joy of geeK