Sciweavers

4378 search results - page 68 / 876
» On the Complexity of Ordered Colourings
Sort
View
CHARME
2003
Springer
196views Hardware» more  CHARME 2003»
14 years 2 months ago
Analyzing the Intel Itanium Memory Ordering Rules Using Logic Programming and SAT
We present a non-operational approach to specifying and analyzing shared memory consistency models. The method uses higher order logic to capture a complete set of ordering constra...
Yue Yang, Ganesh Gopalakrishnan, Gary Lindstrom, K...
CAEPIA
2009
Springer
13 years 10 months ago
Closeness and Distance Relations in Order of Magnitude Qualitative Reasoning via PDL
The syntax, semantics and an axiom system for an extension of Propositional Dynamic Logic (PDL) for order of magnitude qualitative reasoning which formalizes the concepts of close...
Alfredo Burrieza, Emilio Muñoz-Velasco, Man...
CHES
2010
Springer
159views Cryptology» more  CHES 2010»
13 years 10 months ago
Provably Secure Higher-Order Masking of AES
Implementations of cryptographic algorithms are vulnerable to Side Channel Analysis (SCA). To counteract it, masking schemes are usually involved which randomize key-dependent data...
Matthieu Rivain, Emmanuel Prouff
ENTCS
2006
173views more  ENTCS 2006»
13 years 9 months ago
Concurrent LSC Verification: On Decomposition Properties of Partially Ordered Symbolic Automata
Partially Ordered Symbolic Automata (POSAs) are used as the semantical foundation of visual formalisms like the scenario based language of Live Sequence Charts (LSCs). To check whe...
Tobe Toben, Bernd Westphal
FGCS
2000
81views more  FGCS 2000»
13 years 8 months ago
Managing the operator ordering problem in parallel databases
This paper focuses on parallel query optimization. We consider the operator problem and introduce a new class of execution strategies called Linear-Oriented Bushy Trees (LBTs). Co...
Harald Kosch