141 search results - page 19 / 29 » Automatically Proving Concurrent Programs Correct |
SAC
2010
ACM
14 years 2 months ago
2010
ACM
During the last decade, software transactional memory (STM) gained wide popularity in many areas of parallel computing. In this paper, we introduce LISP-derived language equipped ...
CONCUR
2008
Springer
13 years 9 months ago
2008
Springer
Software transactional memory (STM) offers a disciplined concurrent programming model for exploiting the parallelism of modern processor architectures. This paper presents the firs...
DC
2010
13 years 7 months ago
2010
Model checking software transactional memories (STMs) is difficult because of the unbounded number, length, and delay of concurrent transactions and the unbounded size of the memo...
PLDI
2010
ACM
13 years 11 months ago
2010
ACM
Verified compilers, such as Leroy's CompCert, are accompanied by a fully checked correctness proof. Both the compiler and proof are often constructed with an interactive proo...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. Automated software verification is a very active field of research which has made enormous progress both in theoretical and practical aspects. Recently, an important amou...