On the public citation graph
Paxos made EPR: decidable reasoning about distributed protocols
0 signed · 136 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-48153-2_6openalex-snapshot
Model Checking TLA+ Specifications
inferredcites →https://doi.org/10.1007/978-3-319-21690-4_6openalex-snapshot
SMT and POR Beat Counter Abstraction: Parameterized Model Checking of Threshold-Based Distributed Algorithms
inferredcites →https://doi.org/10.1007/978-3-319-40229-1_6openalex-snapshot
Counting Constraints in Flat Array Fragments
inferredcites →https://doi.org/10.1007/978-3-319-41579-6_2openalex-snapshot
What You Always Wanted to Know About Model Checking of Fault-Tolerant Distributed Algorithms
inferredcites →https://doi.org/10.1007/978-3-319-48989-6_8openalex-snapshot
Formal Verification of Multi-Paxos for Distributed Consensus
inferredcites →https://doi.org/10.1007/978-3-319-63390-9_12openalex-snapshot
Cutoff Bounds for Consensus Algorithms
inferredcites →https://doi.org/10.1007/978-3-540-78800-3_24openalex-snapshot
Z3: An Efficient SMT Solver
inferredcites →https://doi.org/10.1007/978-3-642-11294-2_6openalex-snapshot
A History of the Virtual Synchrony Replication Model
inferredcites →https://doi.org/10.1007/978-3-642-14808-8_3openalex-snapshot
The TLA + Proof System: Building a Heterogeneous Verification Platform
inferredcites →https://doi.org/10.1007/978-3-642-39799-8_53openalex-snapshot
Effectively-Propositional Reasoning about Reachability in Linked Data Structures
inferredcites →https://doi.org/10.1007/978-3-642-54013-4_10openalex-snapshot
A Logic-Based Framework for Verifying Consensus Algorithms
inferredcites →https://doi.org/10.1007/978-3-662-07964-5openalex-snapshot
Interactive Theorem Proving and Program Development
inferredcites →https://doi.org/10.1007/978-3-662-54577-5_5openalex-snapshot
Bounded Quantifier Instantiation for Checking Inductive Invariants
inferredcites →https://doi.org/10.1007/s00446-009-0084-6openalex-snapshot
The Heard-Of model: computing in distributed systems with benign faults
inferredcites →https://doi.org/10.1007/s10817-009-9161-6openalex-snapshot
Deciding Effectively Propositional Logic Using DPLL and Substitution Sets
inferredcites →https://doi.org/10.1016/0022-0000(80)90027-6openalex-snapshot
Complexity results for classes of quantificational formulas
inferredcites →https://doi.org/10.1109/dsn.2014.45openalex-snapshot
Developing Correctly Replicated Databases Using Formal Tools
inferredcites →https://doi.org/10.1109/fmcad.2016.7886668openalex-snapshot
Modular specification and verification of a cache-coherent interface
inferredcites →https://doi.org/10.1145/1582716.1582783openalex-snapshot
Vertical paxos and primary-backup replication
inferredcites →https://doi.org/10.1145/1749608.1749613openalex-snapshot
Finite differencing of logical formulas for static analysis
inferredcites →https://doi.org/10.1145/1753171.1753191openalex-snapshot
Reconfiguring a state machine
inferredcites →https://doi.org/10.1145/2535838.2535854openalex-snapshot
Modular reasoning about heap paths via effectively propositional formulas
inferredcites →https://doi.org/10.1145/2699417openalex-snapshot
How Amazon web services uses formal methods
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.2737964openalex-snapshot
Mechanized verification of fine-grained concurrent programs
inferredcites →https://doi.org/10.1145/2908080.2908118openalex-snapshot
Ivy: safety verification by interactive generalization
inferredcites →https://doi.org/10.1145/2908080.2908129openalex-snapshot
Cardinalities and universal quantifiers for verifying parameterized systems
inferredcites →https://doi.org/10.1145/2914770.2837650openalex-snapshot
PSync: a partially synchronous language for fault-tolerant distributed algorithms
inferredcites →https://doi.org/10.1145/3009837.3009860openalex-snapshot
A short counterexample property for safety and liveness verification of fault-tolerant distributed algorithms
inferredcites →https://doi.org/10.1145/357172.357177openalex-snapshot
Finite Differencing of Computable Expressions
inferredcites →https://doi.org/10.1145/41840.41852openalex-snapshot
Hierarchical correctness proofs for distributed algorithms
inferredcites →https://doi.org/10.1145/503112.503113openalex-snapshot
Group communication specifications
inferredcites →https://doi.org/10.1145/98163.98167openalex-snapshot
Implementing fault-tolerant services using the state machine approach: a tutorial
inferredcites →https://doi.org/10.2200/s00658ed1v01y201508dct013openalex-snapshot
Decidability of Parameterized Verification
inferredcites →https://doi.org/10.48550/arxiv.1608.06696openalex-snapshot
Flexible Paxos: Quorum intersection revisited
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4623116openalex-extracted
Prenex Universal First-Order Safety Properties
inferred← citeshttps://doi.org/10.1007/978-3-030-25540-4_27openalex-snapshot
Probabilistic Bisimulation for Parameterized Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-25543-5_15openalex-snapshot
Verification of Threshold-Based Distributed Algorithms by Decomposition to Decidable Logics
inferred← citeshttps://doi.org/10.1007/978-3-030-25543-5_23openalex-snapshot
Inferring Inductive Invariants from Phase Structures
inferred← citeshttps://doi.org/10.1007/978-3-030-45237-7_10openalex-snapshot
What’s Decidable About Program Verification Modulo Axioms?
inferred← citeshttps://doi.org/10.1007/978-3-030-65474-0_6openalex-snapshot
Stratified Guarded First-Order Transition Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-65610-2_3openalex-snapshot
Reliability and Security for Safety-Critical Service Compositions
inferred← citeshttps://doi.org/10.1007/978-3-030-67087-0_14openalex-snapshot
Verifying Safety of Parameterized Heard-Of Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-030-76384-8_16openalex-snapshot
Verification of Eventual Consensus in Synod Using a Failure-Aware Actor Model
inferred← citeshttps://doi.org/10.1007/978-3-030-78089-0_13openalex-snapshot
Formal Verification of HotStuff
inferred← citeshttps://doi.org/10.1007/978-3-030-81688-9_16openalex-snapshot
Sound Verification Procedures for Temporal Properties of Infinite-State Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-99336-8_5openalex-snapshot
Why3-do: The Way of Harmonious Distributed System Proofs
inferred← citeshttps://doi.org/10.1007/978-3-030-99524-9_18openalex-snapshot
Inferring Invariants with Quantifier Alternations: Taming the Search Space Explosion
inferred← citeshttps://doi.org/10.1007/978-3-031-30044-8_13openalex-snapshot
Quorum Tree Abstractions of Consensus Protocols
inferred← citeshttps://doi.org/10.1007/978-3-031-60698-4_6openalex-snapshot
Verifying a C Implementation of Derecho’s Coordination Mechanism Using VST and Coq
inferred← citeshttps://doi.org/10.1007/978-3-031-62645-6_9openalex-snapshot
Formally Verifying a Rollback-Prevention Protocol for TEEs
inferred← citeshttps://doi.org/10.1007/978-3-031-65627-9_13openalex-snapshot
Toward Liveness Proofs at Scale
inferred← citeshttps://doi.org/10.1007/978-3-031-65630-9_4openalex-snapshot
mypyvy: A Research Platform for Verification of Transition Systems in First-Order Logic
inferred← citeshttps://doi.org/10.1007/978-3-031-65630-9_5openalex-snapshot
Efficient Implementation of an Abstract Domain of Quantified First-Order Formulas
inferred← citeshttps://doi.org/10.1007/978-3-031-78709-6_7openalex-snapshot
Proving Cutoff Bounds for Safety Properties in First-Order Logic
inferred← citeshttps://doi.org/10.1007/978-3-031-90643-5_20openalex-snapshot
Implicit Rankings for Verifying Liveness Properties in First-Order Logic
inferred← citeshttps://doi.org/10.1007/978-3-031-98682-6_2openalex-snapshot
Veil: A Framework for Automated and Interactive Verification of Transition Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-77935-5_5openalex-snapshot
Simpler Specifications and Easier Proofs of Distributed Algorithms Using History Variables
inferred← citeshttps://doi.org/10.1007/978-3-319-77935-5_8openalex-snapshot
Verification of Fault-Tolerant Protocols with Sally
inferred← citeshttps://doi.org/10.1007/978-3-319-89884-1_32openalex-snapshot
Paxos Consensus, Deconstructed and Abstracted
inferred← citeshttps://doi.org/10.1007/978-3-319-96145-3_11openalex-snapshot
Eager Abstraction for Symbolic Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-319-99725-4_4openalex-snapshot
Deductive Verification in Decidable Fragments with Ivy
inferred← citeshttps://doi.org/10.1007/978-3-319-99725-4_7openalex-snapshot
Interactive Verification of Distributed Protocols Using Decidable Logic
inferred← citeshttps://doi.org/10.1007/s10009-020-00603-xopenalex-snapshot
Verification of randomized consensus algorithms under round-rigid adversaries
inferred← citeshttps://doi.org/10.1007/s10703-022-00404-9openalex-snapshot
Stratified guarded first-order transition systems
inferred← citeshttps://doi.org/10.1007/s11334-022-00460-8openalex-snapshot
Regularity and quantification: a new approach to verify distributed protocols
inferred← citeshttps://doi.org/10.1007/s11334-022-00463-5openalex-snapshot
Eventual consensus in Synod: verification using a failure-aware actor model
inferred← citeshttps://doi.org/10.1016/j.ipl.2024.106488openalex-snapshot
Prenex universal first-order safety properties
inferred← citeshttps://doi.org/10.1016/j.jlamp.2019.02.004openalex-snapshot
Automated test case generation for the Paxos single-decree protocol using a Coloured Petri Net model
inferred← citeshttps://doi.org/10.1016/j.scico.2025.103352openalex-snapshot
Auto-active verification of distributed systems and specification refinements with Why3-do
inferred← citeshttps://doi.org/10.1016/j.sysarc.2022.102646openalex-snapshot
Verifying the safety properties of distributed systems via mergeable parallelism
inferred← citeshttps://doi.org/10.1109/csf.2018.00025openalex-snapshot
Inductive Invariants for Noninterference in Multi-agent Workflows
inferred← citeshttps://doi.org/10.1109/dsn64029.2025.00028openalex-snapshot
ReCraft: Self-Contained Split, Merge, and Membership Change of Raft Protocol
inferred← citeshttps://doi.org/10.1109/sp46214.2022.9833661openalex-snapshot
HAMRAZ: Resilient Partitioning and Replication
inferred← citeshttps://doi.org/10.1109/tnse.2026.3674834openalex-snapshot
Multimessage Paxos With Priorities and Aging for Blockchain Applications
inferred← citeshttps://doi.org/10.1145/3158098openalex-snapshot
Foundations for natural proofs and quantifier instantiation
inferred← citeshttps://doi.org/10.1145/3158114openalex-snapshot
Reducing liveness to safety in first-order logic
inferred← citeshttps://doi.org/10.1145/3158116openalex-snapshot
Programming and proving with distributed protocols
inferred← citeshttps://doi.org/10.1145/3192366.3192414openalex-snapshot
Modularity for decidability of deductive verification with applications to distributed systems
inferred← citeshttps://doi.org/10.1145/3276534openalex-snapshot
Safe replication through bounded concurrency verification
inferred← citeshttps://doi.org/10.1145/3290372openalex-snapshot
Pretend synchrony: synchronous verification of asynchronous distributed programs
inferred← citeshttps://doi.org/10.1145/3296979.3192414openalex-snapshot
Modularity for decidability of deductive verification with applications to distributed systems
inferred← citeshttps://doi.org/10.1145/3341301.3359636openalex-snapshot
Fast and secure global payments with Stellar
inferred← citeshttps://doi.org/10.1145/3354166.3354180openalex-snapshot
Moderately Complex Paxos Made Simple
inferred← citeshttps://doi.org/10.1145/3360564openalex-snapshot
Asphalion: trustworthy shielding against Byzantine faults
inferred← citeshttps://doi.org/10.1145/3385412.3385980openalex-snapshot
Inductive sequentialization of asynchronous programs
inferred← citeshttps://doi.org/10.1145/3385412.3386018openalex-snapshot
First-order quantified separators
inferred← citeshttps://doi.org/10.1145/3428278openalex-snapshot
Testing consensus implementations using communication closure
inferred← citeshttps://doi.org/10.1145/3465084.3467947openalex-snapshot
Brief Announcement: What's Live? Understanding Distributed Consensus
inferred← citeshttps://doi.org/10.1145/3485474openalex-snapshot
Much ADO about failures: a fault-aware model for compositional verification of strongly consistent distributed systems
inferred← citeshttps://doi.org/10.1145/3485534openalex-snapshot
QuickSilver: modeling and parameterized verification for distributed agreement-based systems
inferred← citeshttps://doi.org/10.1145/3497775.3503688openalex-snapshot
Formal verification of a distributed dynamic reconfiguration protocol
inferred← citeshttps://doi.org/10.1145/3498712openalex-snapshot
Induction duality: primal-dual search for invariants
inferred← citeshttps://doi.org/10.1145/3519939.3523444openalex-snapshot
Adore: atomic distributed objects with certified reconfiguration
inferred← citeshttps://doi.org/10.1145/3584684openalex-snapshot
Proceedings of the 5th workshop on Advanced tools, programming languages, and PLatforms for Implementing and Evaluating algorithms for Distributed systems
inferred← citeshttps://doi.org/10.1145/3584684.3597275openalex-snapshot
Specification and Runtime Checking of Derecho, A Protocol for Fast Replication for Cloud Services
inferred← citeshttps://doi.org/10.1145/3586033openalex-snapshot
Enabling Bounded Verification of Doubly-Unbounded Distributed Agreement-Based Systems via Bounded Regions
inferred← citeshttps://doi.org/10.1145/3600006.3613172openalex-snapshot
Grove: a Separation-Logic Library for Verifying Distributed Systems
inferred← citeshttps://doi.org/10.1145/3622864openalex-snapshot
Counterexample Driven Quantifier Instantiations with Applications to Distributed Protocols
inferred← citeshttps://doi.org/10.1145/3622865openalex-snapshot
Historia: Refuting Callback Reachability with Message-History Logics
inferred← citeshttps://doi.org/10.1145/3632851openalex-snapshot
Trillium: Higher-Order Concurrent and Distributed Separation Logic for Intensional Refinement
inferred← citeshttps://doi.org/10.1145/3632875openalex-snapshot
An Infinite Needle in a Finite Haystack: Finding Infinite Counter-Models in Deductive Verification
inferred← citeshttps://doi.org/10.1145/3694715.3695952openalex-snapshot
Verus: A Practical Foundation for Systems Verification
inferred← citeshttps://doi.org/10.1145/3704853openalex-snapshot
Axe ’Em: Eliminating Spurious States with Induction Axioms
inferred← citeshttps://doi.org/10.1145/3720502openalex-snapshot
Bolt-On Strong Consistency: Specification, Implementation, and Verification
inferred← citeshttps://doi.org/10.1145/3798209openalex-snapshot
Specy: Learning Specifications for Distributed Systems from Event Traces
inferred← citeshttps://doi.org/10.1145/3798259openalex-snapshot
Effectively Propositional Higher-Order Functional Programming
inferred← citeshttps://doi.org/10.1145/3830418.3843876openalex-snapshot
I3DP: Neuro-Symbolic Inductive Invariant Inference for Distributed Protocols
inferred← citeshttps://doi.org/10.2139/ssrn.5194144openalex-snapshot
Memory consistency models made EPR :Decidable verification of a fragment of the Promising Semantics
inferred← citeshttps://doi.org/10.23638/lmcs-15(3:18)2019openalex-snapshot
Bounded Quantifier Instantiation for Checking Inductive Invariants
inferred← citeshttps://doi.org/10.23919/fmcad.2018.8603010openalex-snapshot
Deductive Verification of Distributed Protocols in First-Order Logic
inferred← citeshttps://doi.org/10.23919/ifipnetworking70592.2026.11579070openalex-snapshot
JADE: Just A Deterministic Emulator to Support the Verification of Protocol Implementations
inferred← citeshttps://doi.org/10.3384/diss.diva-173568openalex-snapshot
Parameterized Verification of Synchronized Concurrent Programs
inferred← citeshttps://doi.org/10.34727/2021/isbn.978-3-85448-046-4_20openalex-snapshot
Towards an Automatic Proof of Lamport's Paxos
inferred← citeshttps://doi.org/10.4018/ijapuc.2019100102openalex-snapshot
Local and Remote Recovery of Cloud Services Using Backward Atomic Backup Recovery Technique for High Availability in Strongly Consistent Cloud Service
inferred← citeshttps://doi.org/10.4204/eptcs.393.10openalex-snapshot
Verification of GossipSub in ACL2s
inferred← citeshttps://doi.org/10.48550/arxiv.1704.00082openalex-snapshot
Moderately Complex Paxos Made Simple: High-Level Executable Specification of Distributed Algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.1802.05969openalex-snapshot
Paxos Consensus, Deconstructed and Abstracted (Extended Version)
inferred← citeshttps://doi.org/10.48550/arxiv.1903.03501openalex-snapshot
Certifying Safety when Implementing Consensus
inferred← citeshttps://doi.org/10.48550/arxiv.2001.04787openalex-snapshot
What's Live? Understanding Distributed Consensus
inferred← citeshttps://doi.org/10.48550/arxiv.2004.04613openalex-snapshot
QuickSilver: A Modeling and Parameterized Verification Framework for Systems with Distributed Agreement (Extended Version)
inferred← citeshttps://doi.org/10.48550/arxiv.2011.02413openalex-snapshot
Probabilistic Bisimulation for Parameterized Systems (Technical Report)
inferred← citeshttps://doi.org/10.48550/arxiv.2109.12616openalex-snapshot
Rabia: Simplifying State-Machine Replication Through Randomization
inferred← citeshttps://doi.org/10.70675/6a415ed3z09a7z4be9zb69ez54453f1311a0openalex-snapshot
Propriété du domaine borné pour la logique temporelle linéaire du premier ordre et applications à la vérification de systèmes à états infinis
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.