Sciweavers

198 search results - page 4 / 40
» Lightweight reasoning about program correctness
Sort
View
PPOPP
2006
ACM
14 years 2 months ago
Proving correctness of highly-concurrent linearisable objects
We study a family of implementations for linked lists using finegrain synchronisation. This approach enables greater concurrency, but correctness is a greater challenge than for ...
Viktor Vafeiadis, Maurice Herlihy, Tony Hoare, Mar...
ICFP
2009
ACM
14 years 9 months ago
Biorthogonality, step-indexing and compiler correctness
We define logical relations between the denotational semantics of a simply typed functional language with recursion and the operational behaviour of low-level programs in a varian...
Nick Benton, Chung-Kil Hur
PLDI
2010
ACM
13 years 11 months ago
DRFX: a simple and efficient memory model for concurrent programming languages
The most intuitive memory model for shared-memory multithreaded programming is sequential consistency (SC), but it disallows the use of many compiler and hardware optimizations th...
Daniel Marino, Abhayendra Singh, Todd D. Millstein...
PERCOM
2005
ACM
14 years 8 months ago
A Dynamic Lightweight Platform for Ad-Hoc Infrastructures
Mobile devices like PDAs or mobile phones have become widespread. Similarly, network functionality like GSM, Bluetooth, or WLAN has become standard. Nevertheless, not many applica...
Andreas Frei, Gustavo Alonso
POPL
2005
ACM
14 years 8 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...