Skip to Main content Skip to Navigation

Type-based complexity analysis for fork processes

Emmanuel Hainry 1 Jean-Yves Marion 1 Romain Péchoux 1
1 CARTE - Theoretical adverse computations, and safety
Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods
Abstract : We introduce a type system for concurrent programs described as a parallel imperative language using while-loops and fork/wait instructions, in which processes do not share a global memory, in order to analyze computational complexity. The type system provides an analysis of the data-flow based both on a data ramification principle related to tiering discipline and on secure typed languages. The main result states that well-typed processes characterize exactly the set of functions computable in polynomial space under termination, confluence and lock-freedom assumptions. More precisely, each process computes in polynomial time so that the evaluation of a process may be performed in polynomial time on a parallel model of computation. Type inference of the presented analysis is decidable in linear time provided that basic operator semantics is known.
Document type :
Conference papers
Complete list of metadatas

Cited literature [23 references]  Display  Hide  Download

https://hal.inria.fr/hal-00755450
Contributor : Emmanuel Hainry <>
Submitted on : Friday, October 4, 2013 - 11:42:15 AM
Last modification on : Thursday, March 5, 2020 - 11:02:09 AM
Document(s) archivé(s) le : Friday, April 7, 2017 - 6:14:16 AM

File

fossacs.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Emmanuel Hainry, Jean-Yves Marion, Romain Péchoux. Type-based complexity analysis for fork processes. 16th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS), Mar 2013, Rome, Italy. pp.305-320, ⟨10.1007/978-3-642-37075-5_20⟩. ⟨hal-00755450v2⟩

Share

Metrics

Record views

566

Files downloads

278