On the public citation graph
Type-based analysis of communication for concurrent programming languages
0 signed · 35 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-55511-0_16openalex-snapshot
An algorithm for analyzing communicating processes
inferredcites →https://doi.org/10.1007/3-540-59293-8_222openalex-snapshot
Static and dynamic processor allocation for higher-order concurrent languages
inferredcites →https://doi.org/10.1007/3-540-60360-3_42openalex-snapshot
Static analysis of communication for asynchronous concurrent programming languages
inferredcites →https://doi.org/10.1007/978-3-642-58041-3_6openalex-snapshot
The Polyadic π-Calculus: a Tutorial
inferredcites →https://doi.org/10.1007/bfb0026568openalex-snapshot
Higher-order concurrent linear logic programming
inferredcites →https://doi.org/10.1007/bfb0032742openalex-snapshot
Type-based analysis of communication for concurrent programming languages
inferredcites →https://doi.org/10.1017/cbo9780511609619openalex-snapshot
Compiling with Continuations
inferredcites →https://doi.org/10.1109/lics.1993.287570openalex-snapshot
Typing and subtyping for mobile processes
inferredcites →https://doi.org/10.1109/lics.1997.614941openalex-snapshot
A partially deadlock-free typed process calculus
inferredcites →https://doi.org/10.1145/174675.174538openalex-snapshot
Higher-order concurrent programs with finite communication topology (extended abstract)
inferredcites →https://doi.org/10.1145/215465.215592openalex-snapshot
Analyzing the communication topology of concurrent programs
inferredcites →https://doi.org/10.1145/276393.278524openalex-snapshot
A partially deadlock-free typed process calculus
inferredcites →https://doi.org/10.7551/mitpress/5641.003.0022openalex-snapshot
Pict: A Programming Language Based on the Pi-Calculus
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.2000.2872openalex-snapshot
Type Reconstruction for Linear π-Calculus with I/O Subtyping
inferred← citeshttps://doi.org/10.1007/3-540-44577-3_10openalex-snapshot
Abstract Interpretation Based Formal Methods and Future Challenges
inferred← citeshttps://doi.org/10.1007/978-3-030-17184-1_22openalex-snapshot
Manifest Deadlock-Freedom for Shared Session Types
inferred← citeshttps://doi.org/10.1007/978-3-319-99725-4_18openalex-snapshot
Process-Local Static Analysis of Synchronous Processes
inferred← citeshttps://doi.org/10.1007/978-3-642-54830-7_6openalex-snapshot
Type Reconstruction for the Linear π-Calculus with Composite and Equi-Recursive Types
inferred← citeshttps://doi.org/10.1007/bfb0002781openalex-snapshot
An efficient compilation framework for languages based on a concurrent process calculus
inferred← citeshttps://doi.org/10.1007/bfb0054102openalex-snapshot
Design and partial evaluation of meta-objects for a concurrent reflective language
inferred← citeshttps://doi.org/10.1007/bfb0055523openalex-snapshot
Type-based analysis of concurrent programs
inferred← citeshttps://doi.org/10.1109/csf.2011.13openalex-snapshot
Resource-Aware Authorization Policies for Statically Typed Cryptographic Protocols
inferred← citeshttps://doi.org/10.1109/lics.1997.614941openalex-snapshot
A partially deadlock-free typed process calculus
inferred← citeshttps://doi.org/10.1145/276393.278524openalex-snapshot
A partially deadlock-free typed process calculus
inferred← citeshttps://doi.org/10.1145/3473600openalex-snapshot
CPS transformation with affine types for call-by-value implicit polymorphism
inferred← citeshttps://doi.org/10.1145/3498662openalex-snapshot
Connectivity graphs: a method for proving deadlock freedom based on separation logic
inferred← citeshttps://doi.org/10.1145/3571229openalex-snapshot
Higher-Order Leak and Deadlock Free Locks
inferred← citeshttps://doi.org/10.1145/3632889openalex-snapshot
Deadlock-Free Separation Logic: Linearity Yields Progress for Dependent Higher-Order Message Passing
inferred← citeshttps://doi.org/10.3233/fi-2010-303openalex-snapshot
Correct-by-Construction Concurrency: Using Dependent Types to Verify Implementations of Effectful Resource Usage Protocols
showing the first 18 of 19 · page through all 19
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.