903 search results - page 110 / 181 » Completeness Results for Memory Logics |
201
click to vote
LPNMR
1993
Springer
15 years 11 months ago
1993
Springer
We present a logic programming language which uses a four-valued bilattice as the underlying framework for semantics of programs. The two orderings of the bilattice reflect the c...
242
Voted
CAL
2010
15 years 3 months ago
2010
Memory models like SC, TSO, and PC enforce load-load ordering, requiring that loads from any single thread appear to occur in program order to all other threads. Out-of-order execu...
208
click to vote
EDBT
2011
ACM
14 years 10 months ago
2011
ACM
Continuous top-k queries, which report a certain number (k) of top preferred objects from data streams, are important for a broad class of real-time applications, ranging from fi...
188
click to vote
CCS
2009
ACM
15 years 10 months ago
2009
ACM
Code injections attacks are one of the most powerful and important classes of attacks on software. In such attacks, the attacker sends malicious input to a software application, w...
190
click to vote
ISCA
2005
IEEE
16 years 14 days ago
2005
IEEE
Scaling feature size improves processor performance but increases each device’s susceptibility to defects (i.e., hard errors). As a result, fabrication technology must improve s...