Software architecture abstraction and aggregation as algebraic manipulations

Authors:
Richard C. Holt
Affiliations:
Dept. of Computer Science, University of Waterloo, Waterloo ON N2L 3G1 Canada
Venue:
CASCON '99 Proceedings of the 1999 conference of the Centre for Advanced Studies on Collaborative research
Year:
1999

Citing 7
Cited 4

The C Information Abstraction System

IEEE Transactions on Software Engineering
Architecture and applications of the Hy+ visualization system

IBM Systems Journal
A relational approach to support software architecture analysis

Software—Practice & Experience
The software bookshelf

IBM Systems Journal
Realtion-Algebraic Analysis of Petri Nets with RELVIEW

TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Structural Manipulations of Software Architecture Using Tarski Relational Algebra

WCRE '98 Proceedings of the Working Conference on Reverse Engineering (WCRE'98)
View Extraction and View Fusion in Architectural Understanding

ICSR '98 Proceedings of the 5th International Conference on Software Reuse

Wins and Losses of Algebraic Transformations of Software Architectures

Proceedings of the 16th IEEE international conference on Automated software engineering
Advanced widgets for Eclipse

eclipse '04 Proceedings of the 2004 OOPSLA workshop on eclipse technology eXchange
Assisting potentially-repetitive small-scale changes via semi-automated heuristic search

Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering
A towards an extended relational algebra for software architecture

ACM SIGSOFT Software Engineering Notes

Quantified Score

Hi-index	0.00

Visualization

Abstract

The structure of a large system can be made comprehensible if it can be viewed as a modest number of interacting entities. For example, the 800,000 line Linux kernel can be reasonably viewed as its five top-level interconnected subsystems. Each abstracted entity (subsystem) may have aggregated attributes, e.g., the total count of the number of lines of code in it, or the set of programmers who have worked on it. Given that the software architecture of the system is represented as a typed graph, both abstraction (ignoring details inside subsystems) and aggregation (collecting selected internal information) can be specified as algebraic manipulations. Our approach, based on Tarski relational algebra, allows direct execution of these abstraction and aggregation specifications by means of a relational calculator.