On the public citation graph

Safe replication through bounded concurrency verification

https://doi.org/10.1145/3276534
0 signed · 61 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-642-14295-6_25openalex-snapshot
Fences in Weak Memory Models
inferredcites →https://doi.org/10.1007/978-3-642-24550-3_29openalex-snapshot
Conflict-Free Replicated Data Types
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/pdis.1994.331722openalex-snapshot
Session guarantees for weakly consistent replicated data
inferredcites →https://doi.org/10.1145/1250734.1250785openalex-snapshot
Iterative context bounding for systematic testing of multithreaded programs
inferredcites →https://doi.org/10.1145/1773912.1773922openalex-snapshot
Cassandra
inferredcites →https://doi.org/10.1145/2043556.2043592openalex-snapshot
Transactional storage for geo-replicated systems
inferredcites →https://doi.org/10.1145/2213836.2213945openalex-snapshot
Amazon dynamoDB
inferredcites →https://doi.org/10.1145/224056.224070openalex-snapshot
Managing update conflicts in Bayou, a weakly connected replicated storage system
inferredcites →https://doi.org/10.1145/2408776.2408795openalex-snapshot
Symbolic execution for software testing
inferredcites →https://doi.org/10.1145/2447976.2447992openalex-snapshot
Eventual consistency today
inferredcites →https://doi.org/10.1145/2463676.2465279openalex-snapshot
Bolt-on causal consistency
inferredcites →https://doi.org/10.1145/2523616.2523632openalex-snapshot
Consistency without borders
inferredcites →https://doi.org/10.1145/2535838.2535848openalex-snapshot
Replicated data types
inferredcites →https://doi.org/10.1145/2535838.2535854openalex-snapshot
Modular reasoning about heap paths via effectively propositional formulas
inferredcites →https://doi.org/10.1145/2723372.2737784openalex-snapshot
Feral Concurrency Control
inferredcites →https://doi.org/10.1145/2737924.2737958openalex-snapshot
Verdi: a framework for implementing and formally verifying distributed systems
inferredcites →https://doi.org/10.1145/2737924.2737981openalex-snapshot
Declarative programming over eventually consistent data stores
inferredcites →https://doi.org/10.1145/2741948.2741972openalex-snapshot
Putting consistency back into eventual consistency
inferredcites →https://doi.org/10.1145/2837614.2837622openalex-snapshot
Chapar: certified causally consistent distributed key-value stores
inferredcites →https://doi.org/10.1145/2837614.2837625openalex-snapshot
'Cause I'm strong enough: Reasoning about consistency choices in distributed systems
inferredcites →https://doi.org/10.1145/2908080.2908118openalex-snapshot
Ivy: safety verification by interactive generalization
inferredcites →https://doi.org/10.1145/3009837.3009888openalex-snapshot
On verifying causal consistency
inferredcites →https://doi.org/10.1145/3009837.3009895openalex-snapshot
Serializability for eventual consistency: criterion, analysis, and applications
inferredcites →https://doi.org/10.1145/3062341.3062353openalex-snapshot
Synthesizing memory models from framework sketches and Litmus tests
inferredcites →https://doi.org/10.1145/3140568openalex-snapshot
Paxos made EPR: decidable reasoning about distributed protocols
inferredcites →https://doi.org/10.1145/3158114openalex-snapshot
Reducing liveness to safety in first-order logic
inferredcites →https://doi.org/10.1145/3158115openalex-snapshot
Alone together: compositional reasoning and inference for weak isolation
inferredcites →https://doi.org/10.1145/343477.343502openalex-snapshot
Towards robust distributed systems (abstract)
inferredcites →https://doi.org/10.1145/564585.564601openalex-snapshot
Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services
inferredcites →https://doi.org/10.14778/2212351.2212359openalex-snapshot
Probabilistically bounded staleness for practical partial quorums
inferredcites →https://doi.org/10.14778/2735508.2735509openalex-snapshot
Coordination avoidance in database systems
inferredcites →https://doi.org/10.4230/lipics.ecoop.2015.568openalex-snapshot
Global Sequence Protocol: A Robust Abstraction for Replicated Shared State
inferredcites →https://doi.org/10.48550/arxiv.1512.00168openalex-snapshot
Consistency in Non-Transactional Distributed Storage Systems
inferredcites →https://doi.org/10.48550/arxiv.1801.06340openalex-snapshot
Just-Right Consistency: reconciling availability and safety

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/spe.3430openalex-snapshot
Concurrency Contracts for Designing Highly Available Replicated Data Types
inferred← citeshttps://doi.org/10.1007/978-3-030-25543-5_26openalex-snapshot
Automated Parameterized Verification of CRDTs
inferred← citeshttps://doi.org/10.1007/978-3-030-40914-2_11openalex-snapshot
Combining State- and Event-Based Semantics to Verify Highly Available Programs
inferred← citeshttps://doi.org/10.1007/978-3-030-44914-8_20openalex-snapshot
Proving the Safety of Highly-Available Distributed Objects
inferred← citeshttps://doi.org/10.1007/978-3-030-53288-8_13openalex-snapshot
Semantics, Specification, and Bounded Verification of Concurrent Libraries in Replicated Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-64276-1_15openalex-snapshot
Implementation Correctness for Replicated Data Types, Categorically
inferred← citeshttps://doi.org/10.1007/978-3-030-89247-0_2openalex-snapshot
Automated Replication of Tuple Spaces via Static Analysis
inferred← citeshttps://doi.org/10.1016/j.scico.2021.102687openalex-snapshot
Combining state- and event-based semantics to verify highly available applications
inferred← citeshttps://doi.org/10.1109/tse.2024.3477723openalex-snapshot
Consistent Local-First Software: Enforcing Safety and Invariants for Local-First Applications
inferred← citeshttps://doi.org/10.1145/3341710openalex-snapshot
Sequential programming for replicated data stores
inferred← citeshttps://doi.org/10.1145/3360543openalex-snapshot
CLOTHO: directed test generation for weakly consistent database systems
inferred← citeshttps://doi.org/10.1145/3453483.3454028openalex-snapshot
Repairing serializability bugs in distributed database programs via automated schema refactoring
inferred← citeshttps://doi.org/10.1145/3453483.3454067openalex-snapshot
Abstraction for conflict-free replicated data types
inferred← citeshttps://doi.org/10.1145/3485484openalex-snapshot
ECROs: building global scale systems from sequential code
inferred← citeshttps://doi.org/10.1145/3485546openalex-snapshot
MonkeyDB: effectively testing correctness under weak isolation levels
inferred← citeshttps://doi.org/10.1145/3519939.3523426openalex-snapshot
Hamband: RDMA replicated data types
inferred← citeshttps://doi.org/10.1145/3519939.3523735openalex-snapshot
Certified mergeable replicated data types
inferred← citeshttps://doi.org/10.1145/3563336openalex-snapshot
Katara: synthesizing CRDTs with verified lifting
inferred← citeshttps://doi.org/10.1145/3591243openalex-snapshot
Dynamic Partial Order Reduction for Checking Correctness against Transaction Isolation Levels
inferred← citeshttps://doi.org/10.1145/3633769openalex-snapshot
LoRe: A Programming Model for Verifiably Safe Local-first Software
inferred← citeshttps://doi.org/10.1145/3656391openalex-snapshot
IsoPredict: Dynamic Predictive Analysis for Detecting Unserializable Behaviors in Weakly Isolated Data Store Applications
inferred← citeshttps://doi.org/10.1145/3720513openalex-snapshot
Peepco: Batch-Based Consistency Optimization
inferred← citeshttps://doi.org/10.48550/arxiv.2010.06622openalex-snapshot
CISE3: Verifying Weakly Consistent Applications with Why3
inferred← citeshttps://doi.org/10.48550/arxiv.2103.04828openalex-snapshot
A coordination-free, convergent, and safe replicated tree
inferred← citeshttps://doi.org/10.48550/arxiv.2106.00344openalex-snapshot
UniStore: A fault-tolerant marriage of causal and strong consistency (extended version)
inferred← citeshttps://doi.org/10.70675/a1988a02z3d41z4738z942az643411b36ddfopenalex-snapshot
Designing safe and highly available distributed applications
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.