Sciweavers

141 search results - page 1 / 29
» Automatically Proving Concurrent Programs Correct
Sort
View
SEFM
2007
IEEE
13 years 11 months ago
Automatically Proving Concurrent Programs Correct
of abstract interpretations in formal methods It is always very satisfying to hear about a theory, in the case at hand it is the theory of abstract interpretations, that explains i...
Byron Cook
CAV
2010
Springer
198views Hardware» more  CAV 2010»
13 years 8 months ago
Automatically Proving Linearizability
Abstract. This paper presents a practical automatic verification procedure for proving linearizability (i.e., atomicity and functional correctness) of concurrent data structure im...
Viktor Vafeiadis
TSE
2011
145views more  TSE 2011»
12 years 12 months ago
Semi-Proving: An Integrated Method for Program Proving, Testing, and Debugging
— We present an integrated method for program proving, testing, and debugging. Using the concept of metamorphic relations, we select necessary properties for target programs. For...
Tsong Yueh Chen, T. H. Tse, Zhiquan Zhou
PPOPP
2006
ACM
13 years 11 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...
PLDI
2003
ACM
13 years 10 months ago
Automatically proving the correctness of compiler optimizations
We describe a technique for automatically proving compiler optimizations sound, meaning that their transformations are always semantics-preserving. We first present a domainspeci...
Sorin Lerner, Todd D. Millstein, Craig Chambers