Compiling Verilog into timed finite state machines

The lack of formal semantics for HDLs has made it hard to make a formal bridge between simulation tools based on HDLs and synthesis/verification tools based on finite state machines. We address the problem of finding a larger subset of Verilog HDL (which includes timing constructs) and a systematic way of extracting FSMs from programs built using the subset. Using timed FSMs as the target language for HDL compilation gives us two potential advantages. First, FSMs can be used to model systems that do not have hardware implementation. Second, FSMs can be used to model systems that are implementable but not automatically synthesizable.

[1]  Felice Balarin,et al.  Verilog HDL Modeling Styles for Formal Verification , 1993, CHDL.

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

[3]  Daniel D. Gajski,et al.  Design Methodology for High-Level Synthesis , 1992 .

[4]  Minh N. Do,et al.  Youn-Long Steve Lin , 1992 .

[5]  Alfred V. Aho,et al.  Compilers: Principles, Techniques, and Tools , 1986, Addison-Wesley series in computer science / World student series edition.

[6]  Szu-Tsung Cheng,et al.  HSIS: A BDD-Based Environment for Formal Verification , 1994, 31st Design Automation Conference.

[7]  Donald E. Thomas,et al.  The Verilog® Hardware Description Language , 1990 .

[8]  Szu-Tsung Cheng,et al.  Compiling Verilog into Automata , 1994 .

[9]  Charles N. Fischer,et al.  Crafting a Compiler , 1988 .