Sciweavers

47 search results - page 5 / 10
» Automatic memory reductions for RTL model verification
Sort
View
DBPL
1997
Springer
133views Database» more  DBPL 1997»
15 years 2 months ago
Automatic Verification of Transactions on an Object-Oriented Database
Abstract. In the context of the object-oriented data model, a compiletime approach is given that provides for a significant reduction of the amount of run-time transaction overhead...
David Spelt, Herman Balsters
DAC
2003
ACM
15 years 11 months ago
Power grid reduction based on algebraic multigrid principles
With the scaling of technology, power grid noise is becoming increasingly significant for circuit performance. A typical power grid circuit contains millions of linear elements, m...
Haihua Su, Emrah Acar, Sani R. Nassif
DAC
2008
ACM
15 years 11 months ago
Partial order reduction for scalable testing of systemC TLM designs
A SystemC simulation kernel consists of a deterministic implementation of the scheduler, whose specification is nondeterministic. To leverage testing of a SystemC TLM design, we f...
Sudipta Kundu, Malay K. Ganai, Rajesh Gupta
CONCUR
2008
Springer
14 years 11 months ago
Completeness and Nondeterminism in Model Checking Transactional Memories
Software transactional memory (STM) offers a disciplined concurrent programming model for exploiting the parallelism of modern processor architectures. This paper presents the firs...
Rachid Guerraoui, Thomas A. Henzinger, Vasu Singh
FMCAD
2008
Springer
14 years 11 months ago
Word-Level Sequential Memory Abstraction for Model Checking
el Sequential Memory Abstraction for Model Checking Per Bjesse Advanced Technology Group Synopsys Inc. Many designs intermingle large memories with wide data paths and nontrivial c...
Per Bjesse