Sciweavers

73 search results - page 11 / 15
» Optimistic Concurrency Semantics for Transactions in Coordin...
Sort
View
HASKELL
2009
ACM
14 years 1 months ago
A compositional theory for STM Haskell
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
Johannes Borgström, Karthikeyan Bhargavan, An...
SIGMOD
2000
ACM
159views Database» more  SIGMOD 2000»
13 years 11 months ago
DLFM: A Transactional Resource Manager
The DataLinks technology developed at IBM Almaden Research Center and now available in DB2 UDB 5.2 introduces a new data type called DATALINK for a database to reference and manag...
Hui-I Hsiao, Inderpal Narang
ECOOPW
1999
Springer
13 years 11 months ago
An Aspect-Oriented Design Framework for Concurrent Systems
Abstract. In Aspect-Oriented Programming we decompose a problem into a number of functional components as well as a number of aspects and then we compose these components and aspec...
Constantinos Constantinides, Atef Bader, Tzilla El...
COORDINATION
2009
Springer
14 years 8 months ago
Assume-Guarantee Verification of Concurrent Systems
Process algebras are a set of mathematically rigourous languages with well defined semantics that permit modelling behaviour of concurrent and communicating systems. Verification o...
Liliana D'Errico, Michele Loreti
CAV
2009
Springer
177views Hardware» more  CAV 2009»
14 years 8 months ago
Software Transactional Memory on Relaxed Memory Models
Abstract. Pseudo-code descriptions of STMs assume sequentially consistent program execution and atomicity of high-level STM operations like read, write, and commit. These assumptio...
Rachid Guerraoui, Thomas A. Henzinger, Vasu Singh