Discovering the input assumptions in specification refinement coverage
Pages 13 - 18
Abstract
The design of a large chip is typically hierarchical - large modules are recursively expanded into a collection of sub-modules. Each expansion refines the design due to the addition of level specific details. We believe that a similar approach is necessary to scale the capacity of formal property verification technology - as the design gets refined from one level to another, the formal specification must also be refined to reflect the level specific design decisions. At the heart of this approach we propose a checker that identifies the input assumptions under which the refined specification "covers" the original specification. This enables the validation engineer to focus the verification effort on the remaining input scenarios thereby reducing the number of target coverage points for simulation.
References
[1]
E. M. Clarke, O. Grumberg, and D. A. Peled, Model checking, MIT Press, 2000.
[2]
S. Das, P. Basu, A. Banerjee, P. Dasgupta, P. P. Chakrabarti, C. R. Mohan, L. Fix, R. Armoni, "Formal verification coverage: computing the cover-age gap between temporal specifications," In Proc. of ICCAD, 198--203, 2004.
[3]
A. Pnueli, "The temporal logics of programs," In Proc. of FOCS, 46--57, 1977.
[4]
A. Biere, A. Cimatti, E. M. Clarke, M. Fujita, Y. Zhu, "Symbolic model checking using SAT procedures instead of BDDs," In Proc. of DAC, 1999.
[5]
ARM AMBA specification rev 2.0, http://www.arm.com/
Index Terms
- Discovering the input assumptions in specification refinement coverage
Recommendations
Specification, Refinement and Verification of Concurrent Systems—An Integration of Object-Z and CSP
This paper presents a method of formally specifying, refining and verifying concurrent systems which uses the object-oriented state-based specification language Object-Z together with the process algebra CSP. Object-Z provides a convenient way of ...
On the verification of VDM specification and refinement with PVS
ASE '97: Proceedings of the 12th international conference on Automated software engineering (formerly: KBSE)Although the formal method VDM has been in existence since the 1970s, there are still no satisfactory tools to support verification in VDM. The paper deals with one possible means of approaching this problem by using the PVS theorem-prover. It describes ...
Comments
Information & Contributors
Information
Published In
Sponsors
- IEEE Circuits and Systems Society
- SIGDA: ACM Special Interest Group on Design Automation
- IEICE ESS: Institute of Electronics, Information and Communication Engineers, Engineering Sciences Society
- IPSJ SIG-SLDM: Information Processing Society of Japan, SIG System LSI Design Methodology
Publisher
IEEE Press
Publication History
Published: 24 January 2006
Check for updates
Qualifiers
- Article
Acceptance Rates
Overall Acceptance Rate 466 of 1,454 submissions, 32%
Upcoming Conference
ASPDAC '25
- Sponsor:
- sigda
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 96Total Downloads
- Downloads (Last 12 months)1
- Downloads (Last 6 weeks)0
Reflects downloads up to 14 Jan 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in