Sciweavers

96 search results - page 4 / 20
» Concurrency Combinators for Declarative Synchronization
Sort
View
JLP
2010
85views more  JLP 2010»
13 years 17 days ago
Synchronous Kleene algebra
The work presented here investigates the combination of Kleene algebra with the synchrony model of concurrency from Milner's SCCS calculus. The resulting algebraic structure ...
Cristian Prisacariu
IEEEPACT
2009
IEEE
13 years 3 months ago
Adaptive Locks: Combining Transactions and Locks for Efficient Concurrency
Transactional memory is being advanced as an alternative to traditional lock-based synchronization for concurrent programming. Transactional memory simplifies the programming mode...
Takayuki Usui, Reimer Behrends, Jacob Evans, Yanni...
JFPLC
1998
13 years 7 months ago
DF - a feature constraint system and its extension to a logic concurrent language
Abstract. This paper presents a feature constraint system that, compared with the well-known systems OSF 1] and CFT 5], incorporates several interesting characteristics. The new sy...
Liviu-Virgil Ciortuz
ASPLOS
2012
ACM
12 years 1 months ago
Applying transactional memory to concurrency bugs
Multithreaded programs often suffer from synchronization bugs such as atomicity violations and deadlocks. These bugs arise from complicated locking strategies and ad hoc synchroni...
Haris Volos, Andres Jaan Tack, Michael M. Swift, S...
PDPTA
2003
13 years 7 months ago
The Application of Software Process Precedence Relationship Formalisms to Concurrent Hardware Systems
In this paper, precedence constraint combination formalisms defined in the software domain are used to define the behavior of hardware systems. Specifically, AND-join and various ...
Kenneth G. Ricks, David Jeff Jackson, B. Earl Well...