903 search results - page 110 / 181 » Completeness Results for Memory Logics |
LPNMR
1993
Springer
14 years 1 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...
CAL
2010
13 years 5 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...
EDBT
2011
ACM
13 years 12 days 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...
CCS
2009
ACM
14 years 6 days 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...
ISCA
2005
IEEE
14 years 2 months 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...