On the public citation graph
A proof of burns N-process mutual exclusion algorithm using abstraction
0 signed · 37 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-52148-8_6openalex-snapshot
Verifying properties of large sets of processes with network invariants
inferredcites →https://doi.org/10.1007/3-540-52559-9_74openalex-snapshot
Analysis of discrete event coordination
inferredcites →https://doi.org/10.1007/3-540-56922-7_25openalex-snapshot
Computer-assisted simulation proofs
inferredcites →https://doi.org/10.1007/3-540-60045-0_40openalex-snapshot
Model checking for infinite state systems using data abstraction, assumption-commitment style reasoning and theorem proving
inferredcites →https://doi.org/10.1007/3-540-60630-0_1openalex-snapshot
Combining model checking and deduction for I/O- automata
inferredcites →https://doi.org/10.1007/978-1-4612-2704-5openalex-snapshot
Larch: Languages and Tools for Formal Specification
inferredcites →https://doi.org/10.1007/bf01384313openalex-snapshot
Property preserving abstractions for the verification of concurrent systems
inferredcites →https://doi.org/10.1007/bfb0020949openalex-snapshot
UPPAAL — a tool suite for automatic verification of real-time systems
inferredcites →https://doi.org/10.1109/sfcs.1995.492576openalex-snapshot
Computing simulations on finite and infinite graphs
inferredcites →https://doi.org/10.1145/3788687openalex-snapshot
An Introduction to Input/Output Automata
inferredcites →https://doi.org/10.1145/41840.41852openalex-snapshot
Hierarchical correctness proofs for distributed algorithms
inferredcites →https://doi.org/10.1145/72981.72998openalex-snapshot
A structural induction theorem for processes
inferredcites →https://doi.org/10.6100/ir462072openalex-snapshot
Abstract interpretation and partition refinement for model checking
inferredcites →https://doi.org/10.7146/brics.v3i58.18769openalex-snapshot
UPPAAL—a Tool Suite for Automatic Verification of Real–Time Systems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/10722167_26openalex-snapshot
Liveness and Acceleration in Parameterized Verification
inferred← citeshttps://doi.org/10.1007/3-540-36577-x_8openalex-snapshot
Decidability of Invariant Validation for Paramaterized Systems
inferred← citeshttps://doi.org/10.1007/3-540-44585-4_19openalex-snapshot
Parameterized Verification with Automatically Computed Inductive Assertions?
inferred← citeshttps://doi.org/10.1007/3-540-45319-9_7openalex-snapshot
Automatic Deductive Verification with Invisible Invariants
inferred← citeshttps://doi.org/10.1007/3-540-48683-6_14openalex-snapshot
Handling Global Conditions in Parametrized System Verification
inferred← citeshttps://doi.org/10.1007/978-3-030-45190-5_13openalex-snapshot
Structural Invariants for the Verification of Systems with Parameterized Architectures
inferred← citeshttps://doi.org/10.1007/978-3-030-76983-3_8openalex-snapshot
Computing Parameterized Invariants of Parameterized Petri Nets
inferred← citeshttps://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
inferred← citeshttps://doi.org/10.1007/978-3-642-15898-8_12openalex-snapshot
A Study of Shared-Memory Mutual Exclusion Protocols Using CADP
inferred← citeshttps://doi.org/10.1007/s10703-017-0297-4openalex-snapshot
Para $$^2$$ 2 : parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms
inferred← citeshttps://doi.org/10.1016/j.cl.2004.02.006openalex-snapshot
Model checking and abstraction to the aid of parameterized systems (a survey)
inferred← citeshttps://doi.org/10.1016/j.scico.2012.01.003openalex-snapshot
Model checking and performance evaluation with CADP illustrated on shared-memory mutual exclusion protocols
inferred← citeshttps://doi.org/10.1109/cyberneticscom.2016.7892576openalex-snapshot
A formal model of quorum based k-mutex algorithm using input/output automata
inferred← citeshttps://doi.org/10.1109/sefm.2003.1236224openalex-snapshot
Light-weight theorem proving for debugging and verifying units of code
inferred← citeshttps://doi.org/10.15589/znp2020.1(479).10openalex-snapshot
A SURVEY OF PARAMETRIC MODEL VERIFICATION METHODS
inferred← citeshttps://doi.org/10.2200/s00658ed1v01y201508dct013openalex-snapshot
Decidability of Parameterized Verification
inferred← citeshttps://doi.org/10.26226/morressier.604907f51a80aac83ca25d93openalex-snapshot
Structural Invariants for the Verification of Systems with Parameterized Architectures
inferred← citeshttps://doi.org/10.3233/fi-222137openalex-snapshot
Computing Parameterized Invariants of Parameterized Petri Nets
inferred← citeshttps://doi.org/10.48550/arxiv.1902.02696openalex-snapshot
Structural Invariants for Parametric Verification of Systems with Almost Linear Architectures
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.