loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Design, Automation and Test in Europe Conference and Exhibition Volume I (DATE'04)
Paris, France
February 16-February 20
ISBN: 0-7695-2085-5
Tarvo Raudvere, Royal Institute of Technology
Ashish Kumar Singh, Royal Institute of Technology
Ingo Sander, Royal Institute of Technology
Axel Jantsch, Royal Institute of Technology
Todays integrated circuits with increasing complexity cause the well known state space explosion problem in verification tools. In order to handle this problem a much simpler abstract model of the design has to be created for verification. We introduce the polynomial abstraction technique, which efficiently simplifies the verification task of sequential design blocks whose functionality can be expressed as a polynomial. Through our technique, the domains of possible values of data input signals can be reduced. This is done in such a way that the abstract model is still valid for model checking of the design functionality in terms of the system?s control and data properties. We incorporate polynomial abstraction into the ForSyDe methodology, for the verification of clock domain design refinements.
Citation:
Tarvo Raudvere, Ashish Kumar Singh, Ingo Sander, Axel Jantsch, "Polynomial Abstraction for Verification of Sequentially Implemented Combinational Circuits," date, vol. 1, pp.10690, Design, Automation and Test in Europe Conference and Exhibition Volume I (DATE'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.