3394 search results - page 463 / 679 » A Modal Model of Memory |
182
click to vote
NFM
2011
15 years 1 months ago
2011
Program verifiers based on first-order theorem provers model the program heap as a collection of mutable maps. In such verifiers, preserving unmodified facts about the heap acr...
185
click to vote
DC
2010
15 years 1 months ago
2010
First-Come-First-Served (FCFS) mutual exclusion (ME) is the problem of ensuring that processes attempting to concurrently access a shared resource do so one by one, in a fair order...
188
click to vote
EJC
2010
15 years 1 months ago
2010
As a computational model of natural language communication, Database Semantics1 (DBS) includes a hearer mode and a speaker mode. For the content to be mapped into language expressi...
204
click to vote
PLDI
2011
ACM
14 years 9 months ago
2011
ACM
Current proposals for concurrent shared-memory languages, including C++ and C, provide sequential consistency only for programs without data races (the DRF guarantee). While the i...
178
click to vote
IACR
2011
14 years 6 months ago
2011
What does it mean for an encryption scheme to be leakage-resilient? Prior formulations require that the scheme remains semantically secure even in the presence of leakage, but onl...