Types for complexity of parallel computation in pi-calculus
From MaRDI portal
Publication:2233448
DOI10.1007/978-3-030-72019-3_3zbMath1473.68111OpenAlexW3136372787MaRDI QIDQ2233448
Patrick Baillot, Alexis Ghyselen
Publication date: 18 October 2021
Full work available at URL: https://doi.org/10.26226/morressier.604907f41a80aac83ca25d13
complexity analysistype systemsprocess calculiimplicit computational complexitypi-calculussize 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)
Related Items (4)
Read/write factorizable programs ⋮ Replications in reversible concurrent calculi ⋮ Analysing parallel complexity of term rewriting ⋮ Types for complexity of parallel computation in pi-calculus
Cites Work
- Unnamed Item
- Linear types and non-size-increasing polynomial time computation.
- Types for complexity of parallel computation in pi-calculus
- Rely-guarantee termination and cost analyses of loops with concurrent interleavings
- Session types revisited
- A type system for lock-free processes
- Type-based information flow analysis for the \(\pi\)-calculus
- Automatic Static Cost Analysis for Parallel Programs
- Practical Foundations for Programming Languages
- The complexity of interaction
- Static prediction of heap space usage for first-order functional programs
- Light logics and higher-order processes
- On session types and polynomial time
- An Elementary Affine λ-Calculus with Multithreading and Side Effects
- A logical account of pspace
- Amortized Resource Analysis with Polynomial Potential
- Causality for mobile processes
- Linear Dependent Types and Relative Completeness
- Type-Based Complexity Analysis for Fork Processes
- Work Analysis with Resource-Aware Session Types
- Causal Computational Complexity of Distributed Processes
- Multivariate amortized resource analysis
- A New Type System for Deadlock-Free Processes
- Formal Methods at the Crossroads. From Panacea to Foundational Support
- Perspectives of System Informatics
This page was built for publication: Types for complexity of parallel computation in pi-calculus
