Sciweavers

903 search results - page 69 / 181
» Completeness Results for Memory Logics
Sort
View
JANCL
2006
105views more  JANCL 2006»
13 years 8 months ago
BDD-based decision procedures for the modal logic K
We describe BDD-based decision procedures for the modal logic K. Our approach is inspired by the automata-theoretic approach, but we avoid explicit automata construction. Instead, ...
Guoqiang Pan, Ulrike Sattler, Moshe Y. Vardi
SIGCOMM
1996
ACM
14 years 28 days ago
Analysis of Techniques to Improve Protocol Processing Latency
This paper describes several techniques designed to improve protocol latency, and reports on their effectiveness when measured on a modern RISC machine employing the DEC Alpha pro...
David Mosberger, Larry L. Peterson, Patrick G. Bri...
DATE
2009
IEEE
73views Hardware» more  DATE 2009»
14 years 3 months ago
A study of the Single Event Effects impact on functional mapping within Flash-based FPGAs
—Flash-based FPGAs are increasingly demanded in safety critical fields, in particular space and avionic ones, due to their non-volatile configuration memory. Although they are al...
Francesco Abate, Luca Sterpone, Massimo Violante, ...
ARCS
2004
Springer
14 years 16 days ago
STAFF: State Transition Applied Fast Flash Translation Layer
Abstract. Recently, flash memory is widely used in embedded applications since it has strong points: non-volatility, fast access speed, shock resistance, and low power consumption....
Tae-Sun Chung, Stein Park, Myung-Jin Jung, Bumsoo ...
CORR
2008
Springer
141views Education» more  CORR 2008»
13 years 9 months ago
Model checking memoryful linear-time logics over one-counter automata
We study complexity of the model-checking problems for LTL with registers (also known as freeze LTL and written LTL ) and for first-order logic with data equality tests (written F...
Stéphane Demri, Ranko Lazic, Arnaud Sangnie...