Sciweavers

12 search results - page 2 / 3
» Automatic Mutual Exclusion and Atomicity Checks
Sort
View
CC
2008
Springer
124views System Software» more  CC 2008»
13 years 7 months ago
Coqa: Concurrent Objects with Quantized Atomicity
This paper introduces a new language model, Coqa, for deeply embedding concurrent programming into objects. Every program written in our language has the desirable behaviors of ato...
Yu David Liu, Xiaoqi Lu, Scott F. Smith
PPOPP
1997
ACM
13 years 9 months ago
Effective Fine-Grain Synchronization for Automatically Parallelized Programs Using Optimistic Synchronization Primitives
As shared-memory multiprocessors become the dominant commodity source of computation, parallelizing compilers must support mainstream computations that manipulate irregular, point...
Martin C. Rinard
ISTCS
1992
Springer
13 years 9 months ago
Concurrent Timestamping Made Simple
Concurrent Time-stamp Systems (ctss) allow processes to temporally order concurrent events in an asynchronous shared memorysystem, a powerful tool for concurrency control, serving...
Rainer Gawlick, Nancy A. Lynch, Nir Shavit
FMSD
2000
86views more  FMSD 2000»
13 years 5 months ago
Verifying Temporal Properties of Reactive Systems: A STeP Tutorial
We review a number of formal verification techniques supported by STeP, the Stanford Temporal Prover, describing how the tool can be used to verify properties of several versions o...
Nikolaj Bjørner, Anca Browne, Michael Col&o...
ICDCS
2006
IEEE
13 years 11 months ago
Computing in the Presence of Timing Failures
Timing failures refer to a situation where the environment in which a system operates does not behave as expected regarding the timing assumptions, that is, the timing constraints...
Gadi Taubenfeld