ACM Home Page
Please provide us with feedback. Feedback
A hybrid verification approach: getting deep into the design
Full text PdfPdf (93 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 39th annual Design Automation Conference table of contents
New Orleans, Louisiana, USA
SESSION: Formal verification table of contents
Pages: 111 - 116  
Year of Publication: 2002
ISBN ~ ISSN:0738-100X , 1-58113-461-4
Authors
Scott Hazelhurst  University of the Witwatersrand, Johannesburg, South Africa
Osnat Weissberg  Intel Corporation, Haifa, Israel
Gila Kamhi  Intel Corporation, Haifa, Israel
Limor Fix  Intel Corporation, Haifa, Israel
Sponsor
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 12,   Citation Count: 5
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/513918.513948
What is a DOI?

ABSTRACT

One method of handling the computational complexity of the verification process is to combine the strengths of different approaches. We propose a hybrid verification technology combining symbolic trajectory evaluation with either symbolic model checking or SAT-based model checking. This reduces significantly the cost (both human and computing) of verifying circuits with complex initialisation, as well as simplifying proof development by enhancing verification productivity. The approach has been tested on current Intel designs.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
3
4
 
5
 
6
 
7
 
8
S. Hazelhurst. On Parametric and Characteristic Representations of State Spaces. Technical Report 2002-1, School of Computer Science, University of the Witwatersrand, March 2002. Available as ftp://ftp.cs.wits.ac.za/pub/research/reports/TR-Wits-CS-2002-1.ps.gz.
 
9
 
10
P. Jain and G. Gopalakrishnan. Efficient symbolic simulation-based verification using the parametric form of boolean expressions. IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, 13(8):1005--1015, August 1994.
 
11
 
12
13
 
14
J. Yang and C.-J.H. Seger. Introduction to generalized symbolic trajectory evaluation. In Proc. of ICCD, September 2001.
 
15


Collaborative Colleagues:
Scott Hazelhurst: colleagues
Osnat Weissberg: colleagues
Gila Kamhi: colleagues
Limor Fix: colleagues