Relating state-based and process-based concurrency through linear logic (full-version)
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1612495 (Why is no real title available?)
- scientific article; zbMATH DE number 1722648 (Why is no real title available?)
- scientific article; zbMATH DE number 4209572 (Why is no real title available?)
- scientific article; zbMATH DE number 4028914 (Why is no real title available?)
- scientific article; zbMATH DE number 3681164 (Why is no real title available?)
- scientific article; zbMATH DE number 125887 (Why is no real title available?)
- scientific article; zbMATH DE number 1296290 (Why is no real title available?)
- scientific article; zbMATH DE number 1337887 (Why is no real title available?)
- scientific article; zbMATH DE number 515728 (Why is no real title available?)
- scientific article; zbMATH DE number 1962758 (Why is no real title available?)
- scientific article; zbMATH DE number 1927552 (Why is no real title available?)
- scientific article; zbMATH DE number 1531624 (Why is no real title available?)
- scientific article; zbMATH DE number 1746674 (Why is no real title available?)
- scientific article; zbMATH DE number 2090322 (Why is no real title available?)
- scientific article; zbMATH DE number 3235663 (Why is no real title available?)
- A calculus for cryptographic protocols: The spi calculus
- A categorical linear framework for Petri nets
- A new natural structural congruence in the pi-calculus with replication
- A proof search specification of the \(\pi\)-calculus
- A proof theory for generic judgments
- Communicating sequential processes
- Conditional rewriting logic as a unified model of concurrency
- Dynamic modification of system structures using LLPNs
- Encoding transition systems in sequent calculus
- Encryption as an abstract data-type (extended abstract)
- First-order linear logic without modalities is NEXPTIME-hard
- Forum: A multiple-conclusion specification logic
- FreshML: programming with binders made simple
- From Petri nets to linear logic
- Lectures on Concurrency and Petri Nets
- Linear logic
- Linear logic as a logic of computations
- Logic programming in a fragment of intuitionistic linear logic
- On proof normalization in linear logic
- On the \(\pi\)-calculus and linear logic
- Petri Nets as Token Objects
- Process realizability
- Proofs as processes
- The NRL Protocol Analyzer: An Overview
- The \(\pi\)-calculus: A theory of mobile processes
- The chemical abstract machine
- The complexity of Horn fragments of linear logic
- Transition and cancellation in concurrency and branching time
- Types for Proofs and Programs
- Uniform proofs as a foundation for logic programming
- Using encryption for authentication in large networks of computers
Cited in
(20)- Logical approximation for program analysis
- Session-typed concurrent contracts
- A message-passing interpretation of adjoint logic
- A language for the logical specification of processes and relations
- A new linear logic for deadlock-free session-typed processes
- Back to futures
- scientific article; zbMATH DE number 7453964 (Why is no real title available?)
- Collaborative planning with confidentiality
- A proof theoretic view of spatial and temporal dependencies in biochemical systems
- On concurrent behaviors and focusing in linear logic
- scientific article; zbMATH DE number 7471698 (Why is no real title available?)
- Relating state-based and process-based concurrency through linear logic
- Non-blocking concurrent imperative programming with session types
- Relating reasoning methodologies in linear logic and process algebra
- A framework for linear authorization logics
- Fairness and communication-based semantics for session-typed languages
- A universal session type for untyped asynchronous communication
- Nested session types
- Linear logical relations and observational equivalences for session-based concurrency
- Bounded memory Dolev-Yao adversaries in collaborative systems
This page was built for publication: Relating state-based and process-based concurrency through linear logic (full-version)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q731895)