Visualizing and Analyzing Software Infrastructures

  title={Visualizing and Analyzing Software Infrastructures},
  author={A. Buchsbaum and Y. Chen and H. Huang and E. Koutsofios and J. Mocenigo and Anne Rogers and M. Jankowsky and S. Mancoridis},
  journal={IEEE Softw.},
Companies frequently need to redesign their software infrastructures in response to marketplace changes, but they must do so carefully so that the new architecture will not disrupt existing operations or increase operating costs unnecessarily. To support these goals, system architects have long recognized the need to build a repository of information about all of their company's systems and their interfaces. Using this information, architects create system interface diagrams to help them study… Expand
The need for software modifications especially during the maintenance phase, is inevitable and remains the most costly. A major problem to software maintainers is that seemingly small changes canExpand
Automatic Identification of Reusable Software Development Assets: Methodology and Tool
This paper presents a tool that implements an Automatic Identification of Software Components (AISC), an approach that brings to light what companies have already developed by applying reuse indicators with sophisticated mechanisms to identify artifacts that can be considered as reusable assets. Expand
On the automatic modularization of software systems using the Bunch tool
A case study is presented to demonstrate how Bunch can be used to create views of the structure of significant software systems and research is outlined to evaluate the software clustering results produced by Bunch. Expand
genDMG: A Generic Graph Representation Layout to Visualize Existing Software Artifacts
A document-like and modularized software visualization method called generic DocLike Modularized Graph (genDMG) that employs a graph drawing technique to represent software artifacts written either in structured or object-oriented. Expand
Validation of Information Systems Using Petri Nets
A rule-based technique to convert UML state diagrams to Object Coloured Petri (OCP) nets is presented, which makes Petri nets ideally suitable for dynamic analysis of UML modelled information systems. Expand
Towards More Flexibility in Software Visualization Tools
  • Thorsten Schäfer, M. Mezini
  • Computer Science
  • 3rd IEEE International Workshop on Visualizing Software for Understanding and Analysis
  • 2005
A case is made for a layered software visualization framework, which exposes flexibility to customize the visualization technique, layout, and appearance, and enable users to aggregate and filter information based on various attributes. Expand
Reengineering reports
  • H. Sneed
  • Computer Science
  • 11th Working Conference on Reverse Engineering
  • 2004
This contribution to the subject of software reengineering is focused on the reengineering of legacy system reports. The object is to extract the contents of existing print files for the purpose ofExpand
Supporting system development by novice software engineers using a tutor-based software visualization (TubVis) approach
TubVis is proposed, a tutor-based software visualization approach in SoVis tool that analyses software artefacts pertaining to software engineering best practices inputted by the experts and generate a set of recommendations regarding the design and coding for a novices. Expand
Documenting software systems with views III: towards a task-oriented classification of program visualization techniques
Preliminary work towards a task-oriented classification of program visualization techniques is described, which divides the visualization techniques into three classes (static, interactive, and editable) based on the level of end-user interaction with the generated graphical documentation. Expand
Visualization Techniques for Program Comprehension - A Literature Review
This document tries to identify the essential requirements of a software visualization component and presents the most relevant and significant ones. Expand


Bunch: a clustering tool for the recovery and maintenance of software system structures
  • S. Mancoridis, B. Mitchell, Y. Chen, E. Gansner
  • Computer Science
  • Proceedings IEEE International Conference on Software Maintenance - 1999 (ICSM'99). 'Software Maintenance for Business Change' (Cat. No.99CB36360)
  • 1999
A clustering tool called Bunch is developed that creates a system decomposition automatically by treating clustering as an optimization problem and a feature that enables the integration of designer knowledge about the system structure into an otherwise fully automatic clustering process is described. Expand
Ciao: a graphical navigator for software and document repositories
Ciao is a graph-based navigator that helps programmers query and browse structural connections embedded in different software and document repositories and linked program difference databases and modification request databases so that users can investigate the connections between MRs and affected entities. Expand
A C++ data model supporting reachability analysis and dead code detection
The design rationales behind a data model for a C++ software repository that supports reachability analysis and dead code detection at the declaration level are examined and how future software repositories can be evaluated for completeness at a selected abstraction level is illustrated. Expand
Chava: reverse engineering and tracking of Java applets
Chava is presented, a system that analyzes and tracks changes in Java applets and is used to compare several Java Development Kit (JDK) versions to help spot changes that might impact Java developers. Expand
Grappa: A GRAPh PAckage in Java
A new version of Improvise, a multimedia process modeling environment, was written on top of Grappa, an extensible graph drawing package written in Java that provides an application programming interface on topof which Web-based applications that need to visualize information in terms of graphs can be built. Expand
A fast algorithm for finding dominators in a flowgraph
A fast algorithm for finding dominators in a flowgraph is presented, which beat the straightforward algorithm and the bit vector algorithm on all but the smallest graphs tested. Expand
A new, simpler linear-time dominators algorithm
A new linear-time algorithm to find the immediate dominators of all vertices in a flowgraph is presented, which combines the use of microtrees and memoization with new observations on a restricted class of path compressions. Expand
A Technique for Drawing Directed Graphs
A four-pass algorithm for drawing directed graphs is presented, which creates good drawings and is fast. Expand
Graph Drawing: Algorithms for the Visualization of Graphs
  • N.J
  • 1999
For more information on this or any other computing topic, please visit our Digital Library at http://computer/publications/dlib
  • For more information on this or any other computing topic, please visit our Digital Library at http://computer/publications/dlib