Sciweavers

41 search results - page 6 / 9
» Reasoning about Lock Placements
Sort
View
PLDI
2003
ACM
14 years 21 days ago
Checking and inferring local non-aliasing
In prior work [15] we studied a language construct restrict that allows programmers to specify that certain pointers are not aliased to other pointers used within a lexical scope....
Alexander Aiken, Jeffrey S. Foster, John Kodumal, ...
CAV
2003
Springer
188views Hardware» more  CAV 2003»
13 years 11 months ago
Thread-Modular Abstraction Refinement
odular Abstraction Refinement Thomas A. Henzinger1 , Ranjit Jhala1 , Rupak Majumdar1 , and Shaz Qadeer2 1 University of California, Berkeley 2 Microsoft Research, Redmond Abstract....
Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar,...
TLDI
2009
ACM
111views Formal Methods» more  TLDI 2009»
14 years 4 months ago
A generic type-and-effect system
Type-and-effect systems are a natural approach for statically reasoning about a program’s execution. They have been used to track a variety of computational effects, for example...
Daniel Marino, Todd D. Millstein
CAV
2010
Springer
239views Hardware» more  CAV 2010»
13 years 11 months ago
Model Checking of Linearizability of Concurrent List Implementations
Abstract. Concurrent data structures with fine-grained synchronization are notoriously difficult to implement correctly. The difficulty of reasoning about these implementations do...
Pavol Cerný, Arjun Radhakrishna, Damien Zuf...
ENTCS
2008
140views more  ENTCS 2008»
13 years 7 months ago
Linking Event-B and Concurrent Object-Oriented Programs
The Event-B method is a formal approach to modelling systems, using refinement. Initial specification is a high level of abstraction; detail is added in refinement steps as the de...
Andrew Edmunds, Michael Butler