scientific article; zbMATH DE number 1759631

zbMATH Open0999.68532MaRDI QIDQ4536623FDOQ4536623

Authors: Naoki Kobayashi, Shin Saito, Eijiro Sumii 

Publication date: 25 June 2002

Title of this publication is not available (Why is that?)

Recommendations

• A New Type System for Deadlock-Free Processes
• scientific article; zbMATH DE number 1231692
• Types for deadlock-free higher-order programs
• A type system for lock-free processes
• A new linear logic for deadlock-free session-typed processes

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (17)

• Type-Based Complexity Analysis for Fork Processes
• Type-based information flow analysis for the \(\pi\)-calculus
• Types for deadlock-free higher-order programs
• An interpretation of CCS into ludics
• A Hybrid Type System for Lock-Freedom of Mobile Processes
• An algebra of behavioural types
• Type reconstruction for linear \(\pi\)-calculus with I/O subtyping.
• Towards static deadlock resolution in the \(\pi\)-calculus
• Static Safety for an Actor Dedicated Process Calculus by Abstract Interpretation
• Analysing input/output-capabilities of mobile processes with a generic type system
• A generic type system for the pi-calculus
• Deadlock checking by a behavioral effect system for lock handling
• A New Type System for Deadlock-Free Processes
• A generic type system for the \(\pi\)-calculus
• A new linear logic for deadlock-free session-typed processes
• A new type system for JVM lock primitives
• A type system for lock-free processes

This page was built for publication:

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