On the public citation graph

Type theory and concurrency

https://doi.org/10.1007/bf01383954
0 signed · 27 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-10235-3openalex-snapshot
A Calculus of Communicating Systems
inferredcites →https://doi.org/10.1007/3-540-15198-2_16openalex-snapshot
A complete modal proof system for a subset of SCCS
inferredcites →https://doi.org/10.1007/3-540-16780-3_108openalex-snapshot
Implementing number theory: An experiment with Nuprl
inferredcites →https://doi.org/10.1016/0011-684x(85)90108-xopenalex-snapshot
Communicating sequential processes
inferredcites →https://doi.org/10.1016/0167-6423(89)90044-0openalex-snapshot
Algebraic theory of processes
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(84)90113-0openalex-snapshot
Testing equivalences for processes
inferredcites →https://doi.org/10.1016/0304-3975(87)90012-0openalex-snapshot
Modal logics for communicating systems
inferredcites →https://doi.org/10.1098/rsta.1984.0073openalex-snapshot
Constructive mathematics and computer programming
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1145/2455.2460openalex-snapshot
Algebraic laws for nondeterminism and concurrency
inferredcites →https://doi.org/10.1145/4221.4249openalex-snapshot
Acceptance trees
inferredcites →https://doi.org/10.1145/828.833openalex-snapshot
A Theory of Communicating Sequential Processes

What points at this work

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

inferred← citeshttps://doi.org/10.1007/10720076_1openalex-snapshot
Searching for a Solution to Program Verification=Equation Solving in CCS
inferred← citeshttps://doi.org/10.1007/3-540-55179-4_28openalex-snapshot
Mechanizing a proof by induction of process algebra specifications in higher order logic
inferred← citeshttps://doi.org/10.1007/3540539816_72openalex-snapshot
Combining interaction and automation in process algebra verification
inferred← citeshttps://doi.org/10.1007/978-1-4471-3182-3_9openalex-snapshot
A Higher Order Logic Mechanization of the CSP Failure-Divergence Semantics
inferred← citeshttps://doi.org/10.1007/978-1-4471-3229-5_18openalex-snapshot
Verifying Process Algebra Proofs in Type Theory
inferred← citeshttps://doi.org/10.1007/bf01212523openalex-snapshot
Formalizing process algebraic verifications in the calculus of constructions
inferred← citeshttps://doi.org/10.1007/bf01887198openalex-snapshot
Do-it-yourself type theory
inferred← citeshttps://doi.org/10.1007/s10817-009-9125-xopenalex-snapshot
On Process Equivalence = Equation Solving in CCS
inferred← citeshttps://doi.org/10.1023/a:1008770222354openalex-snapshot
Planning Proofs of Equations in CCS
inferred← citeshttps://doi.org/10.1080/00207729708929473openalex-snapshot
Automating the refinement of specifications for distributed systems via syntactic transformations
inferred← citeshttps://doi.org/10.1109/32.58786openalex-snapshot
Mechanizing CSP trace theory in higher order logic
inferred← citeshttps://doi.org/10.1109/jcit.1990.128283openalex-snapshot
Reasoning in CSP via the HOL theorem prover
inferred← citeshttps://doi.org/10.1145/2976022.2976032openalex-snapshot
Programming with monadic CSP-style processes in dependent type theory
inferred← citeshttps://doi.org/10.23889/suthesis.54270openalex-snapshot
Integration of the Process Algebra CSP in Dependent Type Theory - Formalisation and 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.