Sciweavers

1471 search results - page 3 / 295
» Composing concurrency control
Sort
View
WOTUG
2008
13 years 6 months ago
Communicating Haskell Processes: Composable Explicit Concurrency using Monads
Writing concurrent programs in languages that lack explicit support for concurrency can often be awkward and difficult. Haskell's monads provide a way to explicitly specify se...
Neil C. C. Brown
ECBS
2009
IEEE
130views Hardware» more  ECBS 2009»
14 years 3 days ago
Validating and Dynamically Adapting and Composing Features in Concurrent Product-Lines Applications
With the pressing in-time-market towards customized services, software product lines (SPL) are increasingly characterizing most of software landscape. SPL are mainly structured th...
Nasreddine Aoumeur, Kamel Barkaoui, Gunter Saake
PPOPP
2005
ACM
13 years 11 months ago
Composable memory transactions
Writing concurrent programs is notoriously difficult, and is of increasing practical importance. A particular source of concern is n correctly-implemented concurrency abstraction...
Tim Harris, Simon Marlow, Simon L. Peyton Jones, M...
FOCS
2003
IEEE
13 years 10 months ago
General Composition and Universal Composability in Secure Multi-Party Computation
Concurrent general composition relates to a setting where a secure protocol is run in a network concurrently with other, arbitrary protocols. Clearly, security in such a setting i...
Yehuda Lindell