Safe replication through bounded concurrency verification
Citations
20 citations
Cites background from "Safe replication through bounded co..."
...Some works [16, 17, 26, 27] have considered this problem from the standpoint of synthesis, or from the point of view of which mechanisms can be used to check a certain property of the system....
[...]
10 citations
Additional excerpts
...Like our work, [Kaki et al. 2018] and [Nagar and Jagannathan 2018] also model application logic and consistency specifications using a decidable fragment of first-order logic (FOL), so that an underlying solver could automatically derive harmful structures which are possible under the given…...
[...]
...Like our work, [Kaki et al. 2018] and [Nagar and Jagannathan 2018] also model application logic and consistency specifications using a decidable fragment of first-order logic (FOL), so that an underlying solver could automatically derive harmful structures which are possible under the given consistency specification and search for them in actual dependency graphs taking application logic into account....
[...]
9 citations
Cites background from "Safe replication through bounded co..."
...A simple example of a consistency policy which is not behaviorally stable is a policy which maintains bounded concurrency [12] by limiting the number of concurrent operations across all replicas to a fixed bound....
[...]
...A number of earlier efforts [2,21,10,12,11] have looked at the problem of verifying state-based invariants in distributed applications....
[...]
8 citations
References
2,870 citations
"Safe replication through bounded co..." refers methods in this paper
...Indeed, the model abstracts many realworld distributed data stores [Lakshman and Malik 2010; Riak 2018; Sivasubramanian 2012; Voldemort 2009], and is consistent with the models used in a number of research prototypes such as Walter [Sovran et al. 2011], Chapar [Lesani et al. 2016], Antidote…...
[...]
...The distributed database itself is implemented as a shim layer on top of Cassandra [Lakshman and Malik 2010] in the same vein as [Bailis et al. 2013; Sivaramakrishnan et al. 2015]....
[...]
1,456 citations
1,112 citations
936 citations
"Safe replication through bounded co..." refers methods or result in this paper
...Indeed, the model abstracts many realworld distributed data stores [Lakshman and Malik 2010; Riak 2018; Sivasubramanian 2012; Voldemort 2009], and is consistent with the models used in a number of research prototypes such as Walter [Sovran et al. 2011], Chapar [Lesani et al. 2016], Antidote…...
[...]
...Indeed, the model abstracts many realworld distributed data stores [Lakshman and Malik 2010; Riak 2018; Sivasubramanian 2012; Voldemort 2009], and is consistent with the models used in a number of research prototypes such as Walter [Sovran et al....
[...]
856 citations
"Safe replication through bounded co..." refers background in this paper
...This occurs because RDT operations may not be atomically and uniformly applied across all replicas, as a consequence of network partitions and failures, weak ordering and delivery guarantees, etc. [Brewer 2000; Gilbert and Lynch 2002]....
[...]