loading...
Efficient Microprocessor Verification using Antecedent Conditioned Slicing
Bangalore, India January 06-January 10
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/VLSID.2007.7020th International Conference on VLSI ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Shobha Vasudevan, University of Texas at Austin
Vinod Viswanath, Intel Corporation Austin, TX
Jacob A. Abraham, University of Texas at Austin

We present a technique for automatic verification of pipelined microprocessors using model checking. An- tecedent conditioned slicing is an efficient abstraction tech- nique for hardware designs at the Register Transfer Level (RTL). Antecedent conditioned slicing prunes the verifica- tion state space, using information from the antecedent of a given LTL property. In this work, we model instructions of a pipelined processor as LTL properties, such that the instruc- tion opcode forms the antecedent. We use antecedent condi- tioned slicing to decompose the problem space of pipelined processor verification on an instruction-wise basis. We pass the resulting smaller, tractable problems through a lower level verification engine.

We thereby verify that every instruction behaves accord- ing to the specification and ensure that non-target registers are not modified by the instruction. We use the SMV model checker to verify all the instruction classes of a Verilog RTL implementation of the OR1200, an off-the-shelf pipelined processor.

Citation:
Shobha Vasudevan, Vinod Viswanath, Jacob A. Abraham, "Efficient Microprocessor Verification using Antecedent Conditioned Slicing," vlsid, pp.43-49, 20th International Conference on VLSI Design held jointly with 6th International Conference on Embedded Systems (VLSID'07), 2007
Usage of this product signifies your acceptance of the Terms of Use.