Sciweavers

1159 search results - page 155 / 232
» Adding Concurrency to a Programming Language
Sort
View
PLDI
2006
ACM
14 years 3 months ago
Optimizing memory transactions
Atomic blocks allow programmers to delimit sections of code as ‘atomic’, leaving the language’s implementation to enforce atomicity. Existing work has shown how to implement...
Timothy L. Harris, Mark Plesko, Avraham Shinnar, D...
ESOP
2010
Springer
14 years 6 months ago
Explicit Stabilisation for Modular Rely-Guarantee Reasoning
Abstract. We propose a new formalisation of stability for Rely-Guarantee, in which an assertion's stability is encoded into its syntactic form. This allows two advances in mod...
John Wickerson, Matthew J. Parkinson, Mike Dodds
APLAS
2009
ACM
14 years 3 months ago
A Fresh Look at Separation Algebras and Share Accounting
Separation Algebras serve as models of Separation Logics; Share Accounting allows reasoning about concurrent-read/exclusive-write resources in Separation Logic. In designing a Conc...
Robert Dockins, Aquinas Hobor, Andrew W. Appel
VL
2003
IEEE
136views Visual Languages» more  VL 2003»
14 years 2 months ago
The effects of graphical and textual visualisations in multi-representational debugging environments
The effects of graphical and textual visualisations in a multi-representational debugging environment were investigated in computing students who used a software debugging environ...
Pablo Romero, Benedict du Boulay, Rudi Lutz, Richa...
ICALP
2010
Springer
14 years 2 months ago
Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems
Assuming the Unique Games Conjecture (UGC), we show optimal inapproximability results for two classic scheduling problems. We obtain a hardness of 2 − ε for the problem of mini...
Nikhil Bansal, Subhash Khot