Sciweavers

709 search results - page 28 / 142
» An Equational Theory for Transactions
Sort
View
ENTCS
2007
104views more  ENTCS 2007»
14 years 11 months ago
An Algebra of Pure Quantum Programming
We develop a sound and complete equational theory for the functional quantum programming language QML. The soundness and completeness of the theory are with respect to the previou...
Thorsten Altenkirch, Jonathan Grattage, Juliana Ka...
78
Voted
SPAA
2009
ACM
15 years 11 months ago
On avoiding spare aborts in transactional memory
This paper takes a step toward developing a theory for understanding aborts in transactional memory systems (TMs). Existing TMs may abort many transactions that could, in fact, co...
Idit Keidar, Dmitri Perelman
SPAA
2010
ACM
14 years 11 months ago
A universal construction for wait-free transaction friendly data structures
Given the sequential implementation of any data structure, we show how to obtain an efficient, wait-free implementation of that data structure shared by any fixed number of proces...
Phong Chuong, Faith Ellen, Vijaya Ramachandran
DBPL
2003
Springer
120views Database» more  DBPL 2003»
15 years 4 months ago
A Unifying Semantics for Active Databases Using Non-Markovian Theories of Actions
Over the last fifteen years, database management systems (DBMSs) have been enhanced by the addition of rule-based programming to obtain active DBMSs. One of the greatest challeng...
Iluju Kiringa, Raymond Reiter
PPDP
2005
Springer
15 years 4 months ago
Isolation-only transactions by typing and versioning
In this paper we design a language and runtime support for isolation-only, multithreaded transactions (called tasks). Tasks allow isolation to be declared instead of having to be ...
Pawel T. Wojciechowski