Sciweavers

1499 search results - page 47 / 300
» Chopping Concurrent Programs
Sort
View
OOPSLA
2004
Springer
15 years 3 months ago
Efficient data race and deadlock prevention in concurrent object-oriented programs
The main goal of this PhD thesis is to propose and implement a methodology for the construction of programs based on the SCOOP model, and for modular reasoning about their correct...
Piotr Nienaltowski
ICLP
2005
Springer
15 years 3 months ago
A Distributed and Probabilistic Concurrent Constraint Programming Language
We present a version of the CCP paradigm, which is both distributed and probabilistic. We consider networks with a fixed number of nodes, each of them possessing a local and indep...
Luca Bortolussi, Herbert Wiklicky
STOC
2006
ACM
166views Algorithms» more  STOC 2006»
15 years 10 months ago
The Santa Claus problem
The Santa Claus problem is an interesting exercise in concurrent programming which has been used in a comparison of the concurrency mechanisms of Ada and Java. We present a simple...
Nikhil Bansal, Maxim Sviridenko
ACSD
2009
IEEE
149views Hardware» more  ACSD 2009»
15 years 4 months ago
From Concurrent Multi-clock Programs to Deterministic Asynchronous Implementations
We propose a general method to characterize and synthesize correctness-preserving, asynchronous wrappers for synchronous processes on a globally asynchronous locally synchronous (...
Dumitru Potop-Butucaru, Robert de Simone, Yves Sor...
OOPSLA
2009
Springer
15 years 4 months ago
Concurrency by default: using permissions to express dataflow in stateful programs
Sven Stork, Paulo Marques, Jonathan Aldrich