TRIAD: Automated Traceability Recovery based on Biterm-enhanced Deduction of Transitive Links among Artifacts

• URL: http://arxiv.org/abs/2312.16854v2
• Date: Wed, 17 Jan 2024 01:24:52 GMT
• Title: TRIAD: Automated Traceability Recovery based on Biterm-enhanced Deduction of Transitive Links among Artifacts
• Authors: Hui Gao, Hongyu Kuang, Wesley K. G. Assun\c{c}\~ao, Christoph Mayr-Dorn, Guoping Rong, He Zhang, Xiaoxing Ma, Alexander Egyed
• Abstract summary: Traceability allows stakeholders to extract and comprehend the trace links among software artifacts introduced across the software life cycle. Most rely on textual similarities among software artifacts, such as those based on Information Retrieval (IR)
• Score: 53.92293118080274
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Traceability allows stakeholders to extract and comprehend the trace links among software artifacts introduced across the software life cycle, to provide significant support for software engineering tasks. Despite its proven benefits, software traceability is challenging to recover and maintain manually. Hence, plenty of approaches for automated traceability have been proposed. Most rely on textual similarities among software artifacts, such as those based on Information Retrieval (IR). However, artifacts in different abstraction levels usually have different textual descriptions, which can greatly hinder the performance of IR-based approaches (e.g., a requirement in natural language may have a small textual similarity to a Java class). In this work, we leverage the consensual biterms and transitive relationships (i.e., inner- and outer-transitive links) based on intermediate artifacts to improve IR-based traceability recovery. We first extract and filter biterms from all source, intermediate, and target artifacts. We then use the consensual biterms from the intermediate artifacts to extend the biterms of both source and target artifacts, and finally deduce outer and inner-transitive links to adjust text similarities between source and target artifacts. We conducted a comprehensive empirical evaluation based on five systems widely used in other literature to show that our approach can outperform four state-of-the-art approaches, and how its performance is affected by different conditions of source, intermediate, and target artifacts. The results indicate that our approach can outperform baseline approaches in AP over 15% and MAP over 10% on average.

Related papers

• AVIATE: Exploiting Translation Variants of Artifacts to Improve IR-based Traceability Recovery in Bilingual Software Projects [14.643142867163748]
  Traceability plays a vital role in facilitating various software development activities. The IR (Information Retrieval)-based approaches leverage textual similarity to measure the likelihood of traces between artifacts. The globalization of software development has introduced new challenges, such as the possible multilingualism on the same concept.
  arXiv  Detail & Related papers  (2024-09-28T10:21:37Z)
• FASER: Binary Code Similarity Search through the use of Intermediate Representations [0.8594140167290099]
  Cross-Architecture Binary Code Similarity Search has been explored in numerous studies. We propose Function as a String Encoded Representation (FASER) to create a model capable of cross architecture function search.
  arXiv  Detail & Related papers  (2023-10-05T15:36:35Z)
• OTIEA:Ontology-enhanced Triple Intrinsic-Correlation for Cross-lingual Entity Alignment [12.054806502375575]
  Cross-lingual and cross-domain knowledge alignment without sufficient external resources is a fundamental and crucial task. This paper proposes a novel universal EA framework (OTIEA) based on ontology pair and role enhancement mechanism via triple-aware attention. The experimental results on three real-world datasets show that our framework achieves a competitive performance compared with baselines.
  arXiv  Detail & Related papers  (2023-05-02T16:03:54Z)
• Modeling Multi-Granularity Hierarchical Features for Relation Extraction [26.852869800344813]
  We propose a novel method to extract multi-granularity features based solely on the original input sentences. We show that effective structured features can be attained even without external knowledge.
  arXiv  Detail & Related papers  (2022-04-09T09:44:05Z)
• SAIS: Supervising and Augmenting Intermediate Steps for Document-Level Relation Extraction [51.27558374091491]
  We propose to explicitly teach the model to capture relevant contexts and entity types by supervising and augmenting intermediate steps (SAIS) for relation extraction. Based on a broad spectrum of carefully designed tasks, our proposed SAIS method not only extracts relations of better quality due to more effective supervision, but also retrieves the corresponding supporting evidence more accurately.
  arXiv  Detail & Related papers  (2021-09-24T17:37:35Z)
• Combining Feature and Instance Attribution to Detect Artifacts [62.63504976810927]
  We propose methods to facilitate identification of training data artifacts. We show that this proposed training-feature attribution approach can be used to uncover artifacts in training data. We execute a small user study to evaluate whether these methods are useful to NLP researchers in practice.
  arXiv  Detail & Related papers  (2021-07-01T09:26:13Z)
• Cross-Domain Facial Expression Recognition: A Unified Evaluation Benchmark and Adversarial Graph Learning [85.6386289476598]
  We develop a novel adversarial graph representation adaptation (AGRA) framework for cross-domain holistic-local feature co-adaptation. We conduct extensive and fair evaluations on several popular benchmarks and show that the proposed AGRA framework outperforms previous state-of-the-art methods.
  arXiv  Detail & Related papers  (2020-08-03T15:00:31Z)
• Improving the Effectiveness of Traceability Link Recovery using Hierarchical Bayesian Networks [21.15456830607455]
  We implement a HierarchiCal PrObabilistic Model for SoftwarE Traceability (Comet) Comet is capable of modeling relationships between artifacts by combining the complementary observational prowess of multiple measures of textual similarity. We conduct a comprehensive empirical evaluation of Comet that illustrates an improvement over a set of optimally configured baselines.
  arXiv  Detail & Related papers  (2020-05-18T19:38:29Z)
• Universal Source-Free Domain Adaptation [57.37520645827318]
  We propose a novel two-stage learning process for domain adaptation. In the Procurement stage, we aim to equip the model for future source-free deployment, assuming no prior knowledge of the upcoming category-gap and domain-shift. In the Deployment stage, the goal is to design a unified adaptation algorithm capable of operating across a wide range of category-gaps.
  arXiv  Detail & Related papers  (2020-04-09T07:26:20Z)
• A Dependency Syntactic Knowledge Augmented Interactive Architecture for End-to-End Aspect-based Sentiment Analysis [73.74885246830611]
  We propose a novel dependency syntactic knowledge augmented interactive architecture with multi-task learning for end-to-end ABSA. This model is capable of fully exploiting the syntactic knowledge (dependency relations and types) by leveraging a well-designed Dependency Relation Embedded Graph Convolutional Network (DreGcn) Extensive experimental results on three benchmark datasets demonstrate the effectiveness of our approach.
  arXiv  Detail & Related papers  (2020-04-04T14:59:32Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.