Types for complexity of parallel computation in pi-calculus
DOI10.1007/978-3-030-72019-3_3zbMATH Open1473.68111OpenAlexW3136372787MaRDI QIDQ2233448FDOQ2233448
Authors: Patrick Baillot, Alexis Ghyselen 
Publication date: 18 October 2021
Full work available at URL: https://doi.org/10.26226/morressier.604907f41a80aac83ca25d13
Recommendations
implicit computational complexitypi-calculustype systemscomplexity analysisprocess calculisize types
Analysis of algorithms and problem complexity (68Q25) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Linear types and non-size-increasing polynomial time computation.
- A logical account of pspace
- Linear dependent types and relative completeness
- Multivariate amortized resource analysis
- Practical foundations for programming languages
- The \(\pi\)-calculus: A theory of mobile processes
- Type-based information flow analysis for the \(\pi\)-calculus
- A New Type System for Deadlock-Free Processes
- Type systems for concurrent programs.
- A type system for lock-free processes
- Static prediction of heap space usage for first-order functional programs
- Amortized resource analysis with polynomial potential. A static inference of polynomial bounds for functional programs
- Session types revisited
- Automatic Static Cost Analysis for Parallel Programs
- Causality for mobile processes
- Causality and replication in concurrent processes
- An elementary affine \(\lambda \)-calculus with multithreading and side effects
- Type-Based Complexity Analysis for Fork Processes
- Rely-guarantee termination and cost analyses of loops with concurrent interleavings
- Causal computational complexity of distributed processes
- Light logics and higher-order processes
- On session types and polynomial time
- Types for complexity of parallel computation in pi-calculus
- The complexity of interaction
- Work analysis with resource-aware session types
Cited In (12)
- Type-Based Complexity Analysis for Fork Processes
- Analysing parallel complexity of term rewriting
- Replications in reversible concurrent calculi
- Types for complexity of parallel computation in pi-calculus
- The complexity of interaction
- Constant time parallel computations in \(\lambda\)-calculus
- On complexity bounds and confluence of parallel term rewriting
- Title not available (Why is that?)
- Termination Analysis for the $$\pi $$-Calculus by Reduction to Sequential Program Termination
- Resource Usage Analysis for the Pi-Calculus
- Read/write factorizable programs
- Causal computational complexity of distributed processes
This page was built for publication: Types for complexity of parallel computation in pi-calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2233448)
