J4 ›› 2014, Vol. 41 ›› Issue (2): 79-84.doi: 10.3969/j.issn.1001-2400.2014.02.013

• Original Articles • Previous Articles     Next Articles

Symbolic model checking of Verilog programs with the propositional projection temporal logic

PANG Tao1,2;DUAN Zhenhua1,2;LIU Xiaofang1,2   

  1. (1. Research Inst. of Computing Theory & Technology, Xidian Univ., Xi'an  710071, China;
    2. State Key Lab. of Integrated Service Networks, Xidian Univ., Xi'an  710071, China)
  • Received:2013-06-07 Online:2014-04-20 Published:2014-05-30
  • Contact: PANG Tao E-mail:t_pang@126.com

Abstract:

To insure the correctness of the system on chip(SoC) designed in the Verilog hardware description language,a symbolic model checking methodology for Verilog programs is proposed. With this methodology,the Verilog program to be verified is modeled as a finite-state machine with respect to its formal operational semantics,while the design specifications are expressed in propositional projection temporal logic(PPTL) formulas. Whether the SoC satisfies its specifications or not can be determined with the symbolic model checker proposed in our previous work. A case of a 4-bit synchronous binary counting system described in Verilog programs is studied to illustrate the feasibility of this methodology.

Key words: temporal logic, symbolic model checking, hardware description language, system on chip verification

CLC Number: 

  • TP301