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.
Type de document :
Communication dans un congrès
Pfenning, Frank. 16th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS), Mar 2013, Rome, Italy. Springer, 7794, pp.305-320, 2013, Lecture Notes in Computer Science. 〈10.1007/978-3-642-37075-5_20〉
Liste complète des métadonnées

Littérature citée [23 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-00755450
Contributeur : Emmanuel Hainry <>
Soumis le : vendredi 4 octobre 2013 - 11:42:15
Dernière modification le : vendredi 9 février 2018 - 10:48:02
Document(s) archivé(s) le : vendredi 7 avril 2017 - 06:14:16

Fichier

fossacs.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

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

Partager

Métriques

Consultations de la notice

489

Téléchargements de fichiers

112