Constraint-Based Inter-Procedural Analysis of Parallel Programs
Identifieur interne : 001F66 ( Main/Curation ); précédent : 001F65; suivant : 001F67Constraint-Based Inter-Procedural Analysis of Parallel Programs
Auteurs : Helmut Seidl [Allemagne] ; Bernhard Steffen [Allemagne]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2000.
Descripteurs français
- Pascal (Inist)
English descriptors
- KwdEn :
Abstract
Abstract: We provide a uniform framework for the analysis of programs with procedures and explicit, unbounded, fork/join parallelism covering not only bitvector problems like reaching definitions or live variables but also non-bitvector problems like simple constant propagation. Due to their structural similarity to the sequential case, the resulting algorithms are as efficient as their widely accepted sequential counterparts, and they can easily be integrated in existing program analysis environments like e.g. MetaFrame or PAG. We are therefore convinced that our method will soon find its way into industrial-scale computer systems.
Url:
DOI: 10.1007/3-540-46425-5_23
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: Pour aller vers cette notice dans l'étape Curation :001151
- to stream Istex, to step Curation: Pour aller vers cette notice dans l'étape Curation :001040
- to stream Istex, to step Checkpoint: Pour aller vers cette notice dans l'étape Curation :000D03
- to stream Main, to step Merge: Pour aller vers cette notice dans l'étape Curation :002279
- to stream PascalFrancis, to step Corpus: Pour aller vers cette notice dans l'étape Curation :000F35
- to stream PascalFrancis, to step Curation: Pour aller vers cette notice dans l'étape Curation :000034
- to stream PascalFrancis, to step Checkpoint: Pour aller vers cette notice dans l'étape Curation :000D09
- to stream Main, to step Merge: Pour aller vers cette notice dans l'étape Curation :002355
Links to Exploration step
ISTEX:C57F17ED9BD2BBBF9EB298053BF1891AF1B37098Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Constraint-Based Inter-Procedural Analysis of Parallel Programs</title><author><name sortKey="Seidl, Helmut" sort="Seidl, Helmut" uniqKey="Seidl H" first="Helmut" last="Seidl">Helmut Seidl</name></author><author><name sortKey="Steffen, Bernhard" sort="Steffen, Bernhard" uniqKey="Steffen B" first="Bernhard" last="Steffen">Bernhard Steffen</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:C57F17ED9BD2BBBF9EB298053BF1891AF1B37098</idno><date when="2000" year="2000">2000</date><idno type="doi">10.1007/3-540-46425-5_23</idno><idno type="url">https://api.istex.fr/document/C57F17ED9BD2BBBF9EB298053BF1891AF1B37098/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001151</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001151</idno><idno type="wicri:Area/Istex/Curation">001040</idno><idno type="wicri:Area/Istex/Checkpoint">000D03</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000D03</idno><idno type="wicri:doubleKey">0302-9743:2000:Seidl H:constraint:based:inter</idno><idno type="wicri:Area/Main/Merge">002279</idno><idno type="wicri:source">INIST</idno><idno type="RBID">Pascal:00-0288718</idno><idno type="wicri:Area/PascalFrancis/Corpus">000F35</idno><idno type="wicri:Area/PascalFrancis/Curation">000034</idno><idno type="wicri:Area/PascalFrancis/Checkpoint">000D09</idno><idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000D09</idno><idno type="wicri:doubleKey">0302-9743:2000:Seidl H:constraint:based:inter</idno><idno type="wicri:Area/Main/Merge">002355</idno><idno type="wicri:Area/Main/Curation">001F66</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Constraint-Based Inter-Procedural Analysis of Parallel Programs</title><author><name sortKey="Seidl, Helmut" sort="Seidl, Helmut" uniqKey="Seidl H" first="Helmut" last="Seidl">Helmut Seidl</name><affiliation wicri:level="1"><country xml:lang="fr">Allemagne</country><wicri:regionArea>FB IV - Informatik, Universität Trier, D-54286, Trier</wicri:regionArea><wicri:noRegion>54286, Trier</wicri:noRegion><wicri:noRegion>Trier</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author><author><name sortKey="Steffen, Bernhard" sort="Steffen, Bernhard" uniqKey="Steffen B" first="Bernhard" last="Steffen">Bernhard Steffen</name><affiliation wicri:level="3"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Lehrstuhl für Programmiersysteme, Universität Dortmund, Baroper Straße 301, D-44221, Dortmund</wicri:regionArea><placeName><region type="land" nuts="1">Rhénanie-du-Nord-Westphalie</region><region type="district" nuts="2">District d'Arnsberg</region><settlement type="city">Dortmund</settlement></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2000</date></imprint><idno type="ISSN">0302-9743</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">C57F17ED9BD2BBBF9EB298053BF1891AF1B37098</idno><idno type="DOI">10.1007/3-540-46425-5_23</idno><idno type="ChapterID">23</idno><idno type="ChapterID">Chap23</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Computer theory</term><term>Logical programming</term><term>Parallel programming</term><term>Program analysis</term><term>Semantic analysis</term><term>Syntactic analysis</term></keywords><keywords scheme="Pascal" xml:lang="fr"><term>Analyse programme</term><term>Analyse syntaxique</term><term>Analyse sémantique</term><term>Informatique théorique</term><term>Programmation logique</term><term>Programmation parallèle</term></keywords></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: We provide a uniform framework for the analysis of programs with procedures and explicit, unbounded, fork/join parallelism covering not only bitvector problems like reaching definitions or live variables but also non-bitvector problems like simple constant propagation. Due to their structural similarity to the sequential case, the resulting algorithms are as efficient as their widely accepted sequential counterparts, and they can easily be integrated in existing program analysis environments like e.g. MetaFrame or PAG. We are therefore convinced that our method will soon find its way into industrial-scale computer systems.</div></front></TEI><double idat="0302-9743:2000:Seidl H:constraint:based:inter"><INIST><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Constraint-based inter-procedural analysis of parallel programs</title><author><name sortKey="Seidl, H" sort="Seidl, H" uniqKey="Seidl H" first="H." last="Seidl">H. Seidl</name><affiliation wicri:level="1"><inist:fA14 i1="01"><s1>FB IV - Informatik, Universität Trier</s1><s2>54286 Trier</s2><s3>DEU</s3><sZ>1 aut.</sZ></inist:fA14><country>Allemagne</country><wicri:noRegion>54286 Trier</wicri:noRegion><wicri:noRegion>Universität Trier</wicri:noRegion><wicri:noRegion>54286 Trier</wicri:noRegion></affiliation></author><author><name sortKey="Steffen, B" sort="Steffen, B" uniqKey="Steffen B" first="B." last="Steffen">B. Steffen</name><affiliation wicri:level="3"><inist:fA14 i1="02"><s1>Lehrstuhl für Programmiersysteme, Universität Dortmund, Baroper Strasse 301</s1><s2>44221 Dortmund</s2><s3>DEU</s3><sZ>2 aut.</sZ></inist:fA14><country>Allemagne</country><placeName><region type="land" nuts="1">Rhénanie-du-Nord-Westphalie</region><region type="district" nuts="2">District d'Arnsberg</region><settlement type="city">Dortmund</settlement></placeName></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">INIST</idno><idno type="inist">00-0288718</idno><date when="2000">2000</date><idno type="stanalyst">PASCAL 00-0288718 INIST</idno><idno type="RBID">Pascal:00-0288718</idno><idno type="wicri:Area/PascalFrancis/Corpus">000F35</idno><idno type="wicri:Area/PascalFrancis/Curation">000034</idno><idno type="wicri:Area/PascalFrancis/Checkpoint">000D09</idno><idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000D09</idno><idno type="wicri:doubleKey">0302-9743:2000:Seidl H:constraint:based:inter</idno><idno type="wicri:Area/Main/Merge">002355</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Constraint-based inter-procedural analysis of parallel programs</title><author><name sortKey="Seidl, H" sort="Seidl, H" uniqKey="Seidl H" first="H." last="Seidl">H. Seidl</name><affiliation wicri:level="1"><inist:fA14 i1="01"><s1>FB IV - Informatik, Universität Trier</s1><s2>54286 Trier</s2><s3>DEU</s3><sZ>1 aut.</sZ></inist:fA14><country>Allemagne</country><wicri:noRegion>54286 Trier</wicri:noRegion><wicri:noRegion>Universität Trier</wicri:noRegion><wicri:noRegion>54286 Trier</wicri:noRegion></affiliation></author><author><name sortKey="Steffen, B" sort="Steffen, B" uniqKey="Steffen B" first="B." last="Steffen">B. Steffen</name><affiliation wicri:level="3"><inist:fA14 i1="02"><s1>Lehrstuhl für Programmiersysteme, Universität Dortmund, Baroper Strasse 301</s1><s2>44221 Dortmund</s2><s3>DEU</s3><sZ>2 aut.</sZ></inist:fA14><country>Allemagne</country><placeName><region type="land" nuts="1">Rhénanie-du-Nord-Westphalie</region><region type="district" nuts="2">District d'Arnsberg</region><settlement type="city">Dortmund</settlement></placeName></affiliation></author></analytic><series><title level="j" type="main">Lecture notes in computer science</title><idno type="ISSN">0302-9743</idno><imprint><date when="2000">2000</date></imprint></series></biblStruct></sourceDesc><seriesStmt><title level="j" type="main">Lecture notes in computer science</title><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Computer theory</term><term>Logical programming</term><term>Parallel programming</term><term>Program analysis</term><term>Semantic analysis</term><term>Syntactic analysis</term></keywords><keywords scheme="Pascal" xml:lang="fr"><term>Informatique théorique</term><term>Programmation parallèle</term><term>Programmation logique</term><term>Analyse programme</term><term>Analyse syntaxique</term><term>Analyse sémantique</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">We provide a uniform framework for the analysis of programs with procedures and explicit, unbounded, fork/join parallelism covering not only bitvector problems like reaching definitions or live variables but also non-bitvector problems like simple constant propagation. Due to their structural similarity to the sequential case, the resulting algorithms are as efficient as their widely accepted sequential counterparts, and they can easily be integrated in existing program analysis environments like e.g. METAFRAME or PAG. We are therefore convinced that our method will soon find its way into industrial-scale computer systems.</div></front></TEI></INIST><ISTEX><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Constraint-Based Inter-Procedural Analysis of Parallel Programs</title><author><name sortKey="Seidl, Helmut" sort="Seidl, Helmut" uniqKey="Seidl H" first="Helmut" last="Seidl">Helmut Seidl</name></author><author><name sortKey="Steffen, Bernhard" sort="Steffen, Bernhard" uniqKey="Steffen B" first="Bernhard" last="Steffen">Bernhard Steffen</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:C57F17ED9BD2BBBF9EB298053BF1891AF1B37098</idno><date when="2000" year="2000">2000</date><idno type="doi">10.1007/3-540-46425-5_23</idno><idno type="url">https://api.istex.fr/document/C57F17ED9BD2BBBF9EB298053BF1891AF1B37098/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001151</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001151</idno><idno type="wicri:Area/Istex/Curation">001040</idno><idno type="wicri:Area/Istex/Checkpoint">000D03</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000D03</idno><idno type="wicri:doubleKey">0302-9743:2000:Seidl H:constraint:based:inter</idno><idno type="wicri:Area/Main/Merge">002279</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Constraint-Based Inter-Procedural Analysis of Parallel Programs</title><author><name sortKey="Seidl, Helmut" sort="Seidl, Helmut" uniqKey="Seidl H" first="Helmut" last="Seidl">Helmut Seidl</name><affiliation wicri:level="1"><country xml:lang="fr">Allemagne</country><wicri:regionArea>FB IV - Informatik, Universität Trier, D-54286, Trier</wicri:regionArea><wicri:noRegion>54286, Trier</wicri:noRegion><wicri:noRegion>Trier</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author><author><name sortKey="Steffen, Bernhard" sort="Steffen, Bernhard" uniqKey="Steffen B" first="Bernhard" last="Steffen">Bernhard Steffen</name><affiliation wicri:level="3"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Lehrstuhl für Programmiersysteme, Universität Dortmund, Baroper Straße 301, D-44221, Dortmund</wicri:regionArea><placeName><region type="land" nuts="1">Rhénanie-du-Nord-Westphalie</region><region type="district" nuts="2">District d'Arnsberg</region><settlement type="city">Dortmund</settlement></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2000</date></imprint><idno type="ISSN">0302-9743</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">C57F17ED9BD2BBBF9EB298053BF1891AF1B37098</idno><idno type="DOI">10.1007/3-540-46425-5_23</idno><idno type="ChapterID">23</idno><idno type="ChapterID">Chap23</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: We provide a uniform framework for the analysis of programs with procedures and explicit, unbounded, fork/join parallelism covering not only bitvector problems like reaching definitions or live variables but also non-bitvector problems like simple constant propagation. Due to their structural similarity to the sequential case, the resulting algorithms are as efficient as their widely accepted sequential counterparts, and they can easily be integrated in existing program analysis environments like e.g. MetaFrame or PAG. We are therefore convinced that our method will soon find its way into industrial-scale computer systems.</div></front></TEI></ISTEX></double></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Main/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001F66 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Curation/biblio.hfd -nk 001F66 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Rhénanie
|area= UnivTrevesV1
|flux= Main
|étape= Curation
|type= RBID
|clé= ISTEX:C57F17ED9BD2BBBF9EB298053BF1891AF1B37098
|texte= Constraint-Based Inter-Procedural Analysis of Parallel Programs
}}
| This area was generated with Dilib version V0.6.31. |  |