On the public citation graph

The power of the future perfect in program logics

https://doi.org/10.1007/bfb0030311
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/3-540-07135-0_113openalex-snapshot
A fundamental theorem of asynchronous parallel computation
inferredcites →https://doi.org/10.1007/3-540-10003-2_79openalex-snapshot
On observing nondeterminism and concurrency
inferredcites →https://doi.org/10.1007/3-540-10235-3openalex-snapshot
A Calculus of Communicating Systems
inferredcites →https://doi.org/10.1007/3-540-10828-9_52openalex-snapshot
A modal characterisation of observable machine-behaviour
inferredcites →https://doi.org/10.1007/3-540-10843-2_22openalex-snapshot
Impartiality, justice and fairness: The ethics of concurrent termination
inferredcites →https://doi.org/10.1007/3-540-12689-9_96openalex-snapshot
A fair calculus of communicating systems
inferredcites →https://doi.org/10.1007/3-540-12896-4_381openalex-snapshot
Property preserving homomorphisms of transition systems
inferredcites →https://doi.org/10.1007/bfb0017309openalex-snapshot
Concurrency and automata on infinite sequences
inferredcites →https://doi.org/10.1007/bfb0022461openalex-snapshot
Modal logic of concurrent nondeterministic programs
inferredcites →https://doi.org/10.1007/bfb0036900openalex-snapshot
Behavioural equivalence relations induced by programming logics
inferredcites →https://doi.org/10.1016/0022-0000(82)90003-4openalex-snapshot
Process logic: Expressiveness, decidability, completeness
inferredcites →https://doi.org/10.1016/0304-3975(81)90110-9openalex-snapshot
The temporal semantics of concurrent programs
inferredcites →https://doi.org/10.1016/0304-3975(82)90067-6openalex-snapshot
A unified approach for studying the properties of transition systems
inferredcites →https://doi.org/10.1016/0304-3975(83)90114-7openalex-snapshot
Calculi for synchrony and asynchrony
inferredcites →https://doi.org/10.1016/0304-3975(85)90129-xopenalex-snapshot
A proof-theoretic characterization of observational equivalence
inferredcites →https://doi.org/10.1093/acprof:oso/9780198243113.001.0001openalex-snapshot
Past, Present and Future
inferredcites →https://doi.org/10.1111/j.1755-2567.1970.tb00428.xopenalex-snapshot
An approach to tense logic1
inferredcites →https://doi.org/10.1145/2455.2460openalex-snapshot
Algebraic laws for nondeterminism and concurrency
inferredcites →https://doi.org/10.1145/357172.357178openalex-snapshot
Proving Liveness Properties of Concurrent Programs
inferredcites →https://doi.org/10.1145/567067.567080openalex-snapshot
Automatic verification of finite state concurrent system using temporal logic specifications
inferredcites →https://doi.org/10.1145/567067.567082openalex-snapshot
How to cook a temporal proof system for your pet language
inferredcites →https://doi.org/10.1145/567446.567462openalex-snapshot
On the temporal analysis of fairness
inferredcites →https://doi.org/10.1145/567446.567463openalex-snapshot
"Sometime" is sometimes "not never"
inferredcites →https://doi.org/10.1145/567532.567551openalex-snapshot
The temporal logic of branching time
inferredcites →https://doi.org/10.1145/800221.806721openalex-snapshot
Real-time programming and asynchronous message passing
inferredcites →https://doi.org/10.1163/9789004252882_004openalex-snapshot
Formal Properties of ‘Now’
inferredcites →https://doi.org/10.1515/9781400882618-006openalex-snapshot
Gedanken-Experiments on Sequential Machines

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-15670-4_10openalex-snapshot
Lectures on a calculus for communicating systems
inferred← citeshttps://doi.org/10.1007/3-540-16066-3_31openalex-snapshot
Transition graphs semantics and languages
inferred← citeshttps://doi.org/10.1007/3-540-57182-5_2openalex-snapshot
Equivalences and preorders of transition systems
inferred← citeshttps://doi.org/10.1007/bfb0015773openalex-snapshot
A complete compositional modal proof system for a subset of CCS
inferred← citeshttps://doi.org/10.1007/bfb0030305openalex-snapshot
Weak and strong fairness in CCS
inferred← citeshttps://doi.org/10.1016/0304-3975(85)90004-0openalex-snapshot
A logical characterization of observation equivalence
inferred← citeshttps://doi.org/10.1016/0304-3975(85)90129-xopenalex-snapshot
A proof-theoretic characterization of observational equivalence
inferred← citeshttps://doi.org/10.1016/0890-5401(87)90013-7openalex-snapshot
Weak and strong fairness in CCS
inferred← citeshttps://doi.org/10.7146/brics.v1i6.21664openalex-snapshot
Bisimulations, Games, and Logic
inferred← citeshttps://doi.org/10.7146/brics.v6i28.20097openalex-snapshot
A Fully Abstract Presheaf Semantics of SCCS with Finite Delay
inferred← citeshttps://doi.org/10.7146/dpb.v23i467.6940openalex-snapshot
Bisimulations, Games and Logic
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.