Displaying dependence graphs: a hierarchical approach
Displaying dependence graphs: a hierarchical approach
复制标题
显示依赖图：分层方法
DOI：
10.1109/wcre.2001.957830
复制
发表时间：
2001
期刊：
影响因子：
--
通讯作者：
Françoise Balmas
中科院分区：
文献类型：
--
作者：
Françoise Balmas
我们提出了一种方法来处理数据和控制流信息，表示为简化的系统依赖图。一旦一个程序超过几十行代码，它的依赖图就变得无法用标准绘图工具读取，因为它包含了太多的节点和边。在我们的方法中，我们建议将程序分解成一个层次结构的群体，很可能是可管理的大小。我们实现了一个工具，它首先构建这个层次结构并将其存储在数据库中。然后，图形界面允许浏览该层次结构以可视化每个组的依赖性，注释节点或组，并可能细化所提出的层次结构。本文介绍了我们的方法程序分解，它描述了我们的依赖探索工具，并讨论了我们得到的一些示例程序的初步结果。
We present a method to handle data- and control-flow information, represented as simplified system dependence graphs. As soon as a program is bigger than a few dozens of lines of code, its dependence graph becomes unreadable with standard drawing tools, since it contains far too many nodes and edges. In our approach, we propose to decompose the program into a hierarchy of groups that are likely to be of manageable size. We implemented a tool that first builds this hierarchy and stores it in a data base. A graphical interface allows then to browse this hierarchy to visualize the dependences of each group, to annote the nodes or groups and possibly to refine the proposed hierarchy. This paper introduces our approach for program decomposition, it describes our tool for dependence exploration and discusses the preliminary results we obtained with a few sample programs.