|
Published Articles >> Table of Contents >> Abstract
16th IEEE International Conference on Automated Software Engineering (ASE'01)
p. 51
Wins and Losses of Algebraic Transformations of Software Architectures
H. M. Fahmy, University of Waterloo
R. C. Holt, University of Waterloo
J. R. Cordy, Queen’s University
Full Article Text:
  
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ASE.2001.989790
Send link to a friend
| Abstract |
|
In order to understand, analyze and modify software, we
commonly examine and manipulate its architecture. For
example, we may want to examine the architecture at
different levels of abstraction. We can view such
manipulations as architectural transformations, and more
specifically, as graph transformations. In this paper, we
evaluate relational algebra as a way of specifying and
automating the architectural transformations.
Specifically, we examine Grok, a relational calculator
that is part of the PBS toolkit. We show that relational
algebra is practical in that we are able to specify many of
the transformations commonly occurring during software
maintenance and, using a tool like Grok, we are able to
manipulate, quite efficiently, large software graphs; this
is a "win". However, this approach is not well suited to
express some types of transforms involving patterns of
edges and nodes; this is a "loss". By means of a set of
examples, the paper makes clear when the approach wins
and when it loses.
|
 Additional Information
|
Index Terms- software architecture, software maintenance,
graph transformation, relational algebra
Citation:
H. M. Fahmy, R. C. Holt, J. R. Cordy,
"Wins and Losses of Algebraic Transformations of Software Architectures,"
ase,
p. 51,
16th IEEE International Conference on Automated Software Engineering (ASE'01),
2001
|
|
