Search-Based Software Re-Modularization: A Case Study at Adyen
Casper Schr\"oder, Adriaan van der Feltz, Annibale Panichella, and Maur\'icio Aniche

TL;DR
This paper presents a case study of applying search-based software re-modularization techniques to Adyen's large-scale code base, demonstrating scalability, practical benefits, and outlining future research challenges.
Contribution
The paper demonstrates the application of a tailored search-based re-modularization approach to a large-scale industrial code base, showing its scalability and practical value.
Findings
The approach scales to large code bases of over 5 million lines.
The algorithm improves code modularity according to selected metrics.
Developers find the recommendations valuable.
Abstract
Deciding what constitutes a single module, what classes belong to which module or the right set of modules for a specific software system has always been a challenging task. The problem is even harder in large-scale software systems composed of thousands of classes and hundreds of modules. Over the years, researchers have been proposing different techniques to support developers in re-modularizing their software systems. In particular, the search-based software re-modularization is an active research topic within the software engineering community for more than 20 years. This paper describes our efforts in applying search-based software re-modularization approaches at Adyen, a large-scale payment company. Adyen's code base has 5.5M+ lines of code, split into around hundreds of modules. We leveraged the existing body of knowledge in the field to devise our own search algorithm and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
