Sciweavers

286 search results - page 1 / 58
» Weak Ordering - A New Definition
Sort
View
ISCA
1998
IEEE
123views Hardware» more  ISCA 1998»
13 years 9 months ago
Weak Ordering - A New Definition
A memory model for a shared memory, multiprocessor commonly and often implicitly assumed by programmers is that of sequential consistency. This model guarantees that all memory ac...
Sarita V. Adve, Mark D. Hill
IPL
2010
81views more  IPL 2010»
13 years 3 months ago
An alternative characterization of weak order dependence
Control dependence forms the basis for many program analyses, such as program slicing. Recent work on control dependence analysis has led to new definitions of dependence that cat...
Torben Amtoft, Kelly Androutsopoulos, David Clark,...
JSYML
2011
69views more  JSYML 2011»
12 years 7 months ago
Weak systems of determinacy and arithmetical quasi-inductive definitions
We locate winning strategies for various Σ0 3-games in the L-hierarchy in order to prove the following:
Philip D. Welch
CSL
2010
Springer
13 years 6 months ago
New Algorithm for Weak Monadic Second-Order Logic on Inductive Structures
We present a new algorithm for model-checking weak monadic second-order logic on inductive structures, a class of structures of bounded clique width. Our algorithm directly manipul...
Tobias Ganzow, Lukasz Kaiser
CCS
2010
ACM
13 years 5 months ago
Synchronized aggregate signatures: new definitions, constructions and applications
An aggregate signature scheme is a digital signature scheme where anyone given n signatures on n messages from n users can aggregate all these signatures into a single short signa...
Jae Hyun Ahn, Matthew Green, Susan Hohenberger