Type-Based Complexity Analysis for Fork Processes

DOI10.1007/978-3-642-37075-5_20zbMath1260.68097OpenAlexW22044255MaRDI QIDQ4910427

Romain Péchoux, Emmanuel Hainry, Jean-Yves Marion

Publication date: 18 March 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-37075-5_20

zbMATH Keywords

concurrent programmingimplicit computational complexitysecure information flowPSpacetiering

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (6)

\textsc{ComplexityParser}: an automatic tool for certifying poly-time complexity of Java programs ⋮ A type-based complexity analysis of object oriented programs ⋮ Types for complexity of parallel computation in pi-calculus ⋮ Type-two polynomial-time and restricted lookahead ⋮ Unnamed Item ⋮ Causal computational complexity of distributed processes

This page was built for publication: Type-Based Complexity Analysis for Fork Processes