Cited by 50Software Engineering ResearchSoftware Engineering Techniques and PracticesModel-Driven Software Engineering Techniques

Improving automated documentation to code traceability by combining retrieval techniques

Open access
Xiaofan Chen, Grundy, John·2011·2011 26th IEEE/ACM International Conference on Automated Software Engineering (ASE 2011)

Abstract

Documentation written in natural language and source code are two of the major artifacts of a software system. Tracking a variety of traceability links between software documentation and source code assists software developers in comprehension, efficient development, and effective management of a system. Automated traceability systems to date have been faced with a major open research challenge: how to extract these links with both high precision and high recall. In this paper we introduce an approach that combines three supporting techniques, Regular Expression, Key Phrases, and Clustering, with a Vector Space Model (VSM) to improve the performance of automated traceability between documents and source code. This combination approach takes advantage of strengths of the three techniques to ameliorate limitations of VSM. Four case studies have been used to evaluate our combined technique approach. Experimental results indicate that our approach improves the performance of VSM, increases the precision of retrieved links, and recovers more true links than VSM alone.

Integrity signals

Registry

Crossref · 10.1109/ase.2011.6100057

Cites

31 of 31 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Whyline does not scale to a program of jEdit's size, approaches like Chen/Grundy's do not support navigations per se, and few of the approaches located handle more than two disjoint topologies.

    “However, Whyline does not scale to a program of jEdit's size, approaches like Chen/Grundy's do not support navigations per se, and few of the approaches we have located handle more than two disjoint topologies.”
  • Mining approaches like Chen and Grundy's are emerging to find relationships among disjoint topologies such as documentation and source code.

    “Mining approaches like Chen and Grundy's [5] are also emerging to find relationships among disjoint topologies such as documentation and source code.”

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Chen, X., & Grundy, J.
Affiliations
  • University of Auckland (NZ)
  • Swinburne University of Technology (AU)
Venue
2011 26th IEEE/ACM International Conference on Automated Software Engineering (ASE 2011)
Publisher
IEEE
Published
2011-11
Pages
223-232
OpenAlex
W2022801033
Cited by
50
References
30
Citations by year
2025: 1 · 2023: 1 · 2022: 1 · 2021: 6 · 2020: 1 · 2019: 4 · 2018: 4 · 2017: 6 · 2016: 4 · 2015: 5 · 2014: 4 · 2013: 7 · 2012: 6
FWCI
4.08
Type
conference paper
Language
en
Open access
Licence
cc-by
Locations
  • IEEE/ACM International Conference on Automated Software Engineering (ASE) (publishedVersion)
  • Swinburne figshare (Swinburne University of Technology) (acceptedVersion)
  • Figshare (submittedVersion, cc-by)
  • Swinburne figshare (Swinburne University of Technology)
Funders
University of Auckland
Topics
  • Physical Sciences › Computer Science › Information Systems › Software Engineering Research
  • Physical Sciences › Computer Science › Information Systems › Software Engineering Techniques and Practices
  • Physical Sciences › Computer Science › Software › Model-Driven Software Engineering Techniques
Keywords
software traceability, source code, regular expressions, keyword extraction, clustering, vector space model, information retrieval, precision and recall

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review