On the public citation graph
IronFleet
0 signed · 79 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/978-3-540-78800-3_24openalex-snapshot
Z3: An Efficient SMT Solver
inferredcites →https://doi.org/10.1007/978-3-642-15057-9_12openalex-snapshot
The Next 700 Separation Logics
inferredcites →https://doi.org/10.1007/978-3-642-17511-4_20openalex-snapshot
Dafny: An Automatic Program Verifier for Functional Correctness
inferredcites →https://doi.org/10.1007/978-94-011-1793-7_4openalex-snapshot
Assigning Meanings to Programs
inferredcites →https://doi.org/10.1023/a:1022969405325openalex-snapshot
Checking Cache-Coherence Protocols with TLA+
inferredcites →https://doi.org/10.1109/dsn.2014.45openalex-snapshot
Developing Correctly Replicated Databases Using Formal Tools
inferredcites →https://doi.org/10.1145/1066100.1066102openalex-snapshot
Simplify: a theorem prover for program checking
inferredcites →https://doi.org/10.1145/1480881.1480934openalex-snapshot
Verifying distributed systems
inferredcites →https://doi.org/10.1145/1594834.1480934openalex-snapshot
Verifying distributed systems
inferredcites →https://doi.org/10.1145/2185376.2185383openalex-snapshot
Using lightweight modeling to understand chord
inferredcites →https://doi.org/10.1145/2517349.2517350openalex-snapshot
There is more consensus in Egalitarian parliaments
inferredcites →https://doi.org/10.1145/2560537openalex-snapshot
Comprehensive formal verification of an OS microkernel
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/2854065.2854081openalex-snapshot
Planning for change in a formal verification of the raft consensus protocol
inferredcites →https://doi.org/10.1145/3149.214121openalex-snapshot
Impossibility of distributed consensus with one faulty process
inferredcites →https://doi.org/10.1145/363235.363259openalex-snapshot
An axiomatic basis for computer programming
inferredcites →https://doi.org/10.2307/2002914openalex-snapshot
Proceedings of Symposia in Applied Mathematics.
inferredcites →https://doi.org/10.5555/2685048.2685062openalex-snapshot
Ironclad apps: end-to-end security via automated full-system verification
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-17184-1_2openalex-snapshot
Meta-F $$^\star $$ : Proof Automation with SMT, Tactics, and Metaprograms
inferred← citeshttps://doi.org/10.1007/978-3-030-17465-1_20openalex-snapshot
Verifying Safety of Synchronous Fault-Tolerant Algorithms by Bounded Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-030-25543-5_20openalex-snapshot
Communication-Closed Asynchronous Protocols
inferred← citeshttps://doi.org/10.1007/978-3-030-48077-6_14openalex-snapshot
Formal Distributed Protocol Development for Reservation of Railway Sections
inferred← citeshttps://doi.org/10.1007/978-3-030-50086-3_11openalex-snapshot
Tutorial: Parameterized Verification with Byzantine Model Checker
inferred← citeshttps://doi.org/10.1007/978-3-030-55754-6_2openalex-snapshot
Generating Correct-by-Construction Distributed Implementations from Formal Maude Designs
inferred← citeshttps://doi.org/10.1007/978-3-030-67067-2_10openalex-snapshot
Eliminating Message Counters in Synchronous Threshold Automata
inferred← citeshttps://doi.org/10.1007/978-3-030-67087-0_21openalex-snapshot
Cutoffs for Symmetric Point-to-Point Distributed 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-031-06773-0_23openalex-snapshot
More Programming Than Programming: Teaching Formal Methods in a Software Engineering Programme
inferred← citeshttps://doi.org/10.1007/978-3-031-44274-2_14openalex-snapshot
Invited Paper: Monotonicity and Opportunistically-Batched Actions in Derecho
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-65627-9_13openalex-snapshot
Toward Liveness Proofs at Scale
inferred← citeshttps://doi.org/10.1007/978-3-031-71162-6_33openalex-snapshot
Parameterized Verification of Round-Based Distributed Algorithms via Extended Threshold Automata
inferred← citeshttps://doi.org/10.1007/978-3-031-88574-7_2openalex-snapshot
Toward Formal Correctness Envelopes for Dynamic Data-Driven Aerospace Systems
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-032-22749-2_18openalex-snapshot
Verifying First-Order Temporal Properties of Infinite-State Systems via Timers and Rankings
inferred← citeshttps://doi.org/10.1007/978-3-032-32592-1_17openalex-snapshot
Verification of Configurable SRA Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-89884-1_22openalex-snapshot
Velisarios: Byzantine Fault-Tolerant Protocols Powered by Coq
inferred← citeshttps://doi.org/10.1007/s00165-021-00567-yopenalex-snapshot
A refinement-based development of a distributed signalling system
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/s10009-021-00637-9openalex-snapshot
Verifying safety of synchronous fault-tolerant algorithms by bounded model checking
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.scico.2024.103184openalex-snapshot
Formal verification of timely knowledge propagation in airborne networks
inferred← citeshttps://doi.org/10.1109/icse55347.2025.00166openalex-snapshot
Formally Verified Cloud-Scale Authorization
inferred← citeshttps://doi.org/10.1109/icst60714.2024.00044openalex-snapshot
Randomised Testing of the Compiler for a Verification-Aware Programming Language
inferred← citeshttps://doi.org/10.1109/icst62969.2025.10988954openalex-snapshot
Compiler Fuzzing in Continuous Integration: A Case Study on Dafny
inferred← citeshttps://doi.org/10.1109/milcom52596.2021.9653032openalex-snapshot
DerechoDDS: Strongly Consistent Data Distribution for Mission-Critical Applications
inferred← citeshttps://doi.org/10.1109/tnsm.2021.3125395openalex-snapshot
Real-Time Multiple-Workflow Scheduling in Cloud Environments
inferred← citeshttps://doi.org/10.1145/3328778.3366957openalex-snapshot
Formal Methods and Computing Identity-based Mentorship for Early Stage Researchers
inferred← citeshttps://doi.org/10.1145/3360564openalex-snapshot
Asphalion: trustworthy shielding against Byzantine faults
inferred← citeshttps://doi.org/10.1145/3575693.3575695openalex-snapshot
Compiling Distributed System Models with PGo
inferred← citeshttps://doi.org/10.1145/3591235openalex-snapshot
Performal: Formal Verification of Latency Properties for Distributed Systems
inferred← citeshttps://doi.org/10.1145/3600006.3613154openalex-snapshot
Halfmoon: Log-Optimal Fault-Tolerant Stateful Serverless Computing
inferred← citeshttps://doi.org/10.1145/3607859openalex-snapshot
Verifying Reliable Network Components in a Distributed Separation Logic with Dependent Separation Protocols
inferred← citeshttps://doi.org/10.1145/3622864openalex-snapshot
Counterexample Driven Quantifier Instantiations with Applications to Distributed Protocols
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/3642976.3653036openalex-snapshot
Models for Storage in Database Backends
inferred← citeshttps://doi.org/10.1145/3656446openalex-snapshot
Foundational Integration Verification of a Cryptographic Server
inferred← citeshttps://doi.org/10.1145/3725985openalex-snapshot
Efficient Fault Tolerance for Stateful Serverless Computing with Asymmetric Logging
inferred← citeshttps://doi.org/10.1145/3763119openalex-snapshot
A Refinement Methodology for Distributed Programs in Rust
inferred← citeshttps://doi.org/10.1145/3763128openalex-snapshot
TraceLinking Implementations with Their Verified Designs
inferred← citeshttps://doi.org/10.4204/eptcs.348.5openalex-snapshot
Formal Guarantees of Timely Progress for Distributed Knowledge Propagation
inferred← citeshttps://doi.org/10.46298/lmcs-19(1:5)2023openalex-snapshot
Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker
inferred← citeshttps://doi.org/10.48550/arxiv.1803.06547openalex-snapshot
Meta-F*: Proof Automation with SMT, Tactics, and Metaprograms
inferred← citeshttps://doi.org/10.48550/arxiv.2109.12616openalex-snapshot
Rabia: Simplifying State-Machine Replication Through Randomization
inferred← citeshttps://doi.org/10.5281/zenodo.10100891openalex-snapshot
Trillium: Higher-Order Concurrent and Distributed Separation Logic for Intensional Refinement - Coq Artifact
inferred← citeshttps://doi.org/10.54337/aau588616986openalex-snapshot
Quantitative Verification and Synthesis of Resilient Networks
inferred← citeshttps://doi.org/10.5555/3291168.3291191openalex-snapshot
Verifying concurrent software using movers in CSPEC
inferred← citeshttps://doi.org/10.70675/7c2565b1z1cb0z4a01za239z032e5c0d8182openalex-snapshot
Parameterized verification of distributed shared-memory systems
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.