Sciweavers

100 search results - page 6 / 20
» Event-based Composition of Concurrent Programs
Sort
View
PLDI
2011
ACM
14 years 18 days ago
Safe optimisations for shared-memory concurrent programs
Current proposals for concurrent shared-memory languages, including C++ and C, provide sequential consistency only for programs without data races (the DRF guarantee). While the i...
Jaroslav Sevcík
ICLP
2007
Springer
15 years 3 months ago
Declarative Diagnosis of Temporal Concurrent Constraint Programs
Abstract. We present a framework for the declarative diagnosis of nondeterministic timed concurrent constraint programs. We present a denotational semantics based on a (continuous)...
Moreno Falaschi, Carlos Olarte, Catuscia Palamides...
WOTUG
2008
14 years 11 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
ICALP
2011
Springer
14 years 1 months ago
Liveness-Preserving Atomicity Abstraction
-Preserving Atomicity Abstraction Alexey Gotsman1 and Hongseok Yang2 1 IMDEA Software Institute 2 University of Oxford Modern concurrent algorithms are usually encapsulated in libr...
Alexey Gotsman, Hongseok Yang
EDOC
2002
IEEE
15 years 2 months ago
Workflow-Based Composition of Web-Services: A Business Model or a Programming Paradigm?
While SOAP/XML is perceived as the appropriate interoperability level for web-services, companies compete to provide workflow-based tools for web-service integration. This paper p...
Dinesh Ganesarajah, Emil Lupu