131 search results - page 14 / 27 » The Complexity of Online Memory Checking |
SBMF
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. This paper presents a case study on retrospective veri cation of the Linux Virtual File System (VFS), which is aimed at checking for violations of API usage rules and mem...
ICALP
1994
Springer
15 years 1 months ago
1994
Springer
We introduce a formal framework to study the time and space complexity of computing with faulty memory. For the fault-free case, time and space complexities were studied using the...
106
click to vote
GECCO
2008
Springer
14 years 10 months ago
2008
Springer
Probabilistic model building methods can render difficult problems feasible by identifying and exploiting dependencies. They build a probabilistic model from the statistical prope...
ICCAD
2001
IEEE
15 years 6 months ago
2001
IEEE
— Modern sub-micron VLSI designs include huge power grids that are required to distribute large amounts of current, at increasingly lower voltages. The resulting voltage drop on ...
PARLE
1987
1987
Emulating Digital Logic using Transputer Networks (very High Parallelism = Simplicity = Performance)
15 years 1 months ago
Modern VLSI technology has changed the economic rules by which the balance between processing power, memory and communications is decided in computing systems. This will have a pr...