Type systems for concurrent programs.
From MaRDI portal
Recommendations
Cited in
(26)- \( \pi\) with leftovers: a mechanisation in Agda
- Type theory based semantic verification for service composition in cloud computing environments
- Types for complexity of parallel computation in pi-calculus
- Undecidable equivalences for basic parallel processes
- Session types revisited
- A type system for lock-free processes
- Comparing type systems for deadlock freedom
- A Coq library for verification of concurrent programs
- The type discipline of behavioral separation
- Context-free session type inference
- Correct-by-construction concurrency: using dependent types to verify implementations of effectful resource usage protocols
- scientific article; zbMATH DE number 5994824 (Why is no real title available?)
- Name-passing calculi: from fusions to preorders and types
- Type and behaviour reconstruction for higher-order concurrent programs
- scientific article; zbMATH DE number 1759483 (Why is no real title available?)
- scientific article; zbMATH DE number 2090851 (Why is no real title available?)
- Comparing deadlock-free session typed processes
- Type systems for distributed programs: components and sessions
- A simple library implementation of binary sessions
- A WSDL-based type system for asynchronous WS-BPEL processes
- Substructural Type Systems for Program Analysis
- Type system in programming languages
- Minimal session types for the -calculus
- Comparing session type systems derived from linear logic
- Using -calculus names as locks
- Deadlock analysis of unbounded process networks
This page was built for publication: Type systems for concurrent programs.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5900554)
