A system for graph-based visualization of the evolution of software

ABSTRACT

We describe GEVOL, a system that visualizes the evolution of software using a novel graph drawing technique for visualization of large graphs with a temporal component. GEVOL extracts information about a Java program stored within a CVS version control system and displays it using a temporal graph visualizer. This information can be used by programmers to understand the evolution of a legacy program: Why is the program structured the way it is? Which programmers were responsible for which parts of the program during which time periods? Which parts of the program appear unstable over long periods of time and may need to be rewritten? This type of information will complement that produced by more static tools such as source code browsers, slicers, and static analyzers.

REFERENCES

• 1: Thomas Ball , Stephen G. Eick, Software Visualization in the Large, Computer, v.29 n.4, p.33-43, April 1996 [doi>10.1109/2.488299]
• 2: Rachel Harrison , Martin Shepperd , John W. Daly, Process modelling and empirical studies of software evolution (workshop), Proceedings of the 19th international conference on Software engineering, p.675, May 17-23, 1997, Boston, Massachusetts, United States [doi>10.1145/253228.253829]
• 3: Ulrik Brandes , Dorothea Wagner, A Bayesian Paradigm for Dynamic Graph Layout, Proceedings of the 5th International Symposium on Graph Drawing, p.236-247, September 18-20, 1997
• 4: Marc H. Brown, Exploring Algorithms Using Balsa-II, Computer, v.21 n.5, p.14-36, May 1988 [doi>10.1109/2.56]
• 5: BROWN, M. H. 1992. Zeus: A system for algorithm animation and multi-view editing. Tech. Rep. 75, 28.
• 6: S. R. Chidamber , C. F. Kemerer, A Metrics Suite for Object Oriented Design, IEEE Transactions on Software Engineering, v.20 n.6, p.476-493, June 1994 [doi>10.1109/32.295895]
• 7: R. F. Cohen , G. Di Battista , R. Tamassia , I. G. Tollis , P. Bertolazzi, A framework for dynamic graph drawing, Proceedings of the eighth annual symposium on Computational geometry, p.261-270, June 10-12, 1992, Berlin, Germany [doi>10.1145/142675.142728]
• 8: Robert F. Cohen , Giuseppe Di Battista , Roberto Tamassia , Ioannis G. Tollis, Dynamic Graph Drawings: Trees, Series-Parallel Digraphs, and Planar ST-Digraphs, SIAM Journal on Computing, v.24 n.5, p.970-1001, Oct. 1995 [doi>10.1137/S0097539792235724]
• 9: COLLBERG, C., 2003. Sandmark: A tool for the study of software protection algorithms. http://www.cs.arizona.edu/sandmark.
• 10: Stephan Diehl , Carsten Görg, Graphs, They Are Changing, Revised Papers from the 10th International Symposium on Graph Drawing, p.23-30, August 26-28, 2002
• 11: EADES, P. 1984. A heuristic for graph drawing. Congressus Numerantium 42, 149--160.
• 12: S. G. Eick , T. L. Graves , A. F. Karr , A. Mockus , P. Schuster, Visualizing Software Changes, IEEE Transactions on Software Engineering, v.28 n.4, p.396-412, April 2002 [doi>10.1109/TSE.2002.995435]
• 13: Thomas M. J. Fruchterman , Edward M. Reingold, Graph drawing by force-directed placement, Software—Practice & Experience, v.21 n.11, p.1129-1164, Nov. 1991 [doi>10.1002/spe.4380211102]
• 14: Pawel Gajer , Stephen G. Kobourov, GRIP: Graph dRawing with Intelligent Placement, Proceedings of the 8th International Symposium on Graph Drawing, p.222-228, September 20-23, 2000
• 15: Pawel Gajer , Michael T. Goodrich , Stephen G. Kobourov, A Multi-dimensional Approach to Force-Directed Layouts of Large Graphs, Proceedings of the 8th International Symposium on Graph Drawing, p.211-221, September 20-23, 2000
• 16: Maurice H. Halstead, Elements of Software Science (Operating and programming systems series), Elsevier Science Inc., New York, NY, 1977
• 17: HENRY, S., AND KAFURA, D. 1981. Software structure metrics based on information flow. IEEE Transactions on Software Engineering 7, 5 (Sept.), 510--518.
• 18: KAMADA, T., AND KAWAI, S. 1988. Automatic display of network structures for human understanding. Tech. Rep. 88-007, Department of Information Science, University of Tokyo.
• 19: T. Kamada , S. Kawai, An algorithm for drawing general undirected graphs, Information Processing Letters, v.31 n.1, p.7-15, April 1989 [doi>10.1016/0020-0190(89)90102-6]
• 20: MCCABE, T. J. 1976. A complexity measure. IEEE Transactions on Software Engineering 2, 4 (Dec.), 308--320.
• 21: MOCKUS, A., EICK, S., GRAVES, T., AND KARR, A., 1999. On measurement and analysis of software changes.
• 22: Sven Moen, Drawing Dynamic Trees, IEEE Software, v.7 n.4, p.21-28, July 1990 [doi>10.1109/52.56447]
• 23: B. A. Myers, Visual programming, programming by example, and program visualization: a taxonomy, Proceedings of the SIGCHI conference on Human factors in computing systems, p.59-66, April 13-17, 1986, Boston, Massachusetts, United States
• 24: MYERS, B. A. 1990. Taxonomies of visual programming and program visualization. Journal of Visual Languages and Computing 1, 1 (Mar.), 97--123.
• 25: Stephen C. North, Incremental Layout in DynaDAG, Proceedings of the Symposium on Graph Drawing, p.409-418, September 20-22, 1995
• 26: OVIEDO, E. I. 1980. Control flow, data flow, and program complexity. In Proceedings of IEEE COMPSAC, 146--152.
• 27: PRICE, B. A., SMALL, I. S., AND BAECKER, R. M. 1992. A taxonomy of software visualization. In Proc. 25th Hawaii Int. Conf. System Sciences.
• 28: Gruia-Catalin Roman , Kenneth C. Cox, A Taxonomy of Program Visualization Systems, Computer, v.26 n.12, p.11-24, December 1993 [doi>10.1109/2.247643]
• 29: M.-A. D. Storey , K. Wong , F. D. Fracchia , H. A. Mueller, On Integrating Visualization Techniques for Effective Software Exploration, Proceedings of the 1997 IEEE Symposium on Information Visualization (InfoVis '97), p.38, October 18-25, 1997
• 30: Christopher M. B. Taylor , Malcolm Munro, Revision Towers, Proceedings of the 1st International Workshop on Visualizing Software for Understanding and Analysis, p.43, June 26-26, 2002
• 31: YOUNG, P., AND MUNRO, M., 1997. A new view of call graphs for visualising code structures.