Holt, R. C., and Mancoridis, S. Using Tube Graphs to Model Architectural Designs of Software Systems. Tech. Rep. CSRI-308, Computer Science Research Institute, University of Toronto, October 1994. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Recovering the Structure of Software Systems Using Tube.. - Mancoridis, Holt (1996) (1 citation) Self-citation (Holt Mancoridis) (Correct)
....tube graph, ffl jTj is the number of tubes in the tube graph, ffl height is the height of the tube graph containment tree, jVj in the worst case. The worst case complexity of each of the following algorithms depends on the complexity of the primitive operations. 1 It has been shown elsewhere [8], that the worst case complexity of all primitive operations is constant O(1) Algorithm 1: Invalid Tube Boolean function invalidTube checks if an ill formed tube cannot become well formed by adding other tubes to the graph. This situation occurs when the tube is a loop or the tube vertices are ....
Holt, R. C., and Mancoridis, S. Using Tube Graphs to Model Architectural Designs of Software Systems. Tech. Rep. CSRI-308, Computer Science Research Institute, University of Toronto, October 1994.
Algorithms for Managing the Evolution of Software Designs - Spiros Mancoridis Self-citation (Holt Mancoridis) (Correct)
....Production 5 simply makes nonterminal containment edges terminal. We need two kinds of non terminals for containment edges because ill formed tube graphs can be generated by a grammar that allows containment edges to be expanded after they have been connected to tube edges. In a technical report [5] we present proofs that grammar G generates all well formed tube graphs and nothing more, that is WF(TG) TG 2 L(G) Thus far we have explained the kind of software designs we are interested in, and have showed how these designs can be mapped into tube graphs. Next, we describe several ....
.... y vertexOfIthIncomingTube(x,i) if par(x) 6= par(y) then addTube(y,par(x) end if deleteTube(y,x) end for removeChild(par(x) x) end deleteVertex Other algorithms for adding and removing entire sub trees (representing subsystems) of a tube graph have been described in a technical report [5]. This technical report also discusses the computational complexity of the algorithms presented in this paper along with a set of data structures for implementing tube graphs efficiently. 5 Conclusions and Future Work We showed that software designs can be mapped to mathematical structures ....
Holt, R. C., and Mancoridis, S. Using Tube Graphs to Model Architectural Designs of Software Systems. Tech. Rep. CSRI-308, Computer Science Research Institute, University of Toronto, October 1994.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC