Sciweavers

60 search results - page 6 / 12
» Reasoning About Sequences of Memory States
Sort
View
ATAL
2001
Springer
13 years 12 months ago
Commitment Machines
We develop an approach in which we model communication protocols via commitment machines. Commitment machines supply a content to protocol states and actions in terms of the social...
Pinar Yolum, Munindar P. Singh
NIPS
2008
13 years 9 months ago
Multi-Agent Filtering with Infinitely Nested Beliefs
In partially observable worlds with many agents, nested beliefs are formed when agents simultaneously reason about the unknown state of the world and the beliefs of the other agen...
Luke S. Zettlemoyer, Brian Milch, Leslie Pack Kael...
ASPLOS
2011
ACM
12 years 11 months ago
NV-Heaps: making persistent objects fast and safe with next-generation, non-volatile memories
nt, user-defined objects present an attractive abstraction for working with non-volatile program state. However, the slow speed of persistent storage (i.e., disk) has restricted ...
Joel Coburn, Adrian M. Caulfield, Ameen Akel, Laur...
CONCUR
2008
Springer
13 years 9 months ago
Subsequence Invariants
We introduce subsequence invariants, which characterize the behavior of a concurrent system in terms of the occurrences of synchronization events. Unlike state invariants, which re...
Klaus Dräger, Bernd Finkbeiner
CSL
2006
Springer
13 years 11 months ago
Algorithms for Omega-Regular Games with Imperfect Information,
We study observation-based strategies for two-player turn-based games on graphs with omega-regular objectives. An observation-based strategy relies on imperfect information about t...
Krishnendu Chatterjee, Laurent Doyen, Thomas A. He...