Sciweavers

2649 search results - page 404 / 530
» Temporal Theories of Reasoning
Sort
View
POPL
2007
ACM
14 years 8 months ago
Modular verification of a non-blocking stack
This paper contributes to the development of techniques for the modular proof of programs that include concurrent algorithms. We present a proof of a non-blocking concurrent algor...
Matthew J. Parkinson, Richard Bornat, Peter W. O'H...
PERCOM
2007
ACM
14 years 7 months ago
The Role of Probabilistic Schemes in Multisensor Context-Awareness
This paper investigates the role of existing "probabilistic" schemes to reason about various everyday situations on the basis of data from multiple heterogeneous physical...
Waltenegus Dargie
DCC
2008
IEEE
14 years 7 months ago
Coprimitive sets and inextendable codes
Complete (n, r)-arcs in PG(k - 1, q) and projective (n, k, n - r)q-codes that admit no projective extensions are equivalent objects. We show that projective codes of reasonable le...
T. L. Alderson, Aiden A. Bruen
ICCAD
2001
IEEE
108views Hardware» more  ICCAD 2001»
14 years 4 months ago
Single-Pass Redundancy Addition and Removal
Redundancy-addition-and-removal is a rewiring technique which for a given target wire wt finds a redundant alternative wire wa. Addition of wa makes wt redundant and hence removab...
Chih-Wei Jim Chang, Malgorzata Marek-Sadowska
TACAS
2010
Springer
221views Algorithms» more  TACAS 2010»
14 years 2 months ago
Trace-Based Symbolic Analysis for Atomicity Violations
Abstract. We propose a symbolic algorithm to accurately predict atomicity violations by analyzing a concrete execution trace of a concurrent program. We use both the execution trac...
Chao Wang, Rhishikesh Limaye, Malay K. Ganai, Aart...