141 search results - page 13 / 29 » Automatically Proving Concurrent Programs Correct |
106
click to vote
ICSE
2010
IEEE-ACM
15 years 4 months ago
2010
IEEE-ACM
We present views, a new approach to controlling concurrency. Fine-grained locking is often necessary to increase concurrency. Correctly implementing fine-grained locking with tod...
102
click to vote
CONCUR
2012
Springer
13 years 2 months ago
2012
Springer
Abstract. Linearizability is a commonly accepted notion of correctness for libraries of concurrent algorithms. Unfortunately, it assumes a complete isolation between a library and ...
JFP
2010
14 years 10 months ago
2010
Transient faults that arise in large-scale software systems can often be repaired by re-executing the code in which they occur. Ascribing a meaningful semantics for safe re-execut...
CORR
2010
Springer
14 years 11 months ago
2010
Springer
The classical technique for proving termination of a generic sequential computer program involves the synthesis of a ranking function for each loop of the program. Linear ranking ...
FM
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. Circus is a combination of Z and CSP that supports the development of state-rich reactive systems based on refinement. In this paper we present JCircus, a tool that autom...