Sciweavers

37 search results - page 5 / 8
» Termination in Impure Concurrent Languages
Sort
View
CONCUR
2004
Springer
14 years 1 months ago
Resource Control for Synchronous Cooperative Threads
We develop new methods to statically bound the resources needed for the execution of systems of concurrent, interactive threads. Our study is concerned with a synchronous model of ...
Roberto M. Amadio, Silvano Dal-Zilio
IWMM
2004
Springer
92views Hardware» more  IWMM 2004»
14 years 1 months ago
Memory accounting without partitions
Operating systems account for memory consumption and allow for termination at the level of individual processes. As a result, if one process consumes too much memory, it can be te...
Adam Wick, Matthew Flatt
POPL
2009
ACM
14 years 8 months ago
Proving that non-blocking algorithms don't block
A concurrent data-structure implementation is considered nonblocking if it meets one of three following liveness criteria: waitfreedom, lock-freedom, or obstruction-freedom. Devel...
Alexey Gotsman, Byron Cook, Matthew J. Parkinson, ...
EUROPAR
2006
Springer
13 years 11 months ago
Toward a Definition of and Linguistic Support for Partial Quiescence
Abstract. The global quiescence of a distributed computation (or distributed termination detection) is an important problem. Some concurrent programming languages and systems provi...
Billy Yan-Kit Man, Hiu Ning (Angela) Chan, Andrew ...
SAC
2009
ACM
14 years 2 months ago
Applying Reo to service coordination in long-running business transactions
Ensuring transactional behavior of business processes and web service compositions is an essential issue in the area of serviceoriented computing. Transactions in this context may ...
Natallia Kokash, Farhad Arbab