Sciweavers

156 search results - page 20 / 32
» An Abort-Aware Model of Transactional Programming
Sort
View
ICS
2009
Tsinghua U.
14 years 2 months ago
QuakeTM: parallelizing a complex sequential application using transactional memory
“Is transactional memory useful?” is the question that cannot be answered until we provide substantial applications that can evaluate its capabilities. While existing TM appli...
Vladimir Gajinov, Ferad Zyulkyarov, Osman S. Unsal...
POPL
2009
ACM
14 years 2 months ago
Comparing the performance of concurrent linked-list implementations in Haskell
Haskell has a rich set of synchronization primitives for implemented-state concurrency abstractions, ranging from the very high level (Software Transactional Memory) to the very l...
Martin Sulzmann, Edmund S. L. Lam, Simon Marlow
ACMICEC
2007
ACM
127views ECommerce» more  ACMICEC 2007»
13 years 11 months ago
Symbolic model checking of institutions
Norms defined by institutions and enforced by organizations have been put forward as a mechanism to increase the efficiency and reliability of electronic transactions carried out ...
Francesco Viganò, Marco Colombetti
DAGSTUHL
1998
13 years 9 months ago
Active-U-Datalog: Integrating Active Rules in a Logical Update Language
Deductive database technology represents an important step towards the goal of developing highly-declarative database programming languages. In order to make deductive databases a ...
Elisa Bertino, Barbara Catania, Vincenzo Gervasi, ...
VLDB
2002
ACM
156views Database» more  VLDB 2002»
13 years 7 months ago
A Logical Framework for Scheduling Workflows under Resource Allocation Constraints
A workflow consists of a collection of coordinated tasks designed to carry out a welldefined complex process, such as catalog ordering, trip planning, or a business process in an ...
Pinar Senkul, Michael Kifer, Ismail Hakki Toroslu