A Path Dependency Graph for Verilog Program Analysis

In this paper, we present a path dependency graph for Verilog-HDL programs called path sequence. This path sequence can be used in static analysis based techniques, such as program slicing, and model abstraction as well as in functional test generation. We have implemented this graph inside a model reduction tool. It enhanced the capability of the tool without adding significant timing overhead.

[1]  Steven P. Levitan,et al.  Control / Data-Flow Analysis for VHDL Semantic Extraction , 1998, J. Inf. Sci. Eng..

[2]  Hong Peng,et al.  Model reduction based on value dependency , 2001, Proceedings 14th Annual IEEE International ASIC/SOC Conference (IEEE Cat. No.01TH8558).

[3]  Robert S. Boyer,et al.  Program Verification , 1985, J. Autom. Reason..

[4]  Luciano Baresi,et al.  Software methodologies for VHDL code static analysis based on flow graphs , 1996, Proceedings EURO-DAC '96. European Design Automation Conference with EURO-VHDL '96 and Exhibition.

[5]  Sérgio Vale Aguiar Campos,et al.  Symbolic Model Checking , 1993, CAV.

[6]  Masahiro Fujita,et al.  Program Slicing of Hardware Description Languages , 1999, CHARME.

[7]  Frank Tip,et al.  A survey of program slicing techniques , 1994, J. Program. Lang..

[8]  Stephan Merz,et al.  Model Checking , 2000 .

[9]  Jing-Yang Jou,et al.  Coverage Analysis Techniques for HDL Design Validation , 1999 .

[10]  Chris Hankin,et al.  Program analysis tools , 1998, International Journal on Software Tools for Technology Transfer.