Constraint-based inter-procedural analysis of parallel programs
Identifieur interne : 000D09 ( PascalFrancis/Checkpoint ); précédent : 000D08; suivant : 000D10Constraint-based inter-procedural analysis of parallel programs
Auteurs : H. Seidl [Allemagne] ; B. Steffen [Allemagne]Source :
- Lecture notes in computer science [ 0302-9743 ] ; 2000.
Descripteurs français
- Pascal (Inist)
English descriptors
- KwdEn :
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.
Affiliations:
Links toward previous steps (curation, corpus...)
Links to Exploration step
Pascal:00-0288718Le document en format XML
<record><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></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><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0></fA01><fA05><s2>1782</s2></fA05><fA08 i1="01" i2="1" l="ENG"><s1>Constraint-based inter-procedural analysis of parallel programs</s1></fA08><fA09 i1="01" i2="1" l="ENG"><s1>Programming languages and systems : Berlin, 25 March - 2 April 2000</s1></fA09><fA11 i1="01" i2="1"><s1>SEIDL (H.)</s1></fA11><fA11 i1="02" i2="1"><s1>STEFFEN (B.)</s1></fA11><fA12 i1="01" i2="1"><s1>SMOLKA (Gert)</s1><s9>ed.</s9></fA12><fA14 i1="01"><s1>FB IV - Informatik, Universität Trier</s1><s2>54286 Trier</s2><s3>DEU</s3><sZ>1 aut.</sZ></fA14><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></fA14><fA20><s1>351-365</s1></fA20><fA21><s1>2000</s1></fA21><fA23 i1="01"><s0>ENG</s0></fA23><fA26 i1="01"><s0>3-540-67262-1</s0></fA26><fA43 i1="01"><s1>INIST</s1><s2>16343</s2><s5>354000087618510230</s5></fA43><fA44><s0>0000</s0><s1>© 2000 INIST-CNRS. All rights reserved.</s1></fA44><fA45><s0>13 ref.</s0></fA45><fA47 i1="01" i2="1"><s0>00-0288718</s0></fA47><fA60><s1>P</s1><s2>C</s2></fA60><fA61><s0>A</s0></fA61><fA64 i1="01" i2="1"><s0>Lecture notes in computer science</s0></fA64><fA66 i1="01"><s0>DEU</s0></fA66><fC01 i1="01" l="ENG"><s0>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.</s0></fC01><fC02 i1="01" i2="X"><s0>001D02A07</s0></fC02><fC03 i1="01" i2="X" l="FRE"><s0>Informatique théorique</s0><s5>01</s5></fC03><fC03 i1="01" i2="X" l="ENG"><s0>Computer theory</s0><s5>01</s5></fC03><fC03 i1="01" i2="X" l="SPA"><s0>Informática teórica</s0><s5>01</s5></fC03><fC03 i1="02" i2="X" l="FRE"><s0>Programmation parallèle</s0><s5>02</s5></fC03><fC03 i1="02" i2="X" l="ENG"><s0>Parallel programming</s0><s5>02</s5></fC03><fC03 i1="02" i2="X" l="SPA"><s0>Programación paralela</s0><s5>02</s5></fC03><fC03 i1="03" i2="X" l="FRE"><s0>Programmation logique</s0><s5>03</s5></fC03><fC03 i1="03" i2="X" l="ENG"><s0>Logical programming</s0><s5>03</s5></fC03><fC03 i1="03" i2="X" l="SPA"><s0>Programación lógica</s0><s5>03</s5></fC03><fC03 i1="04" i2="X" l="FRE"><s0>Analyse programme</s0><s5>04</s5></fC03><fC03 i1="04" i2="X" l="ENG"><s0>Program analysis</s0><s5>04</s5></fC03><fC03 i1="04" i2="X" l="SPA"><s0>Análisis programa</s0><s5>04</s5></fC03><fC03 i1="05" i2="X" l="FRE"><s0>Analyse syntaxique</s0><s5>05</s5></fC03><fC03 i1="05" i2="X" l="ENG"><s0>Syntactic analysis</s0><s5>05</s5></fC03><fC03 i1="05" i2="X" l="SPA"><s0>Análisis sintáxico</s0><s5>05</s5></fC03><fC03 i1="06" i2="X" l="FRE"><s0>Analyse sémantique</s0><s5>06</s5></fC03><fC03 i1="06" i2="X" l="ENG"><s0>Semantic analysis</s0><s5>06</s5></fC03><fC03 i1="06" i2="X" l="SPA"><s0>Análisis semántico</s0><s5>06</s5></fC03><fN21><s1>192</s1></fN21></pA><pR><fA30 i1="01" i2="1" l="ENG"><s1>ESOP : European symposium on programming</s1><s2>9</s2><s3>Berlin DEU</s3><s4>2000-03-25</s4></fA30></pR></standard></inist><affiliations><list><country><li>Allemagne</li></country><region><li>District d'Arnsberg</li><li>Rhénanie-du-Nord-Westphalie</li></region><settlement><li>Dortmund</li></settlement></list><tree><country name="Allemagne"><noRegion><name sortKey="Seidl, H" sort="Seidl, H" uniqKey="Seidl H" first="H." last="Seidl">H. Seidl</name></noRegion><name sortKey="Steffen, B" sort="Steffen, B" uniqKey="Steffen B" first="B." last="Steffen">B. Steffen</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/PascalFrancis/Checkpoint
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000D09 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Checkpoint/biblio.hfd -nk 000D09 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Rhénanie
|area= UnivTrevesV1
|flux= PascalFrancis
|étape= Checkpoint
|type= RBID
|clé= Pascal:00-0288718
|texte= Constraint-based inter-procedural analysis of parallel programs
}}
| This area was generated with Dilib version V0.6.31. |  |