691 search results - page 3 / 139 » Automatically Proving Linearizability |
SIROCCO
2004
13 years 6 months ago
2004
Shareable data services providing consistency guarantees, such as atomicity (linearizability), make building distributed systems easier. However, combining linearizability with ef...
ESOP
2012
Springer
12 years 11 days ago
2012
Springer
Abstract. Linearizability is a commonly accepted notion of correctness for libraries of concurrent algorithms. Unfortunately, it is only appropriate for sequentially consistent mem...
PODS
2005
ACM
14 years 4 months ago
2005
ACM
Direct reductions of partial differential equations to systems of ordinary differential equations are in one-to-one correspondence with compatible differential constraints. The dif...
CADE
2012
Springer
11 years 7 months ago
2012
Springer
We introduce a technique to prove non-termination of term rewrite systems automatically. Our technique improves over previous approaches substantially, as it can also detect non-lo...
RTA
1997
Springer
13 years 8 months ago
1997
Springer
We present a technique to prove innermost normalisation of term rewriting systems TRSs automatically. In contrast to previous methods, our technique is able to prove innermost n...