On the public citation graph

A Concurrent Logical Framework II: Examples and Applications

0 signed · 82 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.1994.1036openalex-snapshot
Logic Programming in a Fragment of Intuitionistic Linear Logic
inferredcites →https://doi.org/10.1006/inco.1998.2740openalex-snapshot
A Calculus for Cryptographic Protocols: The Spi Calculus
inferredcites →https://doi.org/10.1006/inco.1999.2819openalex-snapshot
Zero-Safe Nets: Comparing the Collective and Individual Token Approaches
inferredcites →https://doi.org/10.1006/inco.2001.2951openalex-snapshot
A Linear Logical Framework
inferredcites →https://doi.org/10.1007/3-540-45116-1_18openalex-snapshot
Typed MSR: Syntax and Examples
inferredcites →https://doi.org/10.1007/3-540-48660-7_14openalex-snapshot
System Description: Twelf — A Meta-Logical Framework for Deductive Systems
inferredcites →https://doi.org/10.1007/3-540-49366-2_18openalex-snapshot
A Comparison of Petri Net Semantics under the Collective Token Philosophy
inferredcites →https://doi.org/10.1007/3-540-52590-4_46openalex-snapshot
Petri nets as models of linear logic
inferredcites →https://doi.org/10.1007/3-540-56454-3_13openalex-snapshot
The π-calculus as a theory in linear logic: Preliminary results
inferredcites →https://doi.org/10.1007/978-0-387-34892-6_4openalex-snapshot
True versus artificial concurrency
inferredcites →https://doi.org/10.1007/bfb0035389openalex-snapshot
A brief introduction to coloured Petri Nets
inferredcites →https://doi.org/10.1016/s1571-0661(04)80503-6openalex-snapshot
A Simplified Account of the Metatheory of Linear LF
inferredcites →https://doi.org/10.1017/cbo9780511569807.008openalex-snapshot
Logic programming in the LF logical framework
inferredcites →https://doi.org/10.1017/cbo9780511574962openalex-snapshot
Concurrent Programming in ML
inferredcites →https://doi.org/10.1017/s0960129500000062openalex-snapshot
From Petri nets to linear logic
inferredcites →https://doi.org/10.1093/logcom/8.6.809openalex-snapshot
A relevant analysis of natural deduction
inferredcites →https://doi.org/10.1109/csfw.1999.779762openalex-snapshot
A meta-notation for protocol analysis
inferredcites →https://doi.org/10.1109/csfw.2000.856924openalex-snapshot
Relating strands and multiset rewriting for security protocol analysis
inferredcites →https://doi.org/10.1109/lics.1990.113746openalex-snapshot
Normal process representatives
inferredcites →https://doi.org/10.1109/lics.1991.151628openalex-snapshot
Logic programming in a fragment of intuitionistic linear logic
inferredcites →https://doi.org/10.1109/lics.1996.561339openalex-snapshot
A linear logical framework
inferredcites →https://doi.org/10.1109/lics.2001.932499openalex-snapshot
Intensionality, extensionality, and proof irrelevance in modal type theory
inferredcites →https://doi.org/10.1109/tit.1983.1056650openalex-snapshot
On the security of public key protocols
inferredcites →https://doi.org/10.1145/1042038.1042041openalex-snapshot
On equivalence and canonical forms in the LF type theory
inferredcites →https://doi.org/10.1145/138027.138060openalex-snapshot
A framework for defining logics
inferredcites →https://doi.org/10.1145/151233.151242openalex-snapshot
Programming by multiset transformation
inferredcites →https://doi.org/10.1145/266420.266432openalex-snapshot
A calculus for cryptographic protocols
inferredcites →https://doi.org/10.1145/359657.359659openalex-snapshot
Using encryption for authentication in large networks of computers
inferredcites →https://doi.org/10.1184/r1/6591383openalex-snapshot
A Specification Language for Crypto-Protocols based on Multiset Rewriting, Dependent Types and Subsorting
inferredcites →https://doi.org/10.1184/r1/6608369openalex-snapshot
Petri Nets and Linear Logic: a Case Study for Logic Programming
inferredcites →https://doi.org/10.21236/ada418517openalex-snapshot
A Concurrent Logical Framework I: Judgments and Properties
inferredcites →https://doi.org/10.48550/arxiv.cs/0110028openalex-snapshot
On Equivalence and Canonical Forms in the LF Type Theory
inferredcites →https://doi.org/10.7146/brics.v5i17.19423openalex-snapshot
A Comparison of Petri Net Semantics under the Collective Token Philosophy

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11538363_15openalex-snapshot
Focusing the Inverse Method for Linear Logic
inferred← citeshttps://doi.org/10.1007/978-3-030-98869-2_6openalex-snapshot
Towards Substructural Property-Based Testing
inferred← citeshttps://doi.org/10.1007/978-3-031-30829-1_4openalex-snapshot
A Logical Framework with Higher-Order Rational (Circular) Terms
inferred← citeshttps://doi.org/10.1007/978-3-319-08918-8_22openalex-snapshot
Construction of Retractile Proof Structures
inferred← citeshttps://doi.org/10.1007/978-3-319-10398-3_10openalex-snapshot
A Logical Framework for Systems Biology
inferred← citeshttps://doi.org/10.1007/978-3-540-24849-1_23openalex-snapshot
A Concurrent Logical Framework: The Propositional Fragment
inferred← citeshttps://doi.org/10.1007/978-3-540-30477-7_13openalex-snapshot
Substructural Operational Semantics and Linear Destination-Passing Style (Invited Talk)
inferred← citeshttps://doi.org/10.1007/978-3-540-71070-7_28openalex-snapshot
Celf – A Logical Framework for Deductive and Concurrent Systems (System Description)
inferred← citeshttps://doi.org/10.1007/s10817-020-09553-0openalex-snapshot
HO$$\pi $$ in Coq
inferred← citeshttps://doi.org/10.1007/s10990-011-9071-2openalex-snapshot
Logical approximation for program analysis
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.05.043openalex-snapshot
Relating State-Based and Process-Based Concurrency through Linear Logic
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.11.030openalex-snapshot
Hybridizing a Logical Framework
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.09.016openalex-snapshot
Induction on Concurrent Terms
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.11.010openalex-snapshot
A Coq Library for Verification of Concurrent Programs
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.11.013openalex-snapshot
Specifying Properties of Concurrent Computations in CLF
inferred← citeshttps://doi.org/10.1016/j.entcs.2014.06.008openalex-snapshot
Dynamic Spaces in Concurrent Constraint Programming
inferred← citeshttps://doi.org/10.1016/j.ic.2008.11.006openalex-snapshot
Relating state-based and process-based concurrency through linear logic (full-version)
inferred← citeshttps://doi.org/10.1016/j.ic.2022.104892openalex-snapshot
Fairness and communication-based semantics for session-typed languages
inferred← citeshttps://doi.org/10.1016/j.jlamp.2022.100846openalex-snapshot
Formalizing CCS and π-calculus in Guarded Cubical Agda
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.06.031openalex-snapshot
Subexponential concurrent constraint programming
inferred← citeshttps://doi.org/10.1017/s0956796807006430openalex-snapshot
Mechanizing metatheory in a logical framework
inferred← citeshttps://doi.org/10.1017/s0956796822000016openalex-snapshot
Back to futures
inferred← citeshttps://doi.org/10.1017/s0960129514000413openalex-snapshot
Relating reasoning methodologies in linear logic and process algebra
inferred← citeshttps://doi.org/10.1017/s096012951700010xopenalex-snapshot
Proof-relevant π-calculus: a constructive account of concurrency and causality
inferred← citeshttps://doi.org/10.1017/s1471068412000221openalex-snapshot
An Improved Proof-Theoretic Compilation of Logic Programs
inferred← citeshttps://doi.org/10.1017/s1471068414000167openalex-snapshot
A Linear Logic Programming Language for Concurrent Programming over Graph Structures
inferred← citeshttps://doi.org/10.1109/lics.2009.8openalex-snapshot
Substructural Operational Semantics as Ordered Logic Programming
inferred← citeshttps://doi.org/10.1109/tg.2023.3292982openalex-snapshot
Modeling Game Mechanics With Ceptre
inferred← citeshttps://doi.org/10.1145/1069774.1069778openalex-snapshot
Monadic concurrent linear logic programming
inferred← citeshttps://doi.org/10.1145/1480945.1480949openalex-snapshot
Linear logical approximations
inferred← citeshttps://doi.org/10.1145/2364406.2364408openalex-snapshot
Trace matching in a concurrent logical framework
inferred← citeshttps://doi.org/10.1145/2505879.2505899openalex-snapshot
A logical correspondence between natural semantics and abstract machines
inferred← citeshttps://doi.org/10.1145/3110281openalex-snapshot
Manifest sharing with session types
inferred← citeshttps://doi.org/10.1145/3622810openalex-snapshot
Mechanizing Session-Types using a Structural View: Enforcing Linearity without Linearity
inferred← citeshttps://doi.org/10.1184/r1/6604097openalex-snapshot
CLL : a concurrent language built from logical principles
inferred← citeshttps://doi.org/10.1184/r1/6607865openalex-snapshot
On Matching Concurrent Traces
inferred← citeshttps://doi.org/10.1184/r1/6610676openalex-snapshot
The Logical Meeting Point of Multiset Rewriting and Process Algebra: Progress Report
inferred← citeshttps://doi.org/10.1184/r1/6611177openalex-snapshot
Type safety for substructural specifications: preliminary results (CMU-CS-10-134)
inferred← citeshttps://doi.org/10.21236/ada418517openalex-snapshot
A Concurrent Logical Framework I: Judgments and Properties
inferred← citeshttps://doi.org/10.3233/fi-2014-982openalex-snapshot
Substructural Meta-Theory of a Type-Safe Language for Web Programming
inferred← citeshttps://doi.org/10.4204/eptcs.120.2openalex-snapshot
Towards Meta-Reasoning in the Concurrent Logical Framework CLF
inferred← citeshttps://doi.org/10.4204/eptcs.185.4openalex-snapshot
Proof-relevant pi-calculus
inferred← citeshttps://doi.org/10.4204/eptcs.34.2openalex-snapshot
The Practice and Promise of Substructural Frameworks
inferred← citeshttps://doi.org/10.4204/eptcs.71.2openalex-snapshot
A Bigraph Relational Model
inferred← citeshttps://doi.org/10.4230/lipics.types.2013.150openalex-snapshot
A Hybrid Linear Logic for Constrained Transition Systems
inferred← citeshttps://doi.org/10.48550/arxiv.1210.1653openalex-snapshot
An Improved Proof-Theoretic Compilation of Logic Programs
inferred← citeshttps://doi.org/10.48550/arxiv.1310.4310openalex-snapshot
A Hybrid Linear Logic for Constrained Transition Systems with Applications to Molecular Biology
inferred← citeshttps://doi.org/10.48550/arxiv.1805.07176openalex-snapshot
Proofs and Programs about Open Terms
inferred← citeshttps://doi.org/10.5937/jcfs2-44362openalex-snapshot
A verifiable model of a minimal market operating sequentially, with price and time discrete
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.