Sciweavers

309 search results - page 40 / 62
» Model checking transactional memories
Sort
View
FMICS
2006
Springer
14 years 1 months ago
"To Store or Not To Store" Reloaded: Reclaiming Memory on Demand
Behrmann et al. posed the question whether "To Store or Not To Store" [1] states during reachability analysis, in order to counter the effects of the well-known state spa...
Moritz Hammer, Michael Weber
DAC
2007
ACM
14 years 11 months ago
A System For Coarse Grained Memory Protection In Tiny Embedded Processors
Many embedded systems contain resource constrained microcontrollers where applications, operating system components and device drivers reside within a single address space with no...
Ram Kumar, Akhilesh Singhania, Andrew Castner, Edd...
SIGMOD
2009
ACM
137views Database» more  SIGMOD 2009»
14 years 10 months ago
Advances in flash memory SSD technology for enterprise database applications
The past few decades have witnessed a chronic and widening imbalance among processor bandwidth, disk capacity, and access speed of disk. According to Amdhal's law, the perfor...
Sang-Won Lee, Bongki Moon, Chanik Park
VLSID
2001
IEEE
129views VLSI» more  VLSID 2001»
14 years 10 months ago
Design Of Provably Correct Storage Arrays
In this paper we describe a hardware design method for memory and register arrays that allows the application of formal equivalence checking for comparing a high-level register tr...
Rajiv V. Joshi, Wei Hwang, Andreas Kuehlmann
HVC
2007
Springer
108views Hardware» more  HVC 2007»
14 years 4 months ago
How Fast and Fat Is Your Probabilistic Model Checker? An Experimental Performance Comparison
Abstract. This paper studies the efficiency of several probabilistic model checkers by comparing verification times and peak memory usage for a set of standard case studies. The s...
David N. Jansen, Joost-Pieter Katoen, Marcel Olden...