A proof search specification of the -calculus

zbMATH Open1272.03143MaRDI QIDQ2848670FDOQ2848670

Authors: Alwen Tiu, Dale Miller 

Publication date: 26 September 2013

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571066105051121

Recommendations

• Proof search specifications of bisimulation and modal logics for the \({\pi}\)-calculus
• Computer Science Logic
• CONCUR 2005 – Concurrency Theory
• scientific article; zbMATH DE number 2020178
• scientific article; zbMATH DE number 1759486

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (18)

• An exact correspondence between a typed pi-calculus and polarised proof-nets
• Title not available (Why is that?)
• Computer Science Logic
• Open bisimulation, revisited
• Nominal abstraction
• A proof theory for generic judgments
• CONCUR 2005 – Concurrency Theory
• A proof theoretic view of spatial and temporal dependencies in biochemical systems
• On the role of names in reasoning about \(\lambda\)-tree syntax specifications
• Relating state-based and process-based concurrency through linear logic (full-version)
• A proof theory for model checking: an extended abstract
• A proof theoretic approach to operational semantics
• Proof search specifications of bisimulation and modal logics for the \({\pi}\)-calculus
• A proof theory for model checking
• Relating state-based and process-based concurrency through linear logic
• An Analytic Propositional Proof System on Graphs
• The calculus of constructions as a framework for proof search with set variable instantiation
• Title not available (Why is that?)

This page was built for publication: A proof search specification of the \(\pi\)-calculus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2848670)