We design the rst eecient parallel algorithm for computing the minimal elimination ordering (MEO) of an arbitrary graph. The algorithm works in O(log 3 n) parallel time and O(nm) processors on a CREW PRAM, for an n-vertex, m-edge graph, and is optimal up to a polylogarithmic factor with respect to the best sequential algorithm of Rose, Tarjan and Lueker ((RTL 76]). The MEO problem for arbitrary...

Being a commonly used technique to enrich the software structure, refactoring – as well as any software changes performed every day – still lacks a good formal definition. Especially in the distributed environment there is a great need for a better mechanism allowing to avoid conflicts and properly merge the changes introduced by different developers. In this paper we continue our project of a ...

This thesis presents a prototype application generation tool, SAGE (SeaBank Application Generation Environment), that demonstrates how the Unified Modeling Language (UML) can be used as a domain specific application generation language for component or framework-based software development. The UML-based extensible CASE tool, Rational Rose, was extended to create SAGE for developing applications...

In previous works, the authors introduced a framework for software analysis, which is based on optimization of Lyapunov invariants. These invariants prove critical software properties such as absence of overflow and termination in finite time. In this paper, graph models of software are introduced and the software analysis framework is further developed and extended on graph models. A distribut...

This paper represents a technique for recovering the Software Architecture based on Graph Pattern Matching by the help of mining techniques. Generally Software Architecture is represented in terms of graphs with set of vertices and edges. Finding the frequent data sets is the major step in the software architecture recovery. Many algorithms are proposed in this context, for example Apriori base...

Scenario diagrams are useful for helping software developers to understand the interactions among the components of a software system. In this paper, we present a semiautomatic approach to extracting scenarios from the implementation of a software system. In our approach, the source code of a software system is represented as a graph and scenarios are specified as graph patterns. A relational c...

We consider only finite undirected graphs without loops or multiple edges. Notation or terms not defined here can be found in [1]. Let G be a graph and let S £; V( G). The subgraph (S) induced by S is the graph with vertex set Sand Whose edge set consists of those edges of G incident with two vertices of S. The distance d(u, v) between vertices u and v in a connected graph G is the minimum numb...

This paper describes the FADE paradigm for visualization and a series of experiments for the fast layout, abstract representation, and measurement of software views. In program comprehension, graph models are typically used to represent relational information, where the visualization of such graphs is referred to as graph drawing. Here we present the results of an investigation into efficient t...