Sciweavers

903 search results - page 60 / 181
» Completeness Results for Memory Logics
Sort
View
ARC
2006
Springer
124views Hardware» more  ARC 2006»
14 years 15 days ago
A Flexible Multi-port Caching Scheme for Reconfigurable Platforms
Abstract. Memory accesses contribute sunstantially to aggregate system delays. It is critical for designers to ensure that the memory subsystem is designed efficiently, and much wo...
Su-Shin Ang, George A. Constantinides, Peter Y. K....
LOPSTR
2001
Springer
14 years 1 months ago
Proof Theory, Transformations, and Logic Programming for Debugging Security Protocols
In this paper we define a sequent calculus to formally specify, simulate, debug and verify security protocols. In our sequents we distinguish between the current knowledge of prin...
Giorgio Delzanno, Sandro Etalle
MLQ
2002
83views more  MLQ 2002»
13 years 8 months ago
Pseudomonadic Algebras as Algebraic Models of Doxastic Modal Logic
We generalize the notion of a monadic algebra to that of a pseudomonadic algebra. In the same way as monadic algebras serve as algebraic models of epistemic modal system S5, pseudo...
Nick Bezhanishvili
ATS
2009
IEEE
127views Hardware» more  ATS 2009»
14 years 1 months ago
On the Generation of Functional Test Programs for the Cache Replacement Logic
Caches are crucial components in modern processors (both stand-alone or integrated into SoCs) and their test is a challenging task, especially when addressing complex and high-fre...
Wilson J. Perez, Danilo Ravotto, Edgar E. Sá...
SOSP
2009
ACM
14 years 5 months ago
Better I/O through byte-addressable, persistent memory
Modern computer systems have been built around the assumption that persistent storage is accessed via a slow, block-based interface. However, new byte-addressable, persistent memo...
Jeremy Condit, Edmund B. Nightingale, Christopher ...