Client Ideal Graph Visualizer

Projects > Compiler and JVM Research at JKU

The Java HotSpot™ server compiler uses a single intermediate representation in all compiler phases, called ideal graph. The tool saves snapshots of the graph during the compilation. It displays the graphs and provides filtering mechanisms based on customizable JavaScript code and regular expressions. High performance and sophisticated navigation possibilities enable the tool to handle large graphs with thousands of nodes. The tool will be part of the OpenJDK soon, but there is no release available yet.


  • Thomas Würthinger:
    Visualization of Program Dependence Graphs
    Master's thesis, Institute for System Software, Johannes Kepler University Linz, 2007.
    This thesis describes the architecture and implementation of the tool and also contains a user guide. It does not describe the final version, but is still up-to-date.
  • Thomas Würthinger, Christian Wimmer, Hanspeter Mössenböck:
    Visualization of Program Dependence Graphs
    Intl. Conf. on Compiler Construction (CC'08), LNCS 4959, pp. 193-196. Springer-Verlag, 2008. doi:10.1007/978-3-540-78791-4_13
    A short tool demonstration paper that briefly sketches the purpose and structure of the application.