Types for complexity of parallel computation in pi-calculus

DOI10.1007/978-3-030-72019-3_3MaRDI QIDQ2233448zbMATH OpenOpenAlexFDO

Authors Patrick Baillot, Alexis Ghyselen

Publication date 18 October 2021

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.26226/morressier.604907f41a80aac83ca25d13

zbMATH Keywords

implicit computational complexitypi-calculustype systemscomplexity analysisprocess calculisize types

Mathematics Subject Classification ID

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)

Recommendations

• scientific article; zbMATH DE number 2118223
• Type-Based Complexity Analysis for Fork Processes
• The complexity of interaction
• Causal computational complexity of distributed processes
• A generic type system for the pi-calculus

Cites work

• A New Type System for Deadlock-Free Processes
• A logical account of pspace
• A type system for lock-free processes
• Amortized resource analysis with polynomial potential. A static inference of polynomial bounds for functional programs
• An elementary affine \(\lambda \)-calculus with multithreading and side effects
• Automatic Static Cost Analysis for Parallel Programs
• Causal computational complexity of distributed processes
• Causality and replication in concurrent processes
• Causality for mobile processes
• Light logics and higher-order processes
• Linear dependent types and relative completeness
• Linear types and non-size-increasing polynomial time computation.
• Multivariate amortized resource analysis
• On session types and polynomial time
• Practical foundations for programming languages
• Rely-guarantee termination and cost analyses of loops with concurrent interleavings
• Session types revisited
• Static prediction of heap space usage for first-order functional programs
• The \(\pi\)-calculus: A theory of mobile processes
• The complexity of interaction
• Type systems for concurrent programs.
• Type-Based Complexity Analysis for Fork Processes
• Type-based information flow analysis for the \(\pi\)-calculus
• Types for complexity of parallel computation in pi-calculus
• Work analysis with resource-aware session types

Cited in

(12)

• Causal computational complexity of distributed processes
• 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
• scientific article; zbMATH DE number 2006627 (Why is no real title available?)
• On complexity bounds and confluence of parallel term rewriting
• Termination Analysis for the $$\pi $$-Calculus by Reduction to Sequential Program Termination
• Resource Usage Analysis for the Pi-Calculus
• Read/write factorizable programs

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)