On the public citation graph
On the absence of livelocks in parallel programs
0 signed · 39 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-07135-0_113openalex-snapshot
A fundamental theorem of asynchronous parallel computation
inferredcites →https://doi.org/10.1007/bf00289519openalex-snapshot
Hierarchical ordering of sequential processes
inferredcites →https://doi.org/10.1016/0304-3975(76)90032-3openalex-snapshot
Correctness of parallel programs: The Church-Rosser approach
inferredcites →https://doi.org/10.1016/0304-3975(77)90041-xopenalex-snapshot
On reduction of asynchronous systems
inferredcites →https://doi.org/10.1016/s0022-0000(69)80011-5openalex-snapshot
Parallel program schemata
inferredcites →https://doi.org/10.1016/s0022-0000(75)80018-3openalex-snapshot
Proving assertions about parallel programs
inferredcites →https://doi.org/10.1090/psapm/019/0235771openalex-snapshot
Assigning meanings to programs
inferredcites →https://doi.org/10.1109/tse.1977.229904openalex-snapshot
Proving the Correctness of Multiprocess Programs
inferredcites →https://doi.org/10.1145/321765.321782openalex-snapshot
Parallel Program Schemata and Maximal Parallelism I. Fundamental Results
inferredcites →https://doi.org/10.1145/355592.365595openalex-snapshot
Additional comments on a problem in concurrent programming control
inferredcites →https://doi.org/10.1145/357980.357989openalex-snapshot
Solution of a problem in concurrent programming control
inferredcites →https://doi.org/10.1145/360248.360251openalex-snapshot
Formal verification of parallel programs
inferredcites →https://doi.org/10.1145/362452.362486openalex-snapshot
Comments on prevention of system deadlocks
inferredcites →https://doi.org/10.1145/362759.362813openalex-snapshot
Concurrent control with “readers” and “writers”
inferredcites →https://doi.org/10.1145/365559.365617openalex-snapshot
Solution of a problem in concurrent programming control
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11561927_5openalex-snapshot
On Conspiracies and Hyperfairness in Distributed Computing
inferred← citeshttps://doi.org/10.1007/3-540-15204-0_10openalex-snapshot
Fair serializability of iterated transactions using fifo-nets
inferred← citeshttps://doi.org/10.1007/978-3-540-73230-3_6openalex-snapshot
Static Detection of Livelocks in Ada Multitasking Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-11950-7_9openalex-snapshot
On Deadlocks and Fairness in Self-organizing Resource-Flow Systems
inferred← citeshttps://doi.org/10.1007/bf00265555openalex-snapshot
Fairness and related properties in transition systems ? a temporal logic to deal with fairness
inferred← citeshttps://doi.org/10.1007/bf00289237openalex-snapshot
An approach to automating the verification of compact parallel coordination programs. I
inferred← citeshttps://doi.org/10.1007/bf01071777openalex-snapshot
Parallel microprograms and infinite computations
inferred← citeshttps://doi.org/10.1007/bfb0022520openalex-snapshot
Approaches to concurrency in B-trees
inferred← citeshttps://doi.org/10.1007/bfb0022535openalex-snapshot
Deadlocks and livelocks in transition systems
inferred← citeshttps://doi.org/10.1007/bfb0025793openalex-snapshot
Critical remarks on max model of concurrency
inferred← citeshttps://doi.org/10.1007/bfb0028798openalex-snapshot
A language theoretic approach to serialization problem in concurrent systems
inferred← citeshttps://doi.org/10.1016/0304-3975(82)90067-6openalex-snapshot
A unified approach for studying the properties of transition systems
inferred← citeshttps://doi.org/10.1016/0950-5849(89)90159-6openalex-snapshot
Survey of fairness notions
inferred← citeshttps://doi.org/10.1049/ip-e.1982.0010openalex-snapshot
Axioms and proof rules for Ada tasks
inferred← citeshttps://doi.org/10.1109/32.21752openalex-snapshot
Software CAD: a revolutionary approach
inferred← citeshttps://doi.org/10.1109/32.57622openalex-snapshot
Starvation and critical race analyzers for Ada
inferred← citeshttps://doi.org/10.1109/tse.1982.235251openalex-snapshot
A New Method for Concurrency in B-Trees
inferred← citeshttps://doi.org/10.1145/322344.322352openalex-snapshot
Semaphore primitives and starvation-free mutual exclusion
inferred← citeshttps://doi.org/10.1145/357172.357178openalex-snapshot
Proving Liveness Properties of Concurrent Programs
inferred← citeshttps://doi.org/10.1145/800220.806697openalex-snapshot
On serializability of iterated transactions
inferred← citeshttps://doi.org/10.11606/d.55.2016.tde-29032016-103011openalex-snapshot
Contribuindo para a avaliação do teste de programas concorrentes: uma abordagem usando benchmarks
inferred← citeshttps://doi.org/10.20868/upm.thesis.10327openalex-snapshot
Validación de protocolos, una aproximación algebraica
inferred← citeshttps://doi.org/10.5555/1769168.1769174openalex-snapshot
Static detection of Livelocks in Ada multitasking programs
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.