Sciweavers

2300 search results - page 196 / 460
» Maximally Concurrent Programs
Sort
View
POPL
2005
ACM
16 years 6 months ago
Permission accounting in separation logic
A lightweight logical approach to race-free sharing of heap storage between concurrent threads is described, based on the notion of permission to access. Transfer of permission be...
Richard Bornat, Cristiano Calcagno, Peter W. O'Hea...
SCP
1998
163views more  SCP 1998»
15 years 6 months ago
Computing with Continuous Change
A central challenge in computer science and knowledge representation is the integration of conceptual frameworks for continuous and discrete change, as exemplified by the theory ...
Vineet Gupta, Radha Jagadeesan, Vijay A. Saraswat
ISSTA
2012
ACM
13 years 9 months ago
Cooperative types for controlling thread interference in Java
Multithreaded programs are notoriously prone to unintended interference between concurrent threads. To address this problem, we argue that yield annotations in the source code sho...
Jaeheon Yi, Tim Disney, Stephen N. Freund, Cormac ...
SIGSOFT
2009
ACM
16 years 7 months ago
Refactoring for reentrancy
A program is reentrant if distinct executions of that program on distinct inputs cannot affect each other. Reentrant programs have the desirable property that they can be deployed...
Jan Wloka, Manu Sridharan, Frank Tip
POPL
2010
ACM
16 years 1 months ago
Abstraction-guided synthesis of synchronization
ion-Guided Synthesis of Synchronization Martin Vechev IBM Research Eran Yahav IBM Research Greta Yorsh IBM Research We present a novel framework for automatic inference of effici...
Martin T. Vechev, Eran Yahav, Greta Yorsh