UML formalization is a traceability problem

  • Authors:

  • R. E. K. Stirewalt;Min Deng;Betty H. C. Cheng

  • Affiliations:

  • Michigan State University, East Lansing, MI;Michigan State University, East Lansing, MI;Michigan State University, East Lansing, MI

  • Venue:
  • TEFSE '05 Proceedings of the 3rd international workshop on Traceability in emerging forms of software engineering
  • Year:
  • 2005

Quantified Score

Hi-index 0.01

Visualization

Abstract

Largely driven by the widespread interest in using UML, significant efforts have investigated how to formalize its semantics in terms of well-defined target languages. Associating target language specifications with the UML models enables automated analysis of its many graphical diagrams. Unfortunately, UML formalizations have proved difficult to completely automate. This paper posits that UML formalization is essentially a traceability problem, which means to rigorously link elements of a given UML diagram to relevant regions of code in a given target model according to the intended formalization semantics. We present a graph-theoretic model for formally defining this link-retrieval problem. We also introduce a framework for assessing whether a UML formalization is amenable to efficient link retrieval techniques without sacrificing precision and/or recall.