Sciweavers

Share
7 search results - page 1 / 2
» Design Of Provably Correct Storage Arrays
Sort
View
VLSID
2001
IEEE
129views VLSI» more  VLSID 2001»
11 years 2 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
CHES
2011
Springer
240views Cryptology» more  CHES 2011»
9 years 2 months ago
Lightweight and Secure PUF Key Storage Using Limits of Machine Learning
A lightweight and secure key storage scheme using silicon Physical Unclonable Functions (PUFs) is described. To derive stable PUF bits from chip manufacturing variations, a lightwe...
Meng-Day (Mandel) Yu, David M'Raïhi, Richard ...
MSS
1999
IEEE
118views Hardware» more  MSS 1999»
10 years 6 months ago
Designing a Self-Maintaining Storage System
This paper shows the suitability of a "self-maintaining" approach to Tertiary Disk, a large-scale disk array system built from commodity components. Instead of incurring...
Satoshi Asami, Nisha Talagala, David A. Patterson
CCGRID
2005
IEEE
10 years 8 months ago
Increasing distributed storage survivability with a stackable RAID-like file system
We have designed a stackable file system called Redundant Array of Independent Filesystems (RAIF). It combines the data survivability properties and performance benefits of trad...
Nikolai Joukov, Abhishek Rai, Erez Zadok
PLDI
2011
ACM
9 years 5 months ago
Data representation synthesis
We consider the problem of specifying combinations of data structures with complex sharing in a manner that is both declarative lts in provably correct code. In our approach, abst...
Peter Hawkins, Alex Aiken, Kathleen Fisher, Martin...
books