Sciweavers

37 search results - page 3 / 8
» Termination in Impure Concurrent Languages
Sort
View
IWMM
2010
Springer
137views Hardware» more  IWMM 2010»
13 years 10 months ago
The locality of concurrent write barriers
Concurrent and incremental collectors require barriers to ensure correct synchronisation between mutator and collector. The overheads imposed by particular barriers on particular ...
Laurence Hellyer, Richard Jones, Antony L. Hosking
POPL
2004
ACM
13 years 11 months ago
Summarizing procedures in concurrent programs
The ability to summarize procedures is fundamental to building scalable interprocedural analyses. For sequential programs, procedure summarization is well-understood and used rout...
Shaz Qadeer, Sriram K. Rajamani, Jakob Rehof
LOGCOM
2007
126views more  LOGCOM 2007»
13 years 5 months ago
A Structural Proof of the Soundness of Rely/guarantee Rules
Various forms of rely/guarantee conditions have been used to record and reason about interference in ways that provide compositional development methods for concurrent programs. Th...
Joey W. Coleman, Cliff B. Jones
PPDP
2005
Springer
13 years 11 months ago
Security policy in a declarative style
We address the problem of controlling information leakage in a concurrent declarative programming setting. Our aim is to define verification tools in order to distinguish betwee...
Rachid Echahed, Frédéric Prost
CONCURRENCY
2008
83views more  CONCURRENCY 2008»
13 years 6 months ago
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 ...