Displaying dependence graphs: a hierarchical approach
Journal of Software Maintenance and Evolution: Research and Practice
A brief survey of program slicing
ACM SIGSOFT Software Engineering Notes
Visualization of program dependence graphs
CC'08/ETAPS'08 Proceedings of the Joint European Conferences on Theory and Practice of Software 17th international conference on Compiler construction
ColSpace: towards algorithm/implementation co-optimization
ICCD'09 Proceedings of the 2009 IEEE international conference on Computer design
Edutainment'10 Proceedings of the Entertainment for education, and 5th international conference on E-learning and games
Security framework to verify the low level implementation codes
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part II
| Hi-index | 0.00 |
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.