Sciweavers

1805 search results - page 314 / 361
» A Theory of Closure Operators
Sort
View
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
16 years 4 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...
ICFP
2005
ACM
16 years 4 months ago
A step-indexed model of substructural state
The concept of a "unique" object arises in many emerging programming languages such as Clean, CQual, Cyclone, TAL, and Vault. In each of these systems, unique objects ma...
Amal J. Ahmed, Matthew Fluet, Greg Morrisett
PERCOM
2003
ACM
16 years 3 months ago
Location Aware Resource Management in Smart Homes
Abstract-- The rapid advances in a wide range of wireless access technologies along with the efficient use of smart spaces have already set the stage for development of smart homes...
Abhishek Roy, Soumya K. Das Bhaumik, Amiya Bhattac...
MOBIHOC
2008
ACM
16 years 3 months ago
Improving sensor network immunity under worm attacks: a software diversity approach
Because of cost and resource constraints, sensor nodes do not have a complicated hardware architecture or operating system to protect program safety. Hence, the notorious buffer-o...
Yi Yang, Sencun Zhu, Guohong Cao
POPL
2010
ACM
16 years 1 months ago
On the Verification Problem for Weak Memory Models
We address the verification problem of finite-state concurrent programs running under weak memory models. These models capture the reordering of program (read and write) operation...
Ahmed Bouajjani, Madanlal Musuvathi, Mohamed Faouz...