Constraint-Based Inter-Procedural Analysis of Parallel Programs
Identifieur interne : 001151 ( Istex/Corpus ); précédent : 001150; suivant : 001152Constraint-Based Inter-Procedural Analysis of Parallel Programs
Auteurs : Helmut Seidl ; Bernhard SteffenSource :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2000.
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 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><affiliation><mods:affiliation>FB IV - Informatik, Universität Trier, D-54286, Trier, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: seidl@uni-trier.de</mods:affiliation></affiliation></author><author><name sortKey="Steffen, Bernhard" sort="Steffen, Bernhard" uniqKey="Steffen B" first="Bernhard" last="Steffen">Bernhard Steffen</name><affiliation><mods:affiliation>Lehrstuhl für Programmiersysteme, Universität Dortmund, Baroper Straße 301, D-44221, Dortmund, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: Bernhard.Steffen@cs.uni-dortmund.de</mods:affiliation></affiliation></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></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><mods:affiliation>FB IV - Informatik, Universität Trier, D-54286, Trier, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: seidl@uni-trier.de</mods:affiliation></affiliation></author><author><name sortKey="Steffen, Bernhard" sort="Steffen, Bernhard" uniqKey="Steffen B" first="Bernhard" last="Steffen">Bernhard Steffen</name><affiliation><mods:affiliation>Lehrstuhl für Programmiersysteme, Universität Dortmund, Baroper Straße 301, D-44221, Dortmund, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: Bernhard.Steffen@cs.uni-dortmund.de</mods:affiliation></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><corpusName>springer</corpusName><author><json:item><name>Helmut Seidl</name><affiliations><json:string>FB IV - Informatik, Universität Trier, D-54286, Trier, Germany</json:string><json:string>E-mail: seidl@uni-trier.de</json:string></affiliations></json:item><json:item><name>Bernhard Steffen</name><affiliations><json:string>Lehrstuhl für Programmiersysteme, Universität Dortmund, Baroper Straße 301, D-44221, Dortmund, Germany</json:string><json:string>E-mail: Bernhard.Steffen@cs.uni-dortmund.de</json:string></affiliations></json:item></author><language><json:string>eng</json:string></language><originalGenre><json:string>OriginalPaper</json:string></originalGenre><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.</abstract><qualityIndicators><score>6.08</score><pdfVersion>1.3</pdfVersion><pdfPageSize>430 x 650 pts</pdfPageSize><refBibsNative>false</refBibsNative><keywordCount>0</keywordCount><abstractCharCount>640</abstractCharCount><pdfWordCount>6399</pdfWordCount><pdfCharCount>31649</pdfCharCount><pdfPageCount>15</pdfPageCount><abstractWordCount>90</abstractWordCount></qualityIndicators><title>Constraint-Based Inter-Procedural Analysis of Parallel Programs</title><chapterId><json:string>23</json:string><json:string>Chap23</json:string></chapterId><refBibs><json:item><author><json:item><name>Martin Alt</name></json:item><json:item><name>Florian Martin</name></json:item></author><host><pages><last>50</last><first>33</first></pages><author></author><title>Proceedings of 2nd Static Analysis Symposium (SAS)</title><publicationDate>1995</publicationDate></host><title>Generation of Efficient Interprocedural Analyzers with PAG</title><publicationDate>1995</publicationDate></json:item><json:item><author><json:item><name>Patrick Cousot</name></json:item></author><host><pages><last>342</last><first>303</first></pages><author></author><title>Program Flow Analysis: Theory and Applications, chapter 10</title><publicationDate>1981</publicationDate></host><title>Semantic Foundations of Program Analysis</title><publicationDate>1981</publicationDate></json:item><json:item><author><json:item><name>Patrick Cousot</name></json:item><json:item><name>Radhia Cousot</name></json:item></author><host><pages><last>252</last><first>238</first></pages><author></author><title>Proceedings of 4th ACM Symposium on Principles of Programming Languages (POPL)</title><publicationDate>1977</publicationDate></host><title>Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints</title><publicationDate>1977</publicationDate></json:item><json:item><author><json:item><name>Patrick Cousot</name></json:item><json:item><name>Radhia Cousot</name></json:item></author><host><pages><last>277</last><first>237</first></pages><author></author><title>Formal Descriptions of Programming Concepts</title><publicationDate>1977</publicationDate></host><title>Static Determination of Dynamic Properties of Recursive Programs</title><publicationDate>1977</publicationDate></json:item><json:item><author><json:item><name>J Esparza</name></json:item><json:item><name>J Knoop</name></json:item></author><host><pages><last>30</last><first>14</first></pages><author></author><title>FoSSaCS '99</title><publicationDate>1999</publicationDate></host><title>An Automata-theoretic Approach to Interprocedural Data-flow Analysis</title><publicationDate>1999</publicationDate></json:item><json:item><author><json:item><name>J Esparza</name></json:item><json:item><name>A Podelski</name></json:item></author><host><author></author><title>ACM International Conference on Princples of Programming Languages (POPL)</title><publicationDate>2000</publicationDate></host><title>Efficient Algorithms for pre * and post * on Interprocedural Parallel Flow Graphs</title><publicationDate>2000</publicationDate></json:item><json:item><host><author><json:item><name>M,S Hecht</name></json:item></author><title>Flow Analysis of Computer Programs. The Computer Science Library</title><publicationDate>1977</publicationDate></host></json:item><json:item><author><json:item><name>J Knoop</name></json:item><json:item><name>B Steffen</name></json:item></author><host><pages><last>140</last><first>125</first></pages><author></author><title>4th International Conference on Compiler Construction</title><publicationDate>1992</publicationDate></host><title>The Interprocedural Coincidence Theorem</title><publicationDate>1992</publicationDate></json:item><json:item><author><json:item><name>J Knoop</name></json:item></author><host><pages><last>455</last><first>445</first></pages><author></author><title>4th European Conference on Parallel Processing</title><publicationDate>1998</publicationDate></host><title>Parallel Constant Propagation</title><publicationDate>1998</publicationDate></json:item><json:item><author><json:item><name>J Knoop</name></json:item><json:item><name>O Rüthing</name></json:item><json:item><name>B Steffen</name></json:item></author><host><volume>4</volume><pages><last>246</last><first>211</first></pages><issue>4</issue><author></author><title>Journal of Programming Languages</title><publicationDate>1996-12</publicationDate></host><title>Towards a Tool Kit for the Automatic Generation of Interprocedural Data Flow Analyses</title><publicationDate>1996-12</publicationDate></json:item><json:item><author><json:item><name>J Knoop</name></json:item><json:item><name>B Steffen</name></json:item><json:item><name>J Vollmer</name></json:item></author><host><volume>18</volume><pages><last>299</last><first>268</first></pages><issue>3</issue><author></author><title>ACM Transactions on Programming Languages and Systems</title><publicationDate>1996</publicationDate></host><title>Parallelism for Free: Efficient and Optimal Bitvector Analyses for Parallel Programs</title><publicationDate>1996</publicationDate></json:item><json:item><author><json:item><name>D Lugiez</name></json:item><json:item><name>P Schnoebelen</name></json:item></author><host><pages><last>66</last><first>50</first></pages><author></author><title>9th International Conference on Concurrency (CONCUR), volume 1466 of Lecture Note In Computer Science (LNCS)</title><publicationDate>1998</publicationDate></host><title>The Regular Viewpoint on PA-Processes</title><publicationDate>1998</publicationDate></json:item><json:item><author><json:item><name>H Seidl</name></json:item><json:item><name>C Fecht</name></json:item></author><host><volume>43</volume><pages><last>156</last><first>123</first></pages><issue>2</issue><author></author><title>Journal of Logic Programming (JLP)</title><publicationDate>2000</publicationDate></host><title>Interprocedural Analyses: A Comparison</title><publicationDate>2000</publicationDate></json:item></refBibs><genre><json:string>conference</json:string></genre><serie><editor><json:item><name>Gerhard Goos</name><affiliations><json:string>Karlsruhe University, Germany</json:string></affiliations></json:item><json:item><name>Juris Hartmanis</name><affiliations><json:string>Cornell University, NY, USA</json:string></affiliations></json:item><json:item><name>Jan van Leeuwen</name><affiliations><json:string>Utrecht University, The Netherlands</json:string></affiliations></json:item></editor><issn><json:string>0302-9743</json:string></issn><language><json:string>unknown</json:string></language><title>Lecture Notes in Computer Science</title><copyrightDate>2000</copyrightDate></serie><host><editor><json:item><name>Gert Smolka</name><affiliations><json:string>Programming Systems Lab, University of Saarland, Building 45, P. O. Box 15 11 50, 66041, Saarbrücken, Germany</json:string><json:string>E-mail: smolka@ps.uni-sb.de</json:string></affiliations></json:item></editor><subject><json:item><value>Computer Science</value></json:item><json:item><value>Computer Science</value></json:item><json:item><value>Programming Languages, Compilers, Interpreters</value></json:item><json:item><value>Logics and Meanings of Programs</value></json:item><json:item><value>Programming Techniques</value></json:item><json:item><value>Software Engineering</value></json:item><json:item><value>Mathematical Logic and Formal Languages</value></json:item></subject><isbn><json:string>978-3-540-67262-3</json:string></isbn><language><json:string>unknown</json:string></language><title>Programming Languages and Systems</title><bookId><json:string>3-540-46425-5</json:string></bookId><volume>1782</volume><pages><last>365</last><first>351</first></pages><issn><json:string>0302-9743</json:string></issn><genre><json:string>book-series</json:string></genre><eisbn><json:string>978-3-540-46425-9</json:string></eisbn><copyrightDate>2000</copyrightDate><doi><json:string>10.1007/3-540-46425-5</json:string></doi></host><publicationDate>2000</publicationDate><copyrightDate>2000</copyrightDate><doi><json:string>10.1007/3-540-46425-5_23</json:string></doi><id>C57F17ED9BD2BBBF9EB298053BF1891AF1B37098</id><score>0.38787413</score><fulltext><json:item><extension>pdf</extension><original>true</original><mimetype>application/pdf</mimetype><uri>https://api.istex.fr/document/C57F17ED9BD2BBBF9EB298053BF1891AF1B37098/fulltext/pdf</uri></json:item><json:item><extension>zip</extension><original>false</original><mimetype>application/zip</mimetype><uri>https://api.istex.fr/document/C57F17ED9BD2BBBF9EB298053BF1891AF1B37098/fulltext/zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/document/C57F17ED9BD2BBBF9EB298053BF1891AF1B37098/fulltext/tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Constraint-Based Inter-Procedural Analysis of Parallel Programs</title><respStmt><resp>Références bibliographiques récupérées via GROBID</resp><name resp="ISTEX-API">ISTEX-API (INIST-CNRS)</name></respStmt><respStmt><resp>Références bibliographiques récupérées via GROBID</resp><name resp="ISTEX-API">ISTEX-API (INIST-CNRS)</name></respStmt></titleStmt><publicationStmt><authority>ISTEX</authority><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><availability><p>Springer-Verlag Berlin Heidelberg, 2000</p></availability><date>2000</date></publicationStmt><sourceDesc><biblStruct type="inbook"><analytic><title level="a" type="main" xml:lang="en">Constraint-Based Inter-Procedural Analysis of Parallel Programs</title><author xml:id="author-1"><persName><forename type="first">Helmut</forename><surname>Seidl</surname></persName><email>seidl@uni-trier.de</email><affiliation>FB IV - Informatik, Universität Trier, D-54286, Trier, Germany</affiliation></author><author xml:id="author-2"><persName><forename type="first">Bernhard</forename><surname>Steffen</surname></persName><email>Bernhard.Steffen@cs.uni-dortmund.de</email><affiliation>Lehrstuhl für Programmiersysteme, Universität Dortmund, Baroper Straße 301, D-44221, Dortmund, Germany</affiliation></author></analytic><monogr><title level="m">Programming Languages and Systems</title><title level="m" type="sub">9th European Symposium on Programming, ESOP 2000 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2000 Berlin, Germany, March 25 – April 2, 2000 Proceedings</title><idno type="pISBN">978-3-540-67262-3</idno><idno type="eISBN">978-3-540-46425-9</idno><idno type="pISSN">0302-9743</idno><idno type="DOI">10.1007/3-540-46425-5</idno><idno type="book-ID">3-540-46425-5</idno><idno type="book-title-ID">62748</idno><idno type="book-sequence-number">1782</idno><idno type="book-volume-number">1782</idno><idno type="book-chapter-count">27</idno><editor><persName><forename type="first">Gert</forename><surname>Smolka</surname></persName><email>smolka@ps.uni-sb.de</email><affiliation>Programming Systems Lab, University of Saarland, Building 45, P. O. Box 15 11 50, 66041, Saarbrücken, Germany</affiliation></editor><imprint><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><date type="published" when="2000-05-12"></date><biblScope unit="volume">1782</biblScope><biblScope unit="page" from="351">351</biblScope><biblScope unit="page" to="365">365</biblScope></imprint></monogr><series><title level="s">Lecture Notes in Computer Science</title><editor><persName><forename type="first">Gerhard</forename><surname>Goos</surname></persName><affiliation>Karlsruhe University, Germany</affiliation></editor><editor><persName><forename type="first">Juris</forename><surname>Hartmanis</surname></persName><affiliation>Cornell University, NY, USA</affiliation></editor><editor><persName><forename type="first">Jan</forename><surname>van Leeuwen</surname></persName><affiliation>Utrecht University, The Netherlands</affiliation></editor><biblScope><date>2000</date></biblScope><idno type="pISSN">0302-9743</idno><idno type="series-Id">558</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></fileDesc><profileDesc><creation><date>2000</date></creation><langUsage><language ident="en">en</language></langUsage><abstract xml:lang="en"><p>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.</p></abstract><textClass><keywords scheme="Book-Subject-Collection"><list><label>SUCO11645</label><item><term>Computer Science</term></item></list></keywords></textClass><textClass><keywords scheme="Book-Subject-Group"><list><label>I</label><label>I14037</label><label>I1603X</label><label>I14010</label><label>I14029</label><label>I16048</label><item><term>Computer Science</term></item><item><term>Programming Languages, Compilers, Interpreters</term></item><item><term>Logics and Meanings of Programs</term></item><item><term>Programming Techniques</term></item><item><term>Software Engineering</term></item><item><term>Mathematical Logic and Formal Languages</term></item></list></keywords></textClass></profileDesc><revisionDesc><change when="2000-05-12">Published</change><change xml:id="refBibs-istex" who="#ISTEX-API" when="2016-11-22">References added</change><change xml:id="refBibs-istex" who="#ISTEX-API" when="2017-01-20">References added</change></revisionDesc></teiHeader></istex:fulltextTEI><json:item><extension>txt</extension><original>false</original><mimetype>text/plain</mimetype><uri>https://api.istex.fr/document/C57F17ED9BD2BBBF9EB298053BF1891AF1B37098/fulltext/txt</uri></json:item></fulltext><metadata><istex:metadataXml wicri:clean="Springer, Publisher found" wicri:toSee="no header"><istex:xmlDeclaration>version="1.0" encoding="UTF-8"</istex:xmlDeclaration><istex:docType PUBLIC="-//Springer-Verlag//DTD A++ V2.4//EN" URI="http://devel.springer.de/A++/V2.4/DTD/A++V2.4.dtd" name="istex:docType"></istex:docType><istex:document><Publisher><PublisherInfo><PublisherName>Springer Berlin Heidelberg</PublisherName><PublisherLocation>Berlin, Heidelberg</PublisherLocation></PublisherInfo><Series><SeriesInfo SeriesType="Series" TocLevels="0"><SeriesID>558</SeriesID><SeriesPrintISSN>0302-9743</SeriesPrintISSN><SeriesTitle Language="En">Lecture Notes in Computer Science</SeriesTitle></SeriesInfo><SeriesHeader><EditorGroup><Editor AffiliationIDS="Aff1"><EditorName DisplayOrder="Western"><GivenName>Gerhard</GivenName><FamilyName>Goos</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff2"><EditorName DisplayOrder="Western"><GivenName>Juris</GivenName><FamilyName>Hartmanis</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff3"><EditorName DisplayOrder="Western"><GivenName>Jan</GivenName><Particle>van</Particle><FamilyName>Leeuwen</FamilyName></EditorName></Editor><Affiliation ID="Aff1"><OrgName>Karlsruhe University</OrgName><OrgAddress><Country>Germany</Country></OrgAddress></Affiliation><Affiliation ID="Aff2"><OrgName>Cornell University</OrgName><OrgAddress><State>NY</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff3"><OrgName>Utrecht University</OrgName><OrgAddress><Country>The Netherlands</Country></OrgAddress></Affiliation></EditorGroup></SeriesHeader><Book Language="En"><BookInfo BookProductType="Proceedings" ContainsESM="No" Language="En" MediaType="eBook" NumberingStyle="Unnumbered" TocLevels="0"><BookID>3-540-46425-5</BookID><BookTitle>Programming Languages and Systems</BookTitle><BookSubTitle>9th European Symposium on Programming, ESOP 2000 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2000 Berlin, Germany, March 25 – April 2, 2000 Proceedings</BookSubTitle><BookVolumeNumber>1782</BookVolumeNumber><BookSequenceNumber>1782</BookSequenceNumber><BookDOI>10.1007/3-540-46425-5</BookDOI><BookTitleID>62748</BookTitleID><BookPrintISBN>978-3-540-67262-3</BookPrintISBN><BookElectronicISBN>978-3-540-46425-9</BookElectronicISBN><BookChapterCount>27</BookChapterCount><BookHistory><OnlineDate><Year>2000</Year><Month>5</Month><Day>12</Day></OnlineDate></BookHistory><BookCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2000</CopyrightYear></BookCopyright><BookSubjectGroup><BookSubject Code="I" Type="Primary">Computer Science</BookSubject><BookSubject Code="I14037" Priority="1" Type="Secondary">Programming Languages, Compilers, Interpreters</BookSubject><BookSubject Code="I1603X" Priority="2" Type="Secondary">Logics and Meanings of Programs</BookSubject><BookSubject Code="I14010" Priority="3" Type="Secondary">Programming Techniques</BookSubject><BookSubject Code="I14029" Priority="4" Type="Secondary">Software Engineering</BookSubject><BookSubject Code="I16048" Priority="5" Type="Secondary">Mathematical Logic and Formal Languages</BookSubject><SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection></BookSubjectGroup><BookContext><SeriesID>558</SeriesID></BookContext></BookInfo><BookHeader><EditorGroup><Editor AffiliationIDS="Aff4"><EditorName DisplayOrder="Western"><GivenName>Gert</GivenName><FamilyName>Smolka</FamilyName></EditorName><Contact><Email>smolka@ps.uni-sb.de</Email></Contact></Editor><Affiliation ID="Aff4"><OrgDivision>Programming Systems Lab</OrgDivision><OrgName>University of Saarland</OrgName><OrgAddress><Street>Building 45</Street><Postbox>P. O. Box 15 11 50</Postbox><Postcode>66041</Postcode><City>Saarbrücken</City><Country>Germany</Country></OrgAddress></Affiliation></EditorGroup></BookHeader><Part ID="Part2"><PartInfo TocLevels="0"><PartID>2</PartID><PartSequenceNumber>2</PartSequenceNumber><PartTitle>Regular Papers</PartTitle><PartChapterCount>26</PartChapterCount><PartContext><SeriesID>558</SeriesID><BookID>3-540-46425-5</BookID><BookTitle>Programming Languages and Systems</BookTitle></PartContext></PartInfo><Chapter ID="Chap23" Language="En"><ChapterInfo ChapterType="OriginalPaper" ContainsESM="No" Language="En" NumberingStyle="Unnumbered" TocLevels="0"><ChapterID>23</ChapterID><ChapterDOI>10.1007/3-540-46425-5_23</ChapterDOI><ChapterSequenceNumber>23</ChapterSequenceNumber><ChapterTitle Language="En">Constraint-Based Inter-Procedural Analysis of Parallel Programs</ChapterTitle><ChapterFirstPage>351</ChapterFirstPage><ChapterLastPage>365</ChapterLastPage><ChapterCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2000</CopyrightYear></ChapterCopyright><ChapterHistory><RegistrationDate><Year>2000</Year><Month>5</Month><Day>11</Day></RegistrationDate><OnlineDate><Year>2000</Year><Month>5</Month><Day>12</Day></OnlineDate></ChapterHistory><ChapterGrants Type="Regular"><MetadataGrant Grant="OpenAccess"></MetadataGrant><AbstractGrant Grant="OpenAccess"></AbstractGrant><BodyPDFGrant Grant="Restricted"></BodyPDFGrant><BodyHTMLGrant Grant="Restricted"></BodyHTMLGrant><BibliographyGrant Grant="Restricted"></BibliographyGrant><ESMGrant Grant="Restricted"></ESMGrant></ChapterGrants><ChapterContext><SeriesID>558</SeriesID><PartID>2</PartID><BookID>3-540-46425-5</BookID><BookTitle>Programming Languages and Systems</BookTitle></ChapterContext></ChapterInfo><ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff5"><AuthorName DisplayOrder="Western"><GivenName>Helmut</GivenName><FamilyName>Seidl</FamilyName></AuthorName><Contact><Email>seidl@uni-trier.de</Email></Contact></Author><Author AffiliationIDS="Aff6"><AuthorName DisplayOrder="Western"><GivenName>Bernhard</GivenName><FamilyName>Steffen</FamilyName></AuthorName><Contact><Email>Bernhard.Steffen@cs.uni-dortmund.de</Email></Contact></Author><Affiliation ID="Aff5"><OrgDivision>FB IV - Informatik</OrgDivision><OrgName>Universität Trier</OrgName><OrgAddress><Postcode>D-54286</Postcode><City>Trier</City><Country>Germany</Country></OrgAddress></Affiliation><Affiliation ID="Aff6"><OrgDivision>Lehrstuhl für Programmiersysteme</OrgDivision><OrgName>Universität Dortmund</OrgName><OrgAddress><Street>Baroper Straße 301</Street><Postcode>D-44221</Postcode><City>Dortmund</City><Country>Germany</Country></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading><Para>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. <Emphasis Type="SmallCaps">MetaFrame</Emphasis> or PAG. We are therefore convinced that our method will soon find its way into industrial-scale computer systems.</Para></Abstract><KeywordGroup Language="En"><Heading>Keywords</Heading><Keyword>Inter-procedural program analysis</Keyword><Keyword>explicit parallelism</Keyword><Keyword>bit-vector problems</Keyword><Keyword>simple constant propagation</Keyword><Keyword>coincidence theorems</Keyword></KeywordGroup></ChapterHeader><NoBody></NoBody></Chapter></Part></Book></Series></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>Constraint-Based Inter-Procedural Analysis of Parallel Programs</title></titleInfo><titleInfo type="alternative" contentType="CDATA" lang="en"><title>Constraint-Based Inter-Procedural Analysis of Parallel Programs</title></titleInfo><name type="personal"><namePart type="given">Helmut</namePart><namePart type="family">Seidl</namePart><affiliation>FB IV - Informatik, Universität Trier, D-54286, Trier, Germany</affiliation><affiliation>E-mail: seidl@uni-trier.de</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Bernhard</namePart><namePart type="family">Steffen</namePart><affiliation>Lehrstuhl für Programmiersysteme, Universität Dortmund, Baroper Straße 301, D-44221, Dortmund, Germany</affiliation><affiliation>E-mail: Bernhard.Steffen@cs.uni-dortmund.de</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre type="conference" displayLabel="OriginalPaper"></genre><originInfo><publisher>Springer Berlin Heidelberg</publisher><place><placeTerm type="text">Berlin, Heidelberg</placeTerm></place><dateIssued encoding="w3cdtf">2000-05-12</dateIssued><copyrightDate encoding="w3cdtf">2000</copyrightDate></originInfo><language><languageTerm type="code" authority="rfc3066">en</languageTerm><languageTerm type="code" authority="iso639-2b">eng</languageTerm></language><physicalDescription><internetMediaType>text/html</internetMediaType></physicalDescription><abstract 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.</abstract><relatedItem type="host"><titleInfo><title>Programming Languages and Systems</title><subTitle>9th European Symposium on Programming, ESOP 2000 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2000 Berlin, Germany, March 25 – April 2, 2000 Proceedings</subTitle></titleInfo><name type="personal"><namePart type="given">Gert</namePart><namePart type="family">Smolka</namePart><affiliation>Programming Systems Lab, University of Saarland, Building 45, P. O. Box 15 11 50, 66041, Saarbrücken, Germany</affiliation><affiliation>E-mail: smolka@ps.uni-sb.de</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><genre type="book-series" displayLabel="Proceedings"></genre><originInfo><copyrightDate encoding="w3cdtf">2000</copyrightDate><issuance>monographic</issuance></originInfo><subject><genre>Book-Subject-Collection</genre><topic authority="SpringerSubjectCodes" authorityURI="SUCO11645">Computer Science</topic></subject><subject><genre>Book-Subject-Group</genre><topic authority="SpringerSubjectCodes" authorityURI="I">Computer Science</topic><topic authority="SpringerSubjectCodes" authorityURI="I14037">Programming Languages, Compilers, Interpreters</topic><topic authority="SpringerSubjectCodes" authorityURI="I1603X">Logics and Meanings of Programs</topic><topic authority="SpringerSubjectCodes" authorityURI="I14010">Programming Techniques</topic><topic authority="SpringerSubjectCodes" authorityURI="I14029">Software Engineering</topic><topic authority="SpringerSubjectCodes" authorityURI="I16048">Mathematical Logic and Formal Languages</topic></subject><identifier type="DOI">10.1007/3-540-46425-5</identifier><identifier type="ISBN">978-3-540-67262-3</identifier><identifier type="eISBN">978-3-540-46425-9</identifier><identifier type="ISSN">0302-9743</identifier><identifier type="BookTitleID">62748</identifier><identifier type="BookID">3-540-46425-5</identifier><identifier type="BookChapterCount">27</identifier><identifier type="BookVolumeNumber">1782</identifier><identifier type="BookSequenceNumber">1782</identifier><identifier type="PartChapterCount">26</identifier><part><date>2000</date><detail type="part"><title>Regular Papers</title></detail><detail type="volume"><number>1782</number><caption>vol.</caption></detail><extent unit="pages"><start>351</start><end>365</end></extent></part><recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 2000</recordOrigin></recordInfo></relatedItem><relatedItem type="series"><titleInfo><title>Lecture Notes in Computer Science</title></titleInfo><name type="personal"><namePart type="given">Gerhard</namePart><namePart type="family">Goos</namePart><affiliation>Karlsruhe University, Germany</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Juris</namePart><namePart type="family">Hartmanis</namePart><affiliation>Cornell University, NY, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Jan</namePart><namePart type="family">van Leeuwen</namePart><affiliation>Utrecht University, The Netherlands</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><originInfo><copyrightDate encoding="w3cdtf">2000</copyrightDate><issuance>serial</issuance></originInfo><identifier type="ISSN">0302-9743</identifier><identifier type="SeriesID">558</identifier><recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 2000</recordOrigin></recordInfo></relatedItem><identifier type="istex">C57F17ED9BD2BBBF9EB298053BF1891AF1B37098</identifier><identifier type="DOI">10.1007/3-540-46425-5_23</identifier><identifier type="ChapterID">23</identifier><identifier type="ChapterID">Chap23</identifier><accessCondition type="use and reproduction" contentType="copyright">Springer-Verlag Berlin Heidelberg, 2000</accessCondition><recordInfo><recordContentSource>SPRINGER</recordContentSource><recordOrigin>Springer-Verlag Berlin Heidelberg, 2000</recordOrigin></recordInfo></mods></metadata></istex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001151 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 001151 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Rhénanie
|area= UnivTrevesV1
|flux= Istex
|étape= Corpus
|type= RBID
|clé= ISTEX:C57F17ED9BD2BBBF9EB298053BF1891AF1B37098
|texte= Constraint-Based Inter-Procedural Analysis of Parallel Programs
}}
| This area was generated with Dilib version V0.6.31. |  |