On the public citation graph

Verifying distributed programs via canonical sequentialization

0 signed · 86 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/3-540-44585-4_19openalex-snapshot
Parameterized Verification with Automatically Computed Inductive Assertions?
inferredcites →https://doi.org/10.1007/3-540-45319-9_7openalex-snapshot
Automatic Deductive Verification with Invisible Invariants
inferredcites →https://doi.org/10.1007/3-540-45657-0_9openalex-snapshot
Liveness with (0,1, ∞)- Counter Abstraction
inferredcites →https://doi.org/10.1007/3-540-48153-2_17openalex-snapshot
Verification of Infinite State Systems by Compositional Model Checking
inferredcites →https://doi.org/10.1007/3-540-57208-2_35openalex-snapshot
Types for dyadic interaction
inferredcites →https://doi.org/10.1007/3-540-60761-7openalex-snapshot
Partial-Order Methods for the Verification of Concurrent Systems
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-540-30579-8_27openalex-snapshot
Efficient Verification of Halting Properties for MPI Programs with Wildcard Receives
inferredcites →https://doi.org/10.1007/978-3-642-18275-4_2openalex-snapshot
Formal Analysis of Message Passing
inferredcites →https://doi.org/10.1007/978-3-642-19835-9_31openalex-snapshot
Boosting Lazy Abstraction for SystemC with Partial Order Reduction
inferredcites →https://doi.org/10.1007/978-3-642-27940-9_5openalex-snapshot
Synchronizability for Verification of Asynchronously Communicating Systems
inferredcites →https://doi.org/10.1007/978-3-642-30793-5_14openalex-snapshot
TransDPOR: A Novel Dynamic Partial-Order Reduction Technique for Testing Actor Programs
inferredcites →https://doi.org/10.1007/978-3-642-32096-5_7openalex-snapshot
Parallel and Concurrent Programming in Haskell
inferredcites →https://doi.org/10.1007/978-3-642-33125-1_12openalex-snapshot
Invariant Generation for Parametrized Systems Using Self-reflection
inferredcites →https://doi.org/10.1007/978-3-642-33518-1_37openalex-snapshot
Verification of MPI Programs Using Session Types
inferredcites →https://doi.org/10.1007/978-3-642-38856-9_24openalex-snapshot
Automatic Verification of Erlang-Style Concurrency
inferredcites →https://doi.org/10.1007/978-3-642-38856-9_8openalex-snapshot
On Solving Universally Quantified Horn Clauses
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-48288-9_13openalex-snapshot
A Simple Abstraction of Arrays and Maps by Program Translation
inferredcites →https://doi.org/10.1007/978-3-662-49498-1_27openalex-snapshot
Actor Services
inferredcites →https://doi.org/10.1007/bf00625968openalex-snapshot
Better verification through symmetry
inferredcites →https://doi.org/10.1016/0304-3975(91)90224-popenalex-snapshot
The existence of refinement mappings
inferredcites →https://doi.org/10.1016/j.scico.2015.10.006openalex-snapshot
Parameterized, concurrent session types for asynchronous multi-actor interactions
inferredcites →https://doi.org/10.1109/fmcad.2013.6679412openalex-snapshot
Verifying multi-threaded software with impact
inferredcites →https://doi.org/10.1145/1040305.1040315openalex-snapshot
Dynamic partial-order reduction for model checking software
inferredcites →https://doi.org/10.1145/1065944.1065957openalex-snapshot
Modeling wildcard-free MPI programs for verification
inferredcites →https://doi.org/10.1145/1291151.1291171openalex-snapshot
McErlang
inferredcites →https://doi.org/10.1145/1328438.1328472openalex-snapshot
Multiparty asynchronous session types
inferredcites →https://doi.org/10.1145/1480881.1480885openalex-snapshot
A calculus of atomic actions
inferredcites →https://doi.org/10.1145/1594834.1480885openalex-snapshot
A calculus of atomic actions
inferredcites →https://doi.org/10.1145/1596638.1596641openalex-snapshot
Losing functions without gaining data
inferredcites →https://doi.org/10.1145/1941553.1941603openalex-snapshot
Automatic formal verification of MPI-based parallel programs
inferredcites →https://doi.org/10.1145/2034675.2034690openalex-snapshot
Towards Haskell in the cloud
inferredcites →https://doi.org/10.1145/2038037.1941603openalex-snapshot
Automatic formal verification of MPI-based parallel programs
inferredcites →https://doi.org/10.1145/2414639.2414658openalex-snapshot
Soter
inferredcites →https://doi.org/10.1145/2535838.2535845openalex-snapshot
Optimal dynamic partial order reduction
inferredcites →https://doi.org/10.1145/2535838.2535885openalex-snapshot
Proofs that count
inferredcites →https://doi.org/10.1145/2660193.2660211openalex-snapshot
Natural proofs for asynchronous programs using almost-synchronous reductions
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/2786805.2786861openalex-snapshot
Systematic testing of asynchronous reactive systems
inferredcites →https://doi.org/10.1145/2827695openalex-snapshot
Multiparty Asynchronous Session Types
inferredcites →https://doi.org/10.1145/2837614.2837634openalex-snapshot
Effects as sessions, sessions as effects
inferredcites →https://doi.org/10.1145/2837614.2837650openalex-snapshot
PSync: a partially synchronous language for fault-tolerant distributed algorithms
inferredcites →https://doi.org/10.1145/2892208.2892232openalex-snapshot
Static deadlock detection for concurrent go by global session graph synthesis
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/317636.317908openalex-snapshot
Verification of Erlang programs using abstract interpretation and model checking
inferredcites →https://doi.org/10.1145/361227.361234openalex-snapshot
Reduction
inferredcites →https://doi.org/10.1145/512950.512973openalex-snapshot
Abstract interpretation
inferredcites →https://doi.org/10.1145/780822.781169openalex-snapshot
A type and effect system for atomicity
inferredcites →https://doi.org/10.1145/781131.781169openalex-snapshot
A type and effect system for atomicity
inferredcites →https://doi.org/10.1145/800055.802037openalex-snapshot
Compiling a functional language
inferredcites →https://doi.org/10.21276/ijre.2018.5.5.4openalex-snapshot
MapReduce: Simplified Data Processing on Large Cluster
inferredcites →https://doi.org/10.2168/lmcs-8(4:6)2012openalex-snapshot
Parameterised Multiparty Session Types
inferredcites →https://doi.org/10.5555/1946284.1946286openalex-snapshot
Formal analysis of message passing

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-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-25543-5_22openalex-snapshot
Verifying Asynchronous Event-Driven Programs Using Partial Abstract Transformers
inferred← citeshttps://doi.org/10.1007/978-3-030-32505-3_12openalex-snapshot
Taming Concurrency for Verification Using Multiparty Session Types
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-67067-2_10openalex-snapshot
Eliminating Message Counters in Synchronous Threshold Automata
inferred← citeshttps://doi.org/10.1007/978-3-030-88494-9_10openalex-snapshot
Diamont: Dynamic Monitoring of Uncertainty for Distributed Asynchronous Programs
inferred← citeshttps://doi.org/10.1007/978-3-030-91265-9_7openalex-snapshot
Verifying the Correctness of Distributed Systems via Mergeable Parallelism
inferred← citeshttps://doi.org/10.1007/978-3-031-25803-9_4openalex-snapshot
A Sequentialization Procedure for Fault-Tolerant Protocols
inferred← citeshttps://doi.org/10.1007/978-3-031-65630-9_3openalex-snapshot
Collective Contracts for Message-Passing Parallel Programs
inferred← citeshttps://doi.org/10.1007/978-3-032-22720-1_10openalex-snapshot
Reduction for Structured Concurrent Programs
inferred← citeshttps://doi.org/10.1007/978-3-319-96142-2_23openalex-snapshot
On the Completeness of Verifying Message Passing Programs Under Bounded Asynchrony
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/s10009-023-00717-yopenalex-snapshot
Diamont: dynamic monitoring of uncertainty for distributed asynchronous programs
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/csf61375.2024.00021openalex-snapshot
Secure Synthesis of Distributed Cryptographic Applications
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/3290372openalex-snapshot
Pretend synchrony: synchronous verification of asynchronous distributed programs
inferred← citeshttps://doi.org/10.1145/3360545openalex-snapshot
Verifying safety and accuracy of approximate parallel programs via canonical sequentialization
inferred← citeshttps://doi.org/10.1145/3360575openalex-snapshot
Formal foundations of serverless computing
inferred← citeshttps://doi.org/10.1145/3377811.3380419openalex-snapshot
Symbolic verification of message passing interface programs
inferred← citeshttps://doi.org/10.1145/3409005openalex-snapshot
TLC: temporal logic of distributed components
inferred← citeshttps://doi.org/10.1145/3490387openalex-snapshot
Verification of Distributed Systems via Sequential Emulation
inferred← citeshttps://doi.org/10.1145/3689729openalex-snapshot
FlowCert: Translation Validation for Asynchronous Dataflow via Dynamic Fractional Permissions
inferred← citeshttps://doi.org/10.1145/3789240.3829122openalex-snapshot
Towards Efficient Verification of Distributed In-Network Computing Programs
inferred← citeshttps://doi.org/10.14288/1.0392970openalex-snapshot
Dara the explorer : coverage based exploration for model checking of distributed systems in Go
inferred← citeshttps://doi.org/10.17760/d20328155openalex-snapshot
Resource-aware program analysis using observation sequences
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.1905.09996openalex-snapshot
Verifying Asynchronous Event-Driven Programs Using Partial Abstract Transformers (Extended Manuscript)
inferred← citeshttps://doi.org/10.48550/arxiv.2004.01360openalex-snapshot
Temporal Logic of Composable Distributed Components
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.