Sciweavers

229 search results - page 6 / 46
» How Efficient Can Memory Checking Be
Sort
View
CADE
2007
Springer
14 years 8 months ago
Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
Viktor Kuncak, Martin C. Rinard
CAV
2003
Springer
154views Hardware» more  CAV 2003»
14 years 26 days ago
Structural Symbolic CTL Model Checking of Asynchronous Systems
In previous work, we showed how structural information can be used to efficiently generate the state-space of asynchronous systems. Here, we apply these ideas to symbolic CTL model...
Gianfranco Ciardo, Radu Siminiceanu
CORR
2010
Springer
119views Education» more  CORR 2010»
13 years 5 months ago
Using Information Theory to Study the Efficiency and Capacity of Computers and Similar Devices
We address the problems of estimating the computer efficiency and the computer capacity. We define the computer efficiency and capacity and suggest a method for their estimation, ...
Boris Ryabko
DAC
1998
ACM
14 years 8 months ago
Functional Vector Generation for HDL Models Using Linear Programming and 3-Satisfiability
Abstract-Our strategy for automatic generation of functional vectors is based on exercising selected paths in the given hardware description language (HDL) model. The HDL model des...
Farzan Fallah, Srinivas Devadas, Kurt Keutzer
PLDI
1996
ACM
13 years 11 months ago
Static Detection of Dynamic Memory Errors
Many important classes of bugs result from invalid assumptions about the results of functions and the values of parameters and global variables. Using traditional methods, these b...
David Evans