Sciweavers

443 search results - page 11 / 89
» Relations in Concurrency
Sort
View
CF
2010
ACM
13 years 5 months ago
Supporting lock-free composition of concurrent data objects
Lock-free data objects offer several advantages over their blocking counterparts, such as being immune to deadlocks and convoying and, more importantly, being highly concurrent. H...
Daniel Cederman, Philippas Tsigas
ATVA
2004
Springer
135views Hardware» more  ATVA 2004»
14 years 1 months ago
Using Block-Local Atomicity to Detect Stale-Value Concurrency Errors
Data races do not cover all kinds of concurrency errors. This paper presents a data-ow-based technique to nd stale-value errors, which are not found by low-level and high-level d...
Cyrille Artho, Klaus Havelund, Armin Biere
RTCSA
2006
IEEE
14 years 1 months ago
Strengthening Property Preservation in Concurrent Real-Time Systems
To build a “correct” implementation from a model of a concurrent real-time system, it is important to understand the relation between the properties of the model and of its co...
Oana Florescu, Jinfeng Huang, Jeroen Voeten, Henk ...
MM
2004
ACM
114views Multimedia» more  MM 2004»
14 years 1 months ago
ChucK: a programming language for on-the-fly, real-time audio synthesis and multimedia
In this paper, we describe ChucK – a programming language and programming model for writing precisely timed, concurrent audio synthesis and multimedia programs. Precise concurre...
Ge Wang, Perry R. Cook
GFKL
2007
Springer
184views Data Mining» more  GFKL 2007»
14 years 1 months ago
A Probabilistic Relational Model for Characterizing Situations in Dynamic Multi-Agent Systems
Abstract. Artificial systems with a high degree of autonomy require reliable semantic information about the context they operate in. State interpretation, however, is a difficult ...
Daniel Meyer-Delius, Christian Plagemann, Georg vo...