Analyzing the reliability of communication between software entities using a 3D visualization of clustered graphs

SOFTVIS 2008 - Proceedings of the 4th ACM Symposium on Software Visualization

Volumn , Issue , 2008, Pages 37-46

  Zeckzer, D ^a   Schroder L ^b   Kalcklosch R ^b   Hagen, H ^b   Klein, T ^a  

^a FRAUNHOFER IESE   (Germany)

^b University of Koblenz Landau   (Germany)

Author keywords

Force directed layout; Gossip based protocol; Software analysis; Software visualization

Indexed keywords

3-D VISUALIZATIONS; APPLICATION DOMAINS; CLUSTERED GRAPHS; COMMUNICATION LINKS; ERROR RATES; FORCE-DIRECTED LAYOUT; GOSSIP-BASED PROTOCOL; NUMBER OF COMPONENTS; SOFTWARE ANALYSIS; SOFTWARE ENTITIES; SOFTWARE SYSTEMS; SOFTWARE VISUALIZATION;

COMMUNICATION; RELIABILITY ANALYSIS; SOFTWARE RELIABILITY; THREE DIMENSIONAL COMPUTER GRAPHICS; VISUALIZATION;

QUALITY ASSURANCE;

EID: 63149146599     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1409720.1409728     Document Type: Conference Paper

References (25)

1. Aspect J. http://www.eclipse.org/aspectj. Last access: 25.03.2008.
2. BALZER, M., NOACK, A., DEUSSEN, O., AND LEWERENTZ, C. 2004. Software Landscapes: Visualizing the Structure of Large Software Systems. In VisSym 2004, Symposium on Visualization, Konstanz, Germany, May 19-21, 2004, Eurographics Association, O. Deussen, C. D. Hansen, D. A. Keim, and D. Saupe, Eds., 261-266.
3. BARBORAK, M., MALEK, M., AND DAHBURA, A. T. 1993. The Consensus Problem, in Fault-Tolerant Computing. ACM Computing Surveys 25, 2 (June), 171-220.
4. BARNES, J., AND HUT, P. 1986. A hierarchical O(N logN) force-calculation algorithm. Nature 324, 4, 446-449.
5. BATTISTA, G. D., EADES, P., TAMASSIA, R., AND TOLLIS, I. G. 1998. Graph Drawing: Algorithms for the Visualization of Graphs.
6. DWYER, T. 2005. Extending the WilmaScope 3D graph visualisation system: software demonstration. In APVis '05: proceedings of the 2005 Asia-Pacific symposium on Information visualisation, Australian Computer Society, Inc., Darlinghurst, Australia, Australia, 39-45.
7. EADES, P., AND HUANG, M. L. 2000. Navigating Clustered Graphs using Force-Directed Methods. J. Graph Algorithms and Applications: Special Issue on Selected Papers from 1998 Symp. Graph Drawing 4, 3, 157-181.
8. EADES, P. A. 1984. A heuristic for graph drawing. In Congressus Numerantium, vol. 42, 149-160.
9. EIGLSPERGER, M., KAUFMANN, M., AND SIEBENHALLER, M. 2003. A topology-shape-metrics approach for the automatic layout of UML class diagrams. In SoftVis '03: Proceedings of the 2003 ACM symposium on Software visualization, ACM, New York, NY, USA, 189-ff.
10. FENG, Q. 1997. Algorithms for Drawing Clustered Graphs. PhD thesis, The University of Newcastle, Australia.
11. FRICK, A., LUDWIG, A., AND MEHLDAU, H. 1994. A Fast Adaptive Layout Algorithm for Undirected Graphs. In Proc. DIMACS Int. Work. Graph Drawing, GD, Springer-Verlag, Berlin, Germany, R. Tamassia and I. G. Tollis, Eds., no. 894, 388-403.
12. FRUCHTERMAN, T. M. J., AND REINGOLD, E. M. 1991. Graph Drawing by Force-directed Placement. Software - Practice and Experience 21, 11, 1129-1164.
13. GAJER, P., GOODRICH, M. T., AND KOBOUROV, S. G. 2004. A multi-dimensional approach to force-directed layouts of large graphs. Computational Geometry 29, 1, 3-18.
14. GUTWENGER, C., JÜNGER, M., KLEIN, K., KUPKE, J., LEIPERT, S., AND MUTZEL, P. 2003. A new approach for visualizing UML class diagrams. In SoftVis '03: Proceedings of the 2003 ACM symposium on Software visualization, ACM, New York, NY, USA, 179-188.
15. HAREL, D., AND KOREN, Y. 2002. A Fast Multi-Scale Algorithm for Drawing Large Graphs. Journal of Graph Algorithms and Applications 6, 3, 179-202.
16. KALCKLÖSCH, R., AND LIGGESMEYER, P. 2006. Communication test for object-oriented systems using gossiped data (fast abstract). In First Workshop on Model-Based Testing MOTES'06, INFORMATIK 2006 - Informatik fr Menschen, Band 2, volume P-94 of Lecture Notes in Informatics, Series of the Gesellschaft fr Informatik, C. Hochberger and R. Liskowsky, Eds., 282-283.
17. KUHL, J. G., AND REDDY, S. M. 1980. Distributed fault-tolerance for large multiprocessor systems. In ISCA '80: Proceedings of the 7th Annual Symposium on Computer Architecture, ACM Press, New York, NY, USA, La Baule, United States, 23-30.
18. PARKER, G., FRANCK, G., AND WARE, C. 1998. "visualization of large nested graphs in 3d: Navigation and interaction". Journal of Visual Languages and Computing 9, 3, 299-317.
19. PREPARATA, F. P., METZE, G., AND CHIEN, R. T. 1967. On the Connection Assignment Problem of Diagnosable Systems. IEEE Transactions on Electronic Computers EC-16, 6 (December), 848-854.
20. QUIGLEY, A., AND EADES, P. 2001. FADE: Graph Drawing, Clustering, and Visual Abstraction. In GD '00: Proceedings of the 8th International Symposium on Graph Drawing, Springer-Verlag, London, UK, 197-210.
21. RITTER, J. 1990. An efficient bounding sphere. In Graphics Gems. Academic Press Professional, Inc., San Diego, CA, USA, 301-303.
22. SPRENGER, T. C., BRUNELLA, R., AND GROSS, M. H. 2000. H-BLOB: A Hierarchical Visual Clustering Method Using Implicit Surfaces. In VISUALIZATION '00: Proceedings of the 11th IEEE Visualization 2000 Conference (VIS 2000), IEEE Computer Society, Washington, DC, USA.
23. WALSHAW, C. 2003. A Multilevel Algorithm for Force-Directed Graph Drawing. J. Graph Algorithms Appl. 7, 3, 253-285.
24. WARE, C., AND FRANCK, G. 1996. Evaluating stereo and motion cues for visualizing information nets in three dimensions. ACM Trans. Graph. 15, 2, 121-140.
25. WARE, C., AND MITCHELL, P. 2005. Reevaluating stereo and motion cues for visualizing graphs in three dimensions. In APGV '05: Proceedings of the 2nd symposium on Applied perception in graphics and visualization, ACM, New York, NY, USA, 51-58.