Cited By
View all- Roy SArts HBanerjee PYasuura H(1998)PowerDriveProceedings of the 1998 IEEE/ACM international conference on Computer-aided design10.1145/288548.289094(601-606)Online publication date: 1-Nov-1998
An efficient assertion checker for combinational properties
Pages 734 - 739
Abstract
Formally verifying properties of signals in a circuit hasseveral applications in an equivalence checking based formalverification flow.In a hierarchical design, functionalityis divided across blocks.This necessitates the useof constraints on input signals of a block to avoid falsenegatives.Validating such input constraints requires assertionchecking at the outputs of modules generatingthe constrained signals.In this paper, we present anefficient assertion checker for combinational propertieswhich avoids the BDD explosion problem by finding anoptimal intermediate correlation free frontier.It hasbeen successfully used in an industrial setting to uncovera number of bugs.
References
[1]
K. L. McMillan, "Fitting formal methods into the design cycle," 31st Design Automation Conference, pp. 314-319, May 1994.
[2]
Y. Matsunaga, "An efficient equivalence checker for combinational circuits," 33rd Design Automation Conference, pp. 629-634, May 1996.
[3]
S. M. Reddy, W. Kunz, and D. K. Pradhan, "Novel verification framework combining structural and obdd methods in a synthesis environment," 32nd Design A utomation Conference, pp. 414-419, June 1995.
[4]
R. E. Bryant, "Binary decision diagrams and beyond: Enabling technologies for formal verification," 32nd Design Automation Conference, pp. 236-243, June 1995.
[5]
C. L. Berman and L. H. Trevillyan, "Functional comparison of logic design for VLSI circuits," International Conference on Computer Aided Design, pp. 456-459, Nov. 1989.
[6]
R. E. Bryant, "Graph-based algorithms for boolean function manipulation," IEEE Transactions on Computers, pp. 677-691, Aug. 1986.
[7]
G. Hasteer, A. Mathur, and P. Banerjee, "PropCheck: An assertion checker for functional properties," tech. rep., Department of Electrical and Computer Engineering, Northwestern University, Evanston, 1997.
[8]
I. Radivojevic and F. Brewer, "A new symbolic technique for control-dependent scheduling," IEEE Transactions on Computer Aided Design, pp. 45-57, Jan. 1996.
Index Terms
- An efficient assertion checker for combinational properties
Recommendations
Automata-based assertion-checker synthesis of PSL properties
Assertion-based verification with languages such as PSL is gaining in importance. From assertions, one can generate hardware assertion checkers for use in emulation, simulation acceleration and silicon debug. We present techniques for checker ...
Efficient Generation of Monitor Circuits for GSTE Assertion Graphs
ICCAD '03: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided designGeneralized symbolic trajectory evaluation (GSTE) is a powerful,new method for formal verification that combines the industrially-proven scalability and capacity of classical symbolic trajectory evaluation with the expressive power of temporal-logic ...
The software model checker Blast: Applications to software engineering
Blast is an automatic verification tool for checking temporal safety properties of C programs. Given a C program and a temporal safety property, Blast either statically proves that the program satisfies the safety property, or provides an execution path ...
Comments
Information & Contributors
Information
Published In
June 1997
788 pages
Copyright © 1997 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
- EDAC: Electronic Design Automation Consortium
- SIGDA: ACM Special Interest Group on Design Automation
- IEEE-CAS: Circuits & Systems
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 13 June 1997
Check for updates
Qualifiers
- Article
Conference
DAC97
Sponsor:
- EDAC
- SIGDA
- IEEE-CAS
Acceptance Rates
DAC '97 Paper Acceptance Rate 139 of 400 submissions, 35%;
Overall Acceptance Rate 1,770 of 5,499 submissions, 32%
Upcoming Conference
DAC '25
- Sponsor:
- sigda
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 74Total Downloads
- Downloads (Last 12 months)54
- Downloads (Last 6 weeks)14
Reflects downloads up to 06 Nov 2024
Other Metrics
Citations
Cited By
View all- Roy SArts HBanerjee PYasuura H(1998)PowerDriveProceedings of the 1998 IEEE/ACM international conference on Computer-aided design10.1145/288548.289094(601-606)Online publication date: 1-Nov-1998
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in