On the public citation graph

Reductions for safety proofs

https://doi.org/10.1145/3371081
0 signed · 38 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-540-78800-3_29openalex-snapshot
Peephole Partial Order Reduction
inferredcites →https://doi.org/10.1007/978-3-662-48899-7_17openalex-snapshot
Verification of Concurrent Programs Using Trace Abstraction Refinement
inferredcites →https://doi.org/10.1016/0304-3975(92)90054-jopenalex-snapshot
Defining conditional independence using collapses
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/jsac.2002.806121openalex-snapshot
Language-based information-flow security
inferredcites →https://doi.org/10.1109/tse.2005.47openalex-snapshot
Exploiting purity for atomicity
inferredcites →https://doi.org/10.1142/2563openalex-snapshot
The Book of Traces
inferredcites →https://doi.org/10.1145/1594834.1480885openalex-snapshot
A calculus of atomic actions
inferredcites →https://doi.org/10.1145/1595696.1595702openalex-snapshot
Symbolic pruning of concurrent program executions
inferredcites →https://doi.org/10.1145/2429069.2429086openalex-snapshot
Inductive data flow graphs
inferredcites →https://doi.org/10.1145/2535838.2535845openalex-snapshot
Optimal dynamic partial order reduction
inferredcites →https://doi.org/10.1145/2666356.2594305openalex-snapshot
Consolidation of queries with user-defined functions
inferredcites →https://doi.org/10.1145/2676726.2677012openalex-snapshot
Proof Spaces for Unbounded Parallelism
inferredcites →https://doi.org/10.1145/2908080.2908092openalex-snapshot
Cartesian hoare logic for verifying k-safety properties
inferredcites →https://doi.org/10.1145/3073408openalex-snapshot
Source Sets
inferredcites →https://doi.org/10.1145/361227.361234openalex-snapshot
Reduction
inferredcites →https://doi.org/10.1145/781131.781169openalex-snapshot
A type and effect system for atomicity

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-67067-2_9openalex-snapshot
Verification of Concurrent Programs Using Petri Net Unfoldings
inferred← citeshttps://doi.org/10.1007/978-3-031-24950-1_7openalex-snapshot
A Pragmatic Approach to Stateful Partial Order Reduction
inferred← citeshttps://doi.org/10.1007/978-3-031-37706-8_6openalex-snapshot
Commutativity for Concurrent Program Termination Proofs
inferred← citeshttps://doi.org/10.1007/978-3-031-45332-8_5openalex-snapshot
Better Predicates and Heuristics for Improved Commutativity Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-031-57249-4_10openalex-snapshot
Automated Software Verification of Hyperliveness
inferred← citeshttps://doi.org/10.1007/978-3-031-98682-6_18openalex-snapshot
Counterexample-Guided Commutativity
inferred← citeshttps://doi.org/10.1007/978-3-032-32519-8_2openalex-snapshot
On the Complexity of Checking Soundness of Natural Reductions
inferred← citeshttps://doi.org/10.1007/s00236-025-00504-zopenalex-snapshot
Symbolic execution for refuting ∀∃ hyperproperties
inferred← citeshttps://doi.org/10.1007/s10703-025-00482-5openalex-snapshot
Predicate abstraction for hyperliveness verification
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/lics56636.2023.10175734openalex-snapshot
Commutativity in Automated Verification
inferred← citeshttps://doi.org/10.1145/3428224openalex-snapshot
The anchor verifier for blocking and non-blocking concurrent software
inferred← citeshttps://doi.org/10.1145/3519939.3523727openalex-snapshot
Sound sequentialization for concurrent program verification
inferred← citeshttps://doi.org/10.1145/3571242openalex-snapshot
Stratified Commutativity in Verification Algorithms for Concurrent Programs
inferred← citeshttps://doi.org/10.1145/3632873openalex-snapshot
Coarser Equivalences for Causal Concurrency
inferred← citeshttps://doi.org/10.1145/3632925openalex-snapshot
Commutativity Simplifies Proofs of Parameterized Programs
inferred← citeshttps://doi.org/10.1145/3689761openalex-snapshot
Finding ∀∃ Hyperbugs using Symbolic Execution
inferred← citeshttps://doi.org/10.1145/3704870openalex-snapshot
The Decision Problem for Regular First Order Theories
inferred← citeshttps://doi.org/10.1145/3704889openalex-snapshot
Coinductive Proofs for Temporal Hyperliveness
inferred← citeshttps://doi.org/10.1145/3763130openalex-snapshot
Verifying Asynchronous Hyperproperties in Reactive Systems
inferred← citeshttps://doi.org/10.1145/3763160openalex-snapshot
Products of Recursive Programs for Hypersafety Verification
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.