On the public citation graph

Formalizing process algebraic verifications in the calculus of constructions

https://doi.org/10.1007/bf01212523
0 signed · 47 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-16444-8_1openalex-snapshot
Verification of an alternating bit protocol by means of process algebra protocol
inferredcites →https://doi.org/10.1007/3-540-52335-9_47openalex-snapshot
Inductively defined types
inferredcites →https://doi.org/10.1007/3-540-54947-1openalex-snapshot
Specification and Compositional Verification of Real-Time Systems
inferredcites →https://doi.org/10.1007/3-540-56496-9_5openalex-snapshot
Mechanical verification of concurrent systems with TLA
inferredcites →https://doi.org/10.1007/3-540-57887-0_95openalex-snapshot
A computer-checked verification of Milner's scheduler
inferredcites →https://doi.org/10.1007/3-540-58085-9_75openalex-snapshot
Proof-checking a data link protocol
inferredcites →https://doi.org/10.1007/3-540-61780-9_67openalex-snapshot
An application of co-inductive types in Coq: Verification of the alternating bit protocol
inferredcites →https://doi.org/10.1007/978-1-4471-2120-6_2openalex-snapshot
The Syntax and Semantics of μCRL
inferredcites →https://doi.org/10.1007/978-1-4471-3229-5_13openalex-snapshot
Proof Theory for µCRL: A Language for Processes with Data.
inferredcites →https://doi.org/10.1007/978-3-0348-8211-8openalex-snapshot
Mathematics and Computer Science II
inferredcites →https://doi.org/10.1007/978-3-540-48654-1_30openalex-snapshot
Invariants in Process Algebra with Data
inferredcites →https://doi.org/10.1007/bf01383954openalex-snapshot
Type theory and concurrency
inferredcites →https://doi.org/10.1007/bf01784240openalex-snapshot
Wait-free linearization with a mechanical proof
inferredcites →https://doi.org/10.1007/bf02280829openalex-snapshot
Wait-free linearization with an assertional proof
inferredcites →https://doi.org/10.1007/bfb0014338openalex-snapshot
A bounded retransmission protocol for large data packets
inferredcites →https://doi.org/10.1007/bfb0031999openalex-snapshot
Abstraction in real time process algebra
inferredcites →https://doi.org/10.1007/bfb0037116openalex-snapshot
Inductive definitions in the system Coq rules and properties
inferredcites →https://doi.org/10.1007/bfb0084806openalex-snapshot
Discrete time process algebra
inferredcites →https://doi.org/10.1016/0890-5401(88)90005-3openalex-snapshot
The calculus of constructions
inferredcites →https://doi.org/10.1017/cbo9780511624193openalex-snapshot
Process Algebra
inferredcites →https://doi.org/10.1017/cbo9781139032636openalex-snapshot
Lambda Calculus with Types
inferredcites →https://doi.org/10.1093/comjnl/37.4.289openalex-snapshot
A Correctness Proof of a One-bit Sliding Window Protocol in CRL
inferredcites →https://doi.org/10.1093/oso/9780198537618.003.0002openalex-snapshot
Lambda Calculi with Types
inferredcites →https://doi.org/10.1145/357172.357178openalex-snapshot
Proving Liveness Properties of Concurrent Programs
inferredcites →https://doi.org/10.1145/362946.362970openalex-snapshot
A note on reliable full-duplex transmission over half-duplex links
inferredcites →https://doi.org/10.1515/9783112733417-002openalex-snapshot
Verification of an alternating bit protocol by means of process algebra
inferredcites →https://doi.org/10.21236/ada116035openalex-snapshot
Verification of Concurrent Programs. Part II. Temporal Proof Principles.

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-49059-0_19openalex-snapshot
Process Algebra in PVS
inferred← citeshttps://doi.org/10.1007/978-3-030-11072-7_12openalex-snapshot
Formal Methods for Mobile Robots
inferred← citeshttps://doi.org/10.1007/978-3-030-91081-5_31openalex-snapshot
Computer Aided Formal Design of Swarm Robotics Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-032-26465-7_3openalex-snapshot
Formal Certification of async Protocols: The Case of Gathering in $$\mathbb {R} ^2$$ Using Weber Points
inferred← citeshttps://doi.org/10.1007/978-3-319-03089-0_13openalex-snapshot
Certified Impossibility Results for Byzantine-Tolerant Mobile Robots
inferred← citeshttps://doi.org/10.1007/978-3-319-92970-5_15openalex-snapshot
Exploring Properties of a Telecommunication Protocol with Message Delay Using Interactive Theorem Prover
inferred← citeshttps://doi.org/10.1007/978-3-642-24431-5_15openalex-snapshot
Transforming SOS Specifications to Linear Processes
inferred← citeshttps://doi.org/10.1007/bf02464960openalex-snapshot
Helicobacter pylori: The place of the new macrolides in the eardication of the bacteria in peptic ulcer disease
inferred← citeshttps://doi.org/10.1007/bfb0014338openalex-snapshot
A bounded retransmission protocol for large data packets
inferred← citeshttps://doi.org/10.1007/bfb0055652openalex-snapshot
Checking verifications of protocols and distributed systems by computer
inferred← citeshttps://doi.org/10.1007/pl00003925openalex-snapshot
Example Verifications Using Alphabet Axioms
inferred← citeshttps://doi.org/10.1016/b978-044482830-9/50035-7openalex-snapshot
Algebraic Process Verification
inferred← citeshttps://doi.org/10.1023/a:1022901312673openalex-snapshot
Analysis of an Industrial System
inferred← citeshttps://doi.org/10.1109/sew.2012.16openalex-snapshot
Dogfooding the structural operational semantics of mCRL2
inferred← citeshttps://doi.org/10.1145/3839234openalex-snapshot
A Comprehensive History of μCRL and mCRL2
inferred← citeshttps://doi.org/10.23889/suthesis.54270openalex-snapshot
Integration of the Process Algebra CSP in Dependent Type Theory - Formalisation and Verification
inferred← citeshttps://doi.org/10.3233/fun-2002-503-407openalex-snapshot
Completeness of Timed μCRL
inferred← citeshttps://doi.org/10.48550/arxiv.1306.4242openalex-snapshot
Certified Impossibility Results for Byzantine-Tolerant Mobile Robots
inferred← citeshttps://doi.org/10.6100/ir547956openalex-snapshot
Mechanical verification of concurrency control and recovery protocols
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.