On the public citation graph

Reduction in TLA

0 signed · 65 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/bf00268134openalex-snapshot
An axiomatic proof technique for parallel programs I
inferredcites →https://doi.org/10.1016/0020-0190(85)90056-0openalex-snapshot
Defining liveness
inferredcites →https://doi.org/10.1016/0020-0190(87)90207-9openalex-snapshot
A note of Graham's convex hull algorithm
inferredcites →https://doi.org/10.1016/0304-3975(91)90224-popenalex-snapshot
The existence of refinement mappings
inferredcites →https://doi.org/10.1145/177492.177726openalex-snapshot
The temporal logic of actions
inferredcites →https://doi.org/10.1145/361227.361234openalex-snapshot
Reduction
inferredcites →https://doi.org/10.1145/512950.512965openalex-snapshot
Parallel program correctness through refinement

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9781118602638.ch7openalex-snapshot
Verification of Finite‐State Systems
inferred← citeshttps://doi.org/10.1007/10722468_14openalex-snapshot
Model-Checking Multi-threaded Distributed Java Programs
inferred← citeshttps://doi.org/10.1007/11562948_17openalex-snapshot
Syntactical Colored Petri Nets Reductions
inferred← citeshttps://doi.org/10.1007/11576235_31openalex-snapshot
Lock-Free Parallel Garbage Collection
inferred← citeshttps://doi.org/10.1007/3-540-36577-x_36openalex-snapshot
Optimistic Synchronization-Based State-Space Reduction
inferred← citeshttps://doi.org/10.1007/3-540-45442-x_8openalex-snapshot
Eternity Variables to Simulate Specifications
inferred← citeshttps://doi.org/10.1007/978-0-387-21798-7_3openalex-snapshot
Asynchronous progress
inferred← citeshttps://doi.org/10.1007/978-0-387-21798-7_4openalex-snapshot
A reduction theorem for concurrent object-oriented programs
inferred← citeshttps://doi.org/10.1007/978-1-4471-5355-9_12openalex-snapshot
Non-atomic Refinement
inferred← citeshttps://doi.org/10.1007/978-1-4614-4881-5_1openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1007/978-1-4614-4881-5_6openalex-snapshot
Programs, Semantics and Effective Atomicity
inferred← citeshttps://doi.org/10.1007/978-3-030-76983-3_9openalex-snapshot
On the Combination of Polyhedral Abstraction and SMT-Based Model Checking for Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-319-17404-4_9openalex-snapshot
Combining Separation Logic and Projection Temporal Logic to Reason About Non-blocking Concurrency
inferred← citeshttps://doi.org/10.1007/978-3-319-45943-1_14openalex-snapshot
Verification by Way of Refinement: A Case Study in the Use of Coq and TLA in the Design of a Safety Critical System
inferred← citeshttps://doi.org/10.1007/978-3-319-48869-1_3openalex-snapshot
Order Reduction for Multi-core Interruptible Operating Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-52234-0_14openalex-snapshot
Dynamic Reductions for Model Checking Concurrent Software
inferred← citeshttps://doi.org/10.1007/978-3-319-77935-5_20openalex-snapshot
Stubborn Transaction Reduction
inferred← citeshttps://doi.org/10.1007/978-3-540-24732-6_18openalex-snapshot
Verifying Commit-Atomicity Using Model-Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-24732-6_20openalex-snapshot
Verification of MPI-Based Software for Scientific Computation
inferred← citeshttps://doi.org/10.1007/978-3-540-68855-6_6openalex-snapshot
Adapting Petri Nets Reductions to Promela Specifications
inferred← citeshttps://doi.org/10.1007/978-3-540-70952-7_24openalex-snapshot
Distributed Colored Petri Net Model-Checking with Cyclades
inferred← citeshttps://doi.org/10.1007/978-3-540-87873-5_19openalex-snapshot
Formal Functional Verification of Device Drivers
inferred← citeshttps://doi.org/10.1007/s10009-002-0077-2openalex-snapshot
inferred← citeshttps://doi.org/10.1007/s10703-006-0003-4openalex-snapshot
Optimistic synchronization-based state-space reduction
inferred← citeshttps://doi.org/10.1007/s12046-009-0004-2openalex-snapshot
Proving the correctness of client/server software
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.02.016openalex-snapshot
Trace-based Derivation of a Lock-Free Queue Algorithm
inferred← citeshttps://doi.org/10.1016/j.scico.2006.10.001openalex-snapshot
Lock-free parallel and concurrent garbage collection by mark&sweep
inferred← citeshttps://doi.org/10.1016/j.scico.2007.12.001openalex-snapshot
Atomizer: A dynamic atomicity checker for multithreaded programs
inferred← citeshttps://doi.org/10.1016/j.scico.2009.09.006openalex-snapshot
Simulation refinement for concurrency verification
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)82560-5openalex-snapshot
Transactions for Software Model Checking
inferred← citeshttps://doi.org/10.1109/hldvt.2010.5496650openalex-snapshot
Utility of transaction-level hardware models in refinement checking
inferred← citeshttps://doi.org/10.1109/iceccs.2007.39openalex-snapshot
Reasoning about Nonblocking Concurrency using Reduction
inferred← citeshttps://doi.org/10.1109/ipdps.2004.1303345openalex-snapshot
Atomizer: a dynamic atomicity checker for multithreaded programs (summary)
inferred← citeshttps://doi.org/10.1109/secpri.2002.1004370openalex-snapshot
Noninterference and intrusion detection
inferred← citeshttps://doi.org/10.1109/tse.2005.47openalex-snapshot
Exploiting purity for atomicity
inferred← citeshttps://doi.org/10.1142/s0129626406002502openalex-snapshot
New Efficient Petri Nets Reductions for Parallel Programs Verification
inferred← citeshttps://doi.org/10.1145/1007512.1007543openalex-snapshot
Exploiting purity for atomicity
inferred← citeshttps://doi.org/10.1145/1042038.1042044openalex-snapshot
Eternity variables to prove simulation of specifications
inferred← citeshttps://doi.org/10.1145/1377492.1377495openalex-snapshot
Types for atomicity
inferred← citeshttps://doi.org/10.1145/1889997.1890001openalex-snapshot
Mechanically verified proof obligations for linearizability
inferred← citeshttps://doi.org/10.1145/2815400.2815428openalex-snapshot
IronFleet
inferred← citeshttps://doi.org/10.1145/3290372openalex-snapshot
Pretend synchrony: synchronous verification of asynchronous distributed programs
inferred← citeshttps://doi.org/10.1145/3360549openalex-snapshot
TLA+ model checking made symbolic
inferred← citeshttps://doi.org/10.1145/3385412.3385971openalex-snapshot
Armada: low-effort verification of high-performance concurrent programs
inferred← citeshttps://doi.org/10.1145/3428224openalex-snapshot
The anchor verifier for blocking and non-blocking concurrent software
inferred← citeshttps://doi.org/10.1145/3492545openalex-snapshot
Prophecy Made Simple
inferred← citeshttps://doi.org/10.1145/3502491openalex-snapshot
Armada: Automated Verification of Concurrent Code with Sound Semantic Extensibility
inferred← citeshttps://doi.org/10.1145/604174.604176openalex-snapshot
Types for atomicity
inferred← citeshttps://doi.org/10.1145/780822.781169openalex-snapshot
A type and effect system for atomicity
inferred← citeshttps://doi.org/10.1145/964001.964023openalex-snapshot
Atomizer
inferred← citeshttps://doi.org/10.22028/d291-26559openalex-snapshot
Ownership-based order reduction and simulation in shared-memory concurrent computer systems
inferred← citeshttps://doi.org/10.22028/d291-26653openalex-snapshot
Store buffer reduction theorem and application
inferred← citeshttps://doi.org/10.3217/jucs-015-01-0072openalex-snapshot
Reasoning about Nonblocking Concurrency
inferred← citeshttps://doi.org/10.3233/fun-2000-441-202openalex-snapshot
A Foundation for Refining Concurrent Objects
inferred← citeshttps://doi.org/10.46298/fi.8831openalex-snapshot
A Polyhedral Abstraction for Petri nets and its Application to SMT-Based Model Checking
inferred← citeshttps://doi.org/10.48456/tr-726openalex-snapshot
Modular fine-grained concurrency verification
inferred← citeshttps://doi.org/10.48550/arxiv.1802.02685openalex-snapshot
Stubborn Transaction Reduction (with Proofs)
inferred← citeshttps://doi.org/10.5381/jot.2004.3.6.a4openalex-snapshot
Checking Concise Specifications for Multithreaded Software.
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.