ACM Home Page
Please provide us with feedback. Feedback
Recovering and using use-case-diagram-to-source-code traceability links
Full text PdfPdf (465 KB)
Source
Foundations of Software Engineering archive
Proceedings of the the 6th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering table of contents
Dubrovnik, Croatia
SESSION: Development processes and tools table of contents
Pages: 95 - 104  
Year of Publication: 2007
ISBN:978-1-59593-811-4
Authors
Mark Grechanik  Accenture Technology Labs, Chicago, IL
Kathryn S. McKinley  University of Texas at Austin, Austin, TX
Dewayne E. Perry  University of Texas at Austin, Austin, TX
Sponsors
ACM: Association for Computing Machinery
SIGSOFT: ACM Special Interest Group on Software Engineering
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 16,   Downloads (12 Months): 109,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1287624.1287640
What is a DOI?

ABSTRACT

Use case diagrams (UCDs) are widely used to describe requirements and desired functionality of software products. However, UCDs are loosely linked to source code, and maintaining traces between the source code and elements of UCDs is a manual, tedious, and laborious process. These traces help programmers to understand code that they maintain and evolve.

Our contribution is twofold. First, we offer a novel approach for automating part of the process of recovering traceability links (TLs) between types and variables in Java programs and elements of UCDs. We evaluate our prototype implementation on open-source and commercial software, and the results suggest that our approach can recover many TLs with a high degree of automation and precision.

Second, we developed an Eclipse plugin that enables programmers to trace program types and variables to elements of UCDs and vice versa using recovered TLs. We conducted a case study that shows that programmers could maintain and evolve software more efficiently with our plugin. These results demonstrate that modest programmer effort to create TLs together with automated program mining and analysis is a promising approach than can increase program understanding while reducing programmer burden.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Private conversations with IBM Rational, ETrade, GE, Bank of New York, and Bank of America employees.
 
2
 
3
 
4
 
5
 
6
7
 
8
W. W. Cohen and H. Hirsh. Joins that generalize: Text classification using WHIRL. In KDD, pages 169--173, 1998.
 
9
 
10
 
11
12
 
13
 
14
R. Michalski and G. Tecuci. Machine Learning: A Multistrategy Approach. Morgan Kaufmann, February 1994.
15
 
16
 
17
18
19
 
20
 
21

Collaborative Colleagues:
Mark Grechanik: colleagues
Kathryn S. McKinley: colleagues
Dewayne E. Perry: colleagues