Cited By
View all- Chauhan PGoyal DHasteer GMathur ASharma N(2009)Non-cycle-accurate sequential equivalence checkingProceedings of the 46th Annual Design Automation Conference10.1145/1629911.1630033(460-465)Online publication date: 26-Jul-2009
Construction of concrete verification models from C++
Authors: 
Malay Haldar, Gagandeep Singh, Saurabh Prabhakar, Basant Dwivedi, Antara GhoshAuthors Info & Claims
Malay Haldar, Gagandeep Singh, Saurabh Prabhakar, Basant Dwivedi, Antara GhoshAuthors Info & ClaimsPages 942 - 947
Abstract
C++ based verification methodologies are now emerging as the preferred method for SOC design. However most of the verification involving the C++ models are simulation based. The challenge of using C++ for sequential equivalence checking comes from two aspects (1) Language constructs such as pointers, polymorphism, virtual methods, dynamic memory allocation, dynamic loop bounds, floating points pose difficulty in creating a model suitable for equivalence checking (2) The memory and runtime required for creating models suitable for equivalence checking from practical C++ designs is huge.
In this paper we describe techniques for constructing verification models from C++ designs containing a very rich set of language constructs. The flow is built keeping in mind that formal methods are inherently capacity constrained but need to be applied to large C++ designs to have practical value.
References
[1]
T. Ball, R. Majumdar, T. Millstein, and S. K. Rajamani. Automatic Predicate Abstraction of C Programs. In Conference on Programming Language Design and Implementation, pages 203--213, 2001.
[2]
L. Semeria, Koichi Sato, and G. De Micheli. Synthesis of Hardware Models in C With Pointers and Complex Data Structures. IEEE Transaction on VLSI, 9(6), December 2001.
[3]
S. H. Yong and S. Horwitz. Pointer Range Analysis. In Intl. Static Analysis Symposium, pages 133--148, 2004.
[4]
E. Clarke, D. Kroening, and K. Yorav. Behavioral Consistency of C and Verilog Programs Using Bounded Model Checking. In Design Automation Conference, pages 368--371, 2003.
[5]
A. Chou Y. Xie and D. Engler. ARCHER: Using Symbolic, Path-senstive Analysis to Detect Memory Access Errors. In 11th ACM SIGSOFT Intl. Symp. on Foundations of Software Engineering, pages 327--336, 2003.
[6]
A. Koelbl and C. Pixley. Constructing efficient formal models from high-level descriptions using symbolic simulation. Intl. Journal of Parallel Programming, 33(6): 645--666, 2005.
[7]
Virtual method table. http://en.wikipedia.org/wiki/Virtualtable.
[8]
J. Hauser. Softfloat. http://www.jhauser.us/arithmetic/SoftFloat.html.
Index Terms
- Construction of concrete verification models from C++
Recommendations
Survey on Formal Verification Methods for Digital IC
ICICSE '09: Proceedings of the 2009 Fourth International Conference on Internet Computing for Science and EngineeringThis paper presents a survey of the state-of-art of formal verification technique. The expression models for formal verification are introduced and analyzed. The characteristics of each model are expounded. Moreover, the typical model checking ...
An integrated environment for HDL verification
IVC '95: Proceedings of the 4th IEEE International Verilog HDL ConferenceThe functional verification of a digital design is an expensive step in the design process. As designs become more complex, simulation is challenged throughout the design and verification process, both at the low level (implementation verification), to ...
Formal Verification of Digital Systems
VLSID '97: Proceedings of the Tenth International Conference on VLSI Design: VLSI in Multimedia ApplicationsA formal verifier is an automated decision procedure that can prove or disprove a set of statements in some logical system of reasoning. Problems informal verification have been posed and studied in a variety of disciplines for many years. However the ...
Comments
Information & Contributors
Information
Published In
Copyright © 2008 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
- The EDA Consortium
- IEEE/CASS/CANDE/CEDA
- SIGDA: ACM Special Interest Group on Design Automation
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 08 June 2008
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
DAC '08
Sponsor:
Acceptance Rates
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
- 150Total Downloads
- Downloads (Last 12 months)1
- Downloads (Last 6 weeks)0
Reflects downloads up to
Other Metrics
Citations
Cited By
View all- Chauhan PGoyal DHasteer GMathur ASharma N(2009)Non-cycle-accurate sequential equivalence checkingProceedings of the 46th Annual Design Automation Conference10.1145/1629911.1630033(460-465)Online publication date: 26-Jul-2009
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