Relating state-based and process-based concurrency through linear logic (full-version)
DOI10.1016/J.IC.2008.11.006zbMATH Open1181.68168OpenAlexW1999161312MaRDI QIDQ731895FDOQ731895
Authors: Iliano Cervesato, Andre Scedrov 
Publication date: 9 October 2009
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2008.11.006
Recommendations
Grammars and rewriting systems (68Q42) Logic in computer science (03B70) Proof-theoretic aspects of linear logic and other substructural logics (03F52) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- The NRL Protocol Analyzer: An Overview
- Title not available (Why is that?)
- Linear logic
- The chemical abstract machine
- A calculus for cryptographic protocols: The spi calculus
- Title not available (Why is that?)
- Logic programming in a fragment of intuitionistic linear logic
- Communicating sequential processes
- Title not available (Why is that?)
- Types for Proofs and Programs
- Title not available (Why is that?)
- Using encryption for authentication in large networks of computers
- The \(\pi\)-calculus: A theory of mobile processes
- Transition and cancellation in concurrency and branching time
- Title not available (Why is that?)
- Conditional rewriting logic as a unified model of concurrency
- Uniform proofs as a foundation for logic programming
- Linear logic as a logic of computations
- Title not available (Why is that?)
- The complexity of Horn fragments of linear logic
- Title not available (Why is that?)
- Forum: A multiple-conclusion specification logic
- A new natural structural congruence in the pi-calculus with replication
- Title not available (Why is that?)
- FreshML: programming with binders made simple
- Title not available (Why is that?)
- Petri Nets as Token Objects
- Proofs as processes
- On the \(\pi\)-calculus and linear logic
- Encoding transition systems in sequent calculus
- A proof search specification of the \(\pi\)-calculus
- A proof theory for generic judgments
- From Petri nets to linear logic
- Title not available (Why is that?)
- On proof normalization in linear logic
- First-order linear logic without modalities is NEXPTIME-hard
- A categorical linear framework for Petri nets
- Process realizability
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Encryption as an abstract data-type (extended abstract)
- Title not available (Why is that?)
- Lectures on Concurrency and Petri Nets
- Dynamic modification of system structures using LLPNs
Cited In (20)
- Nested session types
- Session-typed concurrent contracts
- Relating reasoning methodologies in linear logic and process algebra
- On concurrent behaviors and focusing in linear logic
- A proof theoretic view of spatial and temporal dependencies in biochemical systems
- A message-passing interpretation of adjoint logic
- Bounded memory Dolev-Yao adversaries in collaborative systems
- A language for the logical specification of processes and relations
- Collaborative planning with confidentiality
- Title not available (Why is that?)
- Logical approximation for program analysis
- Fairness and communication-based semantics for session-typed languages
- Linear logical relations and observational equivalences for session-based concurrency
- Title not available (Why is that?)
- A framework for linear authorization logics
- Back to futures
- A universal session type for untyped asynchronous communication
- A new linear logic for deadlock-free session-typed processes
- Relating state-based and process-based concurrency through linear logic
- Non-blocking concurrent imperative programming with session types
Uses Software
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)
