Referenced Items are not available for this document.
To handle today's complexity, modern circuits and systems have to be specified at a high level of abstraction. Recently, SystemC has been proposed as a language that allows a fast simulation on a high level of abstraction and an efficient realization on RTL. To guarantee the correct behavior of a design, a concise verification methodology has to be developed. We present the first formal verification approach for SystemC that allows to prove the correctness of properties specified in linear temporal logic (LTL). In contrast to simulation-based techniques, completeness can be ensured. Our proof engine is based on symbolic manipulation, and a case study of a scalable bus arbiter shows the efficiency of the approach.
Published in:
Circuits and Systems, 2003. ISCAS '03. Proceedings of the 2003 International Symposium on
(Volume:5
)
Date of Conference: 25-28 May 2003
- Page(s):
- V-245 - V-248 vol.5
- Print ISBN:
- 0-7803-7761-3
- INSPEC Accession Number:
- 7762778
- Digital Object Identifier :
- 10.1109/ISCAS.2003.1206243
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
