Improving the Effectiveness of Traceability Link Recovery using Hierarchical Bayesian Networks
Not on the map. Why?
Abstract (arXiv)
Traceability is a fundamental component of the modern software development process that helps to ensure properly functioning, secure programs. Due to the high cost of manually establishing trace links, researchers have developed automated approaches that draw relationships between pairs of textual software artifacts using similarity measures. However, the effectiveness of such techniques are often limited as they only utilize a single measure of artifact similarity and cannot simultaneously model (implicit and explicit) relationships across groups of diverse development artifacts. In this paper, we illustrate how these limitations can be overcome through the use of a tailored probabilistic model. To this end, we design and implement a HierarchiCal PrObabilistic Model for SoftwarE Traceability (Comet) that is able to infer candidate trace links. Comet is capable of modeling relationships between artifacts by combining the complementary observational prowess of multiple measures of textual similarity. Additionally, our model can holistically incorporate information from a diverse set of sources, including developer feedback and transitive (often implicit) relationships among groups of software artifacts, to improve inference accuracy. We conduct a comprehensive empirical evaluation of Comet that illustrates an improvement over a set of optimally configured baselines of ≈14% in the best case and ≈5% across all subjects in terms of average precision. The comparative effectiveness of Comet in practice, where optimal configuration is typically not possible, is likely to be higher. Finally, we illustrate Comets potential for practical applicability in a survey with developers from Cisco Systems who used a prototype Comet Jenkins plugin.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). First posted on arXiv 18 May 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 1; 2024: 1; 2025: 2; 2026: 1.
5 papers.
- 2023Benchmarking Causal Study to Interpret Large Language Models for Source Codecited by 14
- 2025LinkAnchor: An Autonomous LLM-Based Agent for Issue-to-Commit Link Recoverycited by 2
- 2024Lost in Transmission: An Information-Theoretic Account of Unsupervised Software Traceabilitycited by 0
- 2025Natural Language-Programming Language Software Traceability Link Recovery Needs More than Textual Similaritycited by 0
- 2026Towards Comprehensive Benchmarking Infrastructure for LLMs In Software Engineeringcited by 0
- 2026Towards Comprehensive Benchmarking Infrastructure for LLMs In Software Engineering28 Jan 2026
- 2025Natural Language-Programming Language Software Traceability Link Recovery Needs More than Textual Similarity6 Sep 2025
- 2025LinkAnchor: An Autonomous LLM-Based Agent for Issue-to-Commit Link Recovery17 Aug 2025
- 2024Lost in Transmission: An Information-Theoretic Account of Unsupervised Software Traceability6 Dec 2024
- 2023Benchmarking Causal Study to Interpret Large Language Models for Source Code23 Aug 2023