146 search results - page 12 / 30 » Local Reasoning about Programs that Alter Data Structures |
ESOP
2004
Springer
15 years 3 months ago
2004
Springer
A transaction defines a locus of computation that satisfies important concurrency and failure properties; these so-called ACID properties provide strong serialization guarantees ...
167
click to vote
ICFP
2009
ACM
15 years 10 months ago
2009
ACM
We present a new approach for constructing and verifying higherorder, imperative programs using the Coq proof assistant. We build on the past work on the Ynot system, which is bas...
107
click to vote
OOPSLA
2010
Springer
14 years 7 months ago
2010
Springer
In this paper we propose a communication-centric approach to specifying and checking how multithreaded programs use shared memory to perform inter-thread communication. Our approa...
PLDI
2012
ACM
13 years 3 days ago
2012
ACM
Approximate program transformations such as skipping tasks [29, 30], loop perforation [21, 22, 35], reduction sampling [38], multiple selectable implementations [3, 4, 16, 38], dy...
CONCUR
2004
Springer
15 years 3 months ago
2004
Springer
We present a trace semantics for a language of parallel programs which share access to mutable data. We introduce a resource-sensitive logic for partial correctness, based on a re...