Type-Based Complexity Analysis for Fork Processes
Identifieur interne : 001458 ( Main/Exploration ); précédent : 001457; suivant : 001459Type-Based Complexity Analysis for Fork Processes
Auteurs : Emmanuel Hainry [France] ; Jean-Yves Marion [France] ; Romain Péchoux [France]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
English descriptors
- mix :
Abstract
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.
Url:
DOI: 10.1007/978-3-642-37075-5_20
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000678
- to stream Istex, to step Curation: 000673
- to stream Istex, to step Checkpoint: 000084
- to stream Hal, to step Corpus: 005012
- to stream Hal, to step Curation: 005012
- to stream Hal, to step Checkpoint: 001200
- to stream Main, to step Merge: 001470
- to stream Main, to step Curation: 001458
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Type-Based Complexity Analysis for Fork Processes</title><author><name sortKey="Hainry, Emmanuel" sort="Hainry, Emmanuel" uniqKey="Hainry E" first="Emmanuel" last="Hainry">Emmanuel Hainry</name></author><author><name sortKey="Marion, Jean Yves" sort="Marion, Jean Yves" uniqKey="Marion J" first="Jean-Yves" last="Marion">Jean-Yves Marion</name></author><author><name sortKey="Pechoux, Romain" sort="Pechoux, Romain" uniqKey="Pechoux R" first="Romain" last="Péchoux">Romain Péchoux</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:1DBB047120F059BEA2086B9226A6E95D506B741D</idno><date when="2013" year="2013">2013</date><idno type="doi">10.1007/978-3-642-37075-5_20</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-G9S1V1Q9-W/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">000678</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000678</idno><idno type="wicri:Area/Istex/Curation">000673</idno><idno type="wicri:Area/Istex/Checkpoint">000084</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000084</idno><idno type="wicri:doubleKey">0302-9743:2013:Hainry E:type:based:complexity</idno><idno type="wicri:source">HAL</idno><idno type="RBID">Hal:hal-00755450</idno><idno type="url">https://hal.inria.fr/hal-00755450</idno><idno type="wicri:Area/Hal/Corpus">005012</idno><idno type="wicri:Area/Hal/Curation">005012</idno><idno type="wicri:Area/Hal/Checkpoint">001200</idno><idno type="wicri:explorRef" wicri:stream="Hal" wicri:step="Checkpoint">001200</idno><idno type="wicri:Area/Main/Merge">001470</idno><idno type="wicri:Area/Main/Curation">001458</idno><idno type="wicri:Area/Main/Exploration">001458</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Type-Based Complexity Analysis for Fork Processes</title><author><name sortKey="Hainry, Emmanuel" sort="Hainry, Emmanuel" uniqKey="Hainry E" first="Emmanuel" last="Hainry">Emmanuel Hainry</name><affiliation wicri:level="1"><country xml:lang="fr">France</country><wicri:regionArea>Université de Lorraine and LORIA</wicri:regionArea></affiliation><affiliation wicri:level="1"><country wicri:rule="url">France</country></affiliation></author><author><name sortKey="Marion, Jean Yves" sort="Marion, Jean Yves" uniqKey="Marion J" first="Jean-Yves" last="Marion">Jean-Yves Marion</name><affiliation wicri:level="1"><country xml:lang="fr">France</country><wicri:regionArea>Université de Lorraine and LORIA</wicri:regionArea></affiliation><affiliation wicri:level="1"><country wicri:rule="url">France</country></affiliation></author><author><name sortKey="Pechoux, Romain" sort="Pechoux, Romain" uniqKey="Pechoux R" first="Romain" last="Péchoux">Romain Péchoux</name><affiliation wicri:level="1"><country xml:lang="fr">France</country><wicri:regionArea>Université de Lorraine and LORIA</wicri:regionArea></affiliation><affiliation wicri:level="1"><country wicri:rule="url">France</country></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="mix" xml:lang="en"><term>Concurrent Programming</term><term>Implicit Computational Complexity</term><term>PSpace</term><term>Secure Information Flow</term><term>Tiering</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">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.</div></front></TEI><affiliations><list><country><li>France</li></country></list><tree><country name="France"><noRegion><name sortKey="Hainry, Emmanuel" sort="Hainry, Emmanuel" uniqKey="Hainry E" first="Emmanuel" last="Hainry">Emmanuel Hainry</name></noRegion><name sortKey="Hainry, Emmanuel" sort="Hainry, Emmanuel" uniqKey="Hainry E" first="Emmanuel" last="Hainry">Emmanuel Hainry</name><name sortKey="Marion, Jean Yves" sort="Marion, Jean Yves" uniqKey="Marion J" first="Jean-Yves" last="Marion">Jean-Yves Marion</name><name sortKey="Marion, Jean Yves" sort="Marion, Jean Yves" uniqKey="Marion J" first="Jean-Yves" last="Marion">Jean-Yves Marion</name><name sortKey="Pechoux, Romain" sort="Pechoux, Romain" uniqKey="Pechoux R" first="Romain" last="Péchoux">Romain Péchoux</name><name sortKey="Pechoux, Romain" sort="Pechoux, Romain" uniqKey="Pechoux R" first="Romain" last="Péchoux">Romain Péchoux</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001458 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 001458 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:1DBB047120F059BEA2086B9226A6E95D506B741D
|texte= Type-Based Complexity Analysis for Fork Processes
}}
| This area was generated with Dilib version V0.6.33. |  |