On the public citation graph

Model Checking for π-Calculus Using Proof Search

https://doi.org/10.1007/11539452_7
0 signed · 49 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.1006/inco.1996.0072openalex-snapshot
Model Checking Mobile Processes
inferredcites →https://doi.org/10.1006/inco.1998.2740openalex-snapshot
A Calculus for Cryptographic Protocols: The Spi Calculus
inferredcites →https://doi.org/10.1007/0-306-48088-3_4openalex-snapshot
Proof Systems for π-Calculus Logics
inferredcites →https://doi.org/10.1007/3-540-58025-5openalex-snapshot
Extensions of Logic Programming
inferredcites →https://doi.org/10.1007/3-540-63166-6_16openalex-snapshot
Efficient model checking using tabled resolution
inferredcites →https://doi.org/10.1007/978-3-540-24727-2_2openalex-snapshot
Theories for the Global Ubiquitous Computer
inferredcites →https://doi.org/10.1007/978-3-540-24727-2_7openalex-snapshot
Behavioral and Spatial Observations in a Logic for the π-Calculus
inferredcites →https://doi.org/10.1007/bfb0013605openalex-snapshot
A finitary version of the calculus of partial inductive definitions
inferredcites →https://doi.org/10.1007/bfb0038698openalex-snapshot
A logic programming language with lambda-abstraction, function variables, and simple unification
inferredcites →https://doi.org/10.1007/s001650200016openalex-snapshot
A New Approach to Abstract Syntax with Variable Binding
inferredcites →https://doi.org/10.1007/s10009-003-0136-3openalex-snapshot
A logical encoding of the π-calculus: model checking mobile processes using tabled resolution
inferredcites →https://doi.org/10.1016/0304-3975(75)90011-0openalex-snapshot
A unification algorithm for typed λ-calculus
inferredcites →https://doi.org/10.1016/0304-3975(93)90156-nopenalex-snapshot
Modal logics for mobile processes
inferredcites →https://doi.org/10.1016/0747-7171(92)90011-ropenalex-snapshot
Unification under a mixed prefix
inferredcites →https://doi.org/10.1016/0890-5401(92)90008-4openalex-snapshot
A calculus of mobile processes, I
inferredcites →https://doi.org/10.1016/0890-5401(92)90009-5openalex-snapshot
A calculus of mobile processes, II
inferredcites →https://doi.org/10.1016/j.entcs.2005.05.006openalex-snapshot
A Proof Search Specification of the π-Calculus
inferredcites →https://doi.org/10.1016/s0304-3975(01)00168-2openalex-snapshot
Encoding transition systems in sequent calculus
inferredcites →https://doi.org/10.1016/s0304-3975(99)00171-1openalex-snapshot
Cut-elimination for a logic with definitions and induction
inferredcites →https://doi.org/10.1109/lics.1993.287585openalex-snapshot
Rules of definitional reflection
inferredcites →https://doi.org/10.1109/lics.1993.287599openalex-snapshot
Functional unification of higher-order patterns
inferredcites →https://doi.org/10.1109/lics.2003.1210051openalex-snapshot
A proof theory for generic judgments: an extended abstract
inferredcites →https://doi.org/10.1142/s0129054194000086openalex-snapshot
CUT-PROPERTY AND NEGATION AS FAILURE
inferredcites →https://doi.org/10.1145/266420.266432openalex-snapshot
A calculus for cryptographic protocols
inferredcites →https://doi.org/10.1145/333580.333590openalex-snapshot
Foundational aspects of syntax
inferredcites →https://doi.org/10.1145/990010.990013openalex-snapshot
A model-checking verification environment for mobile 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/11814771_3openalex-snapshot
Representing and Reasoning with Operational Semantics
inferred← citeshttps://doi.org/10.1007/11901433_13openalex-snapshot
Verification of Computation Orchestration Via Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-030-83906-2_15openalex-snapshot
Towards Assurance-Driven Architectural Decomposition of Software Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-70583-3_9openalex-snapshot
Completeness and Logical Full Abstraction in Modal Logics for Typed Mobile Processes
inferred← citeshttps://doi.org/10.1007/978-3-540-73595-3_28openalex-snapshot
The Bedwyr System for Model Checking over Syntactic Expressions
inferred← citeshttps://doi.org/10.1007/978-3-540-75560-9_9openalex-snapshot
Least and Greatest Fixed Points in Linear Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-02716-1_8openalex-snapshot
On the Proof Theory of Regular Fixed Points
inferred← citeshttps://doi.org/10.1007/978-3-642-17164-2_4openalex-snapshot
Reasoning about Computations Using Two-Levels of Logic
inferred← citeshttps://doi.org/10.1007/s00165-013-0280-9openalex-snapshot
Towards verification of computation orchestration
inferred← citeshttps://doi.org/10.1007/s10817-018-9483-3openalex-snapshot
Mechanized Metatheory Revisited
inferred← citeshttps://doi.org/10.1016/j.cmpb.2008.05.007openalex-snapshot
Formal interaction specification in public health surveillance systems using -calculus
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.09.032openalex-snapshot
A Congruence Format for Name-passing Calculi
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.12.089openalex-snapshot
A Proof Theoretic Approach to Operational Semantics
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.12.113openalex-snapshot
On the Expressivity of Minimal Generic Quantification
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.07.010openalex-snapshot
Open bisimulation, revisited
inferred← citeshttps://doi.org/10.1109/cts.2010.5478517openalex-snapshot
Dynamic Networks of Timed Automata for collaborative systems: A network monitoring case study
inferred← citeshttps://doi.org/10.1145/1273920.1273931openalex-snapshot
Mechanized metatheory model-checking
inferred← citeshttps://doi.org/10.1145/1656242.1656248openalex-snapshot
Proof search specifications of bisimulation and modal logics for the π-calculus
inferred← citeshttps://doi.org/10.1145/2071368.2071370openalex-snapshot
Least and Greatest Fixed Points in Linear Logic
inferred← citeshttps://doi.org/10.1145/2211616.2211619openalex-snapshot
A logical verification methodology for service-oriented computing
inferred← citeshttps://doi.org/10.48550/arxiv.0910.3383openalex-snapshot
Least and Greatest Fixed Points in Linear Logic
inferred← citeshttps://doi.org/10.48550/arxiv.1508.01927openalex-snapshot
Incorporating Inductions and Game Semantics into Logic Programming
inferred← citeshttps://doi.org/10.70675/61bfbf53z121az472ez8c91ze9f6166c9a6aopenalex-snapshot
Applications of Foundational Proof Certificates in theorem proving
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.