Sciweavers

229 search results - page 14 / 46
» How Efficient Can Memory Checking Be
Sort
View
CCS
2008
ACM
13 years 9 months ago
Enforcing authorization policies using transactional memory introspection
Correct enforcement of authorization policies is a difficult task, especially for multi-threaded software. Even in carefully-reviewed code, unauthorized access may be possible in ...
Arnar Birgisson, Mohan Dhawan, Úlfar Erling...
EUC
2008
Springer
13 years 9 months ago
A Probabilistic Approach to Consistency Checking for Pervasive Context
Context-awareness is a key issue in pervasive computing. Context-aware applications are prone to the context consistency problem, where applications are confronted with conflictin...
Yu Huang 0002, Xiang Ma, XianPing Tao, Jiannong Ca...
COOP
2004
13 years 9 months ago
Model Checking Groupware Protocols
Abstract. The enormous improvements in the efficiency of model-checking techniques in recent years facilitates their application to ever more complex systems of concurrent and dist...
Maurice H. ter Beek, Mieke Massink, Diego Latella,...
VLSID
2004
IEEE
117views VLSI» more  VLSID 2004»
14 years 8 months ago
Evaluating the Reliability of Defect-Tolerant Architectures for Nanotechnology with Probabilistic Model Checking
As we move from deep submicron technology to nanotechnology for device manufacture, the need for defect-tolerant architectures is gaining importance. This is because, at the nanos...
Gethin Norman, David Parker, Marta Z. Kwiatkowska,...
COMBINATORICA
2008
84views more  COMBINATORICA 2008»
13 years 7 months ago
Parity check matrices and product representations of squares
Let NF(n, k, r) denote the maximum number of columns in an n-row matrix with entries in a finite field F in which each column has at most r nonzero entries and every k columns are...
Assaf Naor, Jacques Verstraëte