903 search results - page 142 / 181 » Completeness Results for Memory Logics |
159
click to vote
ECCC
2008
15 years 6 months ago
2008
While closed timelike curves (CTCs) are not known to exist, studying their consequences has led to nontrivial insights in general relativity, quantum information, and other areas....
171
click to vote
MFCS
2010
Springer
15 years 4 months ago
2010
Springer
We study observation-based strategies for partially-observable Markov decision processes (POMDPs) with parity objectives. An observationbased strategy relies on partial information...
182
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widenin...
259
click to vote
ICDE
2009
IEEE
16 years 8 months ago
2009
IEEE
Many location-based services require rich and expressive query language support for filtering large amounts of information. In prominent location-based services thousands of conti...
142
click to vote
ICCAD
2008
IEEE
16 years 3 months ago
2008
IEEE
Functional decomposition is a fundamental operation in logic synthesis. Prior BDD-based approaches to functional decomposition suffer from the memory explosion problem and do not...