Polynomial Constants Are Decidable
Identifieur interne : 001264 ( Istex/Corpus ); précédent : 001263; suivant : 001265Polynomial Constants Are Decidable
Auteurs : Markus Müller-Olm ; Helmut SeidlSource :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2002.
Abstract
Abstract: Constant propagation aims at identifying expressions that always yield a unique constant value at run-time. It is well-known that constant propagation is undecidable for programs working on integers even if guards are ignored as in non-deterministic flow graphs. We show that polynomial constants are decidable in non-deterministic flow graphs. In polynomial constant propagation, assignment statements that use the operators +, -,* are interpreted exactly but all assignments that use other operators are conservatively interpreted as non-deterministic assignments. We present a generic algorithm for constant propagation via a symbolic weakest precondition computation and show how this generic algorithm can be instantiated for polynomial constant propagation by exploiting techniques from computable ring theory.
Url:
DOI: 10.1007/3-540-45789-5_4
Links to Exploration step
ISTEX:B23AF436A3751F520EE989F38508C61937601004Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Polynomial Constants Are Decidable</title><author><name sortKey="Muller Olm, Markus" sort="Muller Olm, Markus" uniqKey="Muller Olm M" first="Markus" last="Müller-Olm">Markus Müller-Olm</name><affiliation><mods:affiliation>University of Dortmund, FB 4, LS5, 44221, Dortmund, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: mmo@ls5.cs.uni-dortmund.de</mods:affiliation></affiliation></author><author><name sortKey="Seidl, Helmut" sort="Seidl, Helmut" uniqKey="Seidl H" first="Helmut" last="Seidl">Helmut Seidl</name><affiliation><mods:affiliation>Trier University, FB 4-Informatik, 54286, Trier, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: seidl@uni-trier.de</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:B23AF436A3751F520EE989F38508C61937601004</idno><date when="2002" year="2002">2002</date><idno type="doi">10.1007/3-540-45789-5_4</idno><idno type="url">https://api.istex.fr/document/B23AF436A3751F520EE989F38508C61937601004/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001264</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001264</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Polynomial Constants Are Decidable</title><author><name sortKey="Muller Olm, Markus" sort="Muller Olm, Markus" uniqKey="Muller Olm M" first="Markus" last="Müller-Olm">Markus Müller-Olm</name><affiliation><mods:affiliation>University of Dortmund, FB 4, LS5, 44221, Dortmund, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: mmo@ls5.cs.uni-dortmund.de</mods:affiliation></affiliation></author><author><name sortKey="Seidl, Helmut" sort="Seidl, Helmut" uniqKey="Seidl H" first="Helmut" last="Seidl">Helmut Seidl</name><affiliation><mods:affiliation>Trier University, FB 4-Informatik, 54286, Trier, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: seidl@uni-trier.de</mods:affiliation></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2002</date></imprint><idno type="ISSN">0302-9743</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">B23AF436A3751F520EE989F38508C61937601004</idno><idno type="DOI">10.1007/3-540-45789-5_4</idno><idno type="ChapterID">4</idno><idno type="ChapterID">Chap4</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: Constant propagation aims at identifying expressions that always yield a unique constant value at run-time. It is well-known that constant propagation is undecidable for programs working on integers even if guards are ignored as in non-deterministic flow graphs. We show that polynomial constants are decidable in non-deterministic flow graphs. In polynomial constant propagation, assignment statements that use the operators +, -,* are interpreted exactly but all assignments that use other operators are conservatively interpreted as non-deterministic assignments. We present a generic algorithm for constant propagation via a symbolic weakest precondition computation and show how this generic algorithm can be instantiated for polynomial constant propagation by exploiting techniques from computable ring theory.</div></front></TEI><istex><corpusName>springer</corpusName><author><json:item><name>Markus Müller-Olm</name><affiliations><json:string>University of Dortmund, FB 4, LS5, 44221, Dortmund, Germany</json:string><json:string>E-mail: mmo@ls5.cs.uni-dortmund.de</json:string></affiliations></json:item><json:item><name>Helmut Seidl</name><affiliations><json:string>Trier University, FB 4-Informatik, 54286, Trier, Germany</json:string><json:string>E-mail: seidl@uni-trier.de</json:string></affiliations></json:item></author><language><json:string>eng</json:string></language><originalGenre><json:string>OriginalPaper</json:string></originalGenre><abstract>Abstract: Constant propagation aims at identifying expressions that always yield a unique constant value at run-time. It is well-known that constant propagation is undecidable for programs working on integers even if guards are ignored as in non-deterministic flow graphs. We show that polynomial constants are decidable in non-deterministic flow graphs. In polynomial constant propagation, assignment statements that use the operators +, -,* are interpreted exactly but all assignments that use other operators are conservatively interpreted as non-deterministic assignments. We present a generic algorithm for constant propagation via a symbolic weakest precondition computation and show how this generic algorithm can be instantiated for polynomial constant propagation by exploiting techniques from computable ring theory.</abstract><qualityIndicators><score>6.344</score><pdfVersion>1.3</pdfVersion><pdfPageSize>430 x 650 pts</pdfPageSize><refBibsNative>false</refBibsNative><keywordCount>0</keywordCount><abstractCharCount>826</abstractCharCount><pdfWordCount>7584</pdfWordCount><pdfCharCount>35501</pdfCharCount><pdfPageCount>16</pdfPageCount><abstractWordCount>112</abstractWordCount></qualityIndicators><title>Polynomial Constants Are Decidable</title><chapterId><json:string>4</json:string><json:string>Chap4</json:string></chapterId><refBibs><json:item><author><json:item><name>A,V Aho</name></json:item><json:item><name>R Sethi</name></json:item><json:item><name>J,D Ullman</name></json:item></author><host><author></author><title>Compilers: Principles, Techniques, and Tools</title><publicationDate>1986</publicationDate></host><publicationDate>1986</publicationDate></json:item><json:item><author><json:item><name>K,R Apt</name></json:item><json:item><name>G,D Plotkin</name></json:item></author><host><volume>33</volume><pages><last>767</last><first>724</first></pages><issue>4</issue><author></author><title>Journal of the ACM</title><publicationDate>1986</publicationDate></host><title>Countable nondeterminism and random assignment</title><publicationDate>1986</publicationDate></json:item><json:item><author><json:item><name>P Cousot</name></json:item><json:item><name>R Cousot</name></json:item></author><host><author></author><title>Proceedings 4th 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>P Cousot</name></json:item><json:item><name>R Cousot</name></json:item></author><host><volume>4</volume><pages><last>547</last><first>511</first></pages><issue>2</issue><author></author><title>J. Logic Computat</title><publicationDate>1992</publicationDate></host><title>Abstract interpretation frameworks</title><publicationDate>1992</publicationDate></json:item><json:item><host><author><json:item><name>J,H Davenport</name></json:item><json:item><name>Y Siret</name></json:item><json:item><name>E Tournier</name></json:item></author><title>Computer Algebra: Systems and Algorithms for Algebraic Computation</title><publicationDate>1988</publicationDate></host></json:item><json:item><host><author><json:item><name>E,W Dijkstra</name></json:item></author><title>A Discipline of Programming</title><publicationDate>1976</publicationDate></host></json:item><json:item><host><author><json:item><name>C Fischer</name></json:item><json:item><name>R Leblanc</name></json:item></author><title>Crafting a Compiler</title><publicationDate>1988</publicationDate></host></json:item><json:item><author><json:item><name>K,O Geddes</name></json:item><json:item><name>S,R Czapor</name></json:item><json:item><name>G Labahn</name></json:item></author><host><author></author><title>Algorithms for Computer Algebra. Kluwer</title><publicationDate>1992</publicationDate></host><publicationDate>1992</publicationDate></json:item><json:item><host><author><json:item><name>M,S Hecht</name></json:item></author><title>Flow analysis of computer programs</title><publicationDate>1977</publicationDate></host></json:item><json:item><author><json:item><name>M Karr</name></json:item></author><host><volume>6</volume><pages><last>151</last><first>133</first></pages><author></author><title>Acta Informatica</title><publicationDate>1976</publicationDate></host><title>Affine relationships among variables of a program</title><publicationDate>1976</publicationDate></json:item><json:item><author></author><host><volume>53</volume><pages><last>136</last><first>131</first></pages><issue>3</issue><author></author><title>Information Processing Letters</title><publicationDate>1995</publicationDate></host><title>Mathematics of Program Construction Group. Fixed-point calculus</title><publicationDate>1995</publicationDate></json:item><json:item><host><author><json:item><name>Y,V Matiyasevich</name></json:item></author><title>Hilbert's Tenth Problem</title><publicationDate>1993</publicationDate></host></json:item><json:item><author><json:item><name>A Melton</name></json:item><json:item><name>D,A Schmidt</name></json:item><json:item><name>G,E Strecker</name></json:item></author><host><pages><last>312</last><first>299</first></pages><author></author><title>Category Theory and Computer Programming</title></host><title>Galois connections and computer science applications</title></json:item><json:item><host><author><json:item><name>B Mishra</name></json:item></author><title>Algorithmic Algebra</title><publicationDate>1993</publicationDate></host></json:item><json:item><host><author><json:item><name>S,S Muchnick</name></json:item></author><title>Advanced compiler design and implementation</title><publicationDate>1997</publicationDate></host></json:item><json:item><author><json:item><name>M Müller-Olm</name></json:item><json:item><name>O Rüthing</name></json:item></author><host><volume>2028</volume><pages><last>205</last><first>190</first></pages><author></author><title>LNCS</title><publicationDate>2001</publicationDate></host><title>The complexity of constant propagation</title><publicationDate>2001</publicationDate></json:item><json:item><author><json:item><name>J,R Reif</name></json:item><json:item><name>H,R Lewis</name></json:item></author><host><pages><last>118</last><first>104</first></pages><author></author><title>Conf. Rec. 4th ACM Symposium on Principles of Programming Languages POPL'77</title><publicationDate>1977-01</publicationDate></host><title>Symbolic evaluation and the global value graph</title><publicationDate>1977-01</publicationDate></json:item><json:item><author><json:item><name>M Sagiv</name></json:item><json:item><name>T Reps</name></json:item><json:item><name>S Horwitz</name></json:item></author><host><volume>167</volume><pages><last>170</last><first>131</first></pages><issue>12</issue><author></author><title>Theoretical Computer Science</title><publicationDate>1996</publicationDate></host><title>Precise interprocedural dataflow analysis with applications to constant propagation</title><publicationDate>1996</publicationDate></json:item><json:item><author><json:item><name>B Steffen</name></json:item><json:item><name>J Knoop</name></json:item></author><host><volume>80</volume><pages><last>318</last><first>303</first></pages><issue>2</issue><author></author><title>Theoretical Computer Science</title><publicationDate>1991</publicationDate></host><title>Finite constants: Characterizations of a new decidable set of constants</title><publicationDate>1991</publicationDate></json:item><json:item><host><author><json:item><name>F Winkler</name></json:item></author><title>Polynomial Algorithms</title><publicationDate>1996</publicationDate></host></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>2002</copyrightDate></serie><host><editor><json:item><name>Manuel V. Hermenegildo</name><affiliations><json:string>Department of Computer Science Facultad de Informática, Technical University of Madrid, Campus de Montegancedo, 28660, Boadilla del Monte, Madrid, Spain</json:string><json:string>E-mail: herme@fi.upm.es</json:string></affiliations></json:item><json:item><name>Germán Puebla</name><affiliations><json:string>Department of Computer Science Facultad de Informática, Technical University of Madrid, Campus de Montegancedo, 28660, Boadilla del Monte, Madrid, Spain</json:string><json:string>E-mail: german@fi.upm.es</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>Software Engineering</value></json:item><json:item><value>Mathematical Logic and Formal Languages</value></json:item><json:item><value>Programming Techniques</value></json:item></subject><isbn><json:string>978-3-540-44235-6</json:string></isbn><language><json:string>unknown</json:string></language><title>Static Analysis</title><bookId><json:string>3-540-45789-5</json:string></bookId><volume>2477</volume><pages><last>19</last><first>4</first></pages><issn><json:string>0302-9743</json:string></issn><genre><json:string>book-series</json:string></genre><eisbn><json:string>978-3-540-45789-3</json:string></eisbn><copyrightDate>2002</copyrightDate><doi><json:string>10.1007/3-540-45789-5</json:string></doi></host><publicationDate>2002</publicationDate><copyrightDate>2002</copyrightDate><doi><json:string>10.1007/3-540-45789-5_4</json:string></doi><id>B23AF436A3751F520EE989F38508C61937601004</id><score>0.98111844</score><fulltext><json:item><extension>pdf</extension><original>true</original><mimetype>application/pdf</mimetype><uri>https://api.istex.fr/document/B23AF436A3751F520EE989F38508C61937601004/fulltext/pdf</uri></json:item><json:item><extension>zip</extension><original>false</original><mimetype>application/zip</mimetype><uri>https://api.istex.fr/document/B23AF436A3751F520EE989F38508C61937601004/fulltext/zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/document/B23AF436A3751F520EE989F38508C61937601004/fulltext/tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Polynomial Constants Are Decidable</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, 2002</p></availability><date>2002</date></publicationStmt><sourceDesc><biblStruct type="inbook"><analytic><title level="a" type="main" xml:lang="en">Polynomial Constants Are Decidable</title><author xml:id="author-1"><persName><forename type="first">Markus</forename><surname>Müller-Olm</surname></persName><email>mmo@ls5.cs.uni-dortmund.de</email><affiliation>University of Dortmund, FB 4, LS5, 44221, Dortmund, Germany</affiliation></author><author xml:id="author-2"><persName><forename type="first">Helmut</forename><surname>Seidl</surname></persName><email>seidl@uni-trier.de</email><affiliation>Trier University, FB 4-Informatik, 54286, Trier, Germany</affiliation></author></analytic><monogr><title level="m">Static Analysis</title><title level="m" type="sub">9th International Symposium, SAS 2002 Madrid, Spain, September 17–20, 2002 Proceedings</title><idno type="pISBN">978-3-540-44235-6</idno><idno type="eISBN">978-3-540-45789-3</idno><idno type="pISSN">0302-9743</idno><idno type="DOI">10.1007/3-540-45789-5</idno><idno type="book-ID">3-540-45789-5</idno><idno type="book-title-ID">72502</idno><idno type="book-sequence-number">2477</idno><idno type="book-volume-number">2477</idno><idno type="book-chapter-count">35</idno><editor><persName><forename type="first">Manuel</forename><forename type="first">V.</forename><surname>Hermenegildo</surname></persName><email>herme@fi.upm.es</email><affiliation>Department of Computer Science Facultad de Informática, Technical University of Madrid, Campus de Montegancedo, 28660, Boadilla del Monte, Madrid, Spain</affiliation></editor><editor><persName><forename type="first">Germán</forename><surname>Puebla</surname></persName><email>german@fi.upm.es</email><affiliation>Department of Computer Science Facultad de Informática, Technical University of Madrid, Campus de Montegancedo, 28660, Boadilla del Monte, Madrid, Spain</affiliation></editor><imprint><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><date type="published" when="2002-09-05"></date><biblScope unit="volume">2477</biblScope><biblScope unit="page" from="4">4</biblScope><biblScope unit="page" to="19">19</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>2002</date></biblScope><idno type="pISSN">0302-9743</idno><idno type="series-Id">558</idno></series><idno type="istex">B23AF436A3751F520EE989F38508C61937601004</idno><idno type="DOI">10.1007/3-540-45789-5_4</idno><idno type="ChapterID">4</idno><idno type="ChapterID">Chap4</idno></biblStruct></sourceDesc></fileDesc><profileDesc><creation><date>2002</date></creation><langUsage><language ident="en">en</language></langUsage><abstract xml:lang="en"><p>Abstract: Constant propagation aims at identifying expressions that always yield a unique constant value at run-time. It is well-known that constant propagation is undecidable for programs working on integers even if guards are ignored as in non-deterministic flow graphs. We show that polynomial constants are decidable in non-deterministic flow graphs. In polynomial constant propagation, assignment statements that use the operators +, -,* are interpreted exactly but all assignments that use other operators are conservatively interpreted as non-deterministic assignments. We present a generic algorithm for constant propagation via a symbolic weakest precondition computation and show how this generic algorithm can be instantiated for polynomial constant propagation by exploiting techniques from computable ring theory.</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>I14029</label><label>I16048</label><label>I14010</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>Software Engineering</term></item><item><term>Mathematical Logic and Formal Languages</term></item><item><term>Programming Techniques</term></item></list></keywords></textClass></profileDesc><revisionDesc><change when="2002-09-05">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/B23AF436A3751F520EE989F38508C61937601004/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><City>NY</City><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-45789-5</BookID><BookTitle>Static Analysis</BookTitle><BookSubTitle>9th International Symposium, SAS 2002 Madrid, Spain, September 17–20, 2002 Proceedings</BookSubTitle><BookVolumeNumber>2477</BookVolumeNumber><BookSequenceNumber>2477</BookSequenceNumber><BookDOI>10.1007/3-540-45789-5</BookDOI><BookTitleID>72502</BookTitleID><BookPrintISBN>978-3-540-44235-6</BookPrintISBN><BookElectronicISBN>978-3-540-45789-3</BookElectronicISBN><BookChapterCount>35</BookChapterCount><BookHistory><OnlineDate><Year>2002</Year><Month>9</Month><Day>5</Day></OnlineDate></BookHistory><BookCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2002</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="I14029" Priority="3" Type="Secondary">Software Engineering</BookSubject><BookSubject Code="I16048" Priority="4" Type="Secondary">Mathematical Logic and Formal Languages</BookSubject><BookSubject Code="I14010" Priority="5" Type="Secondary">Programming Techniques</BookSubject><SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection></BookSubjectGroup><BookContext><SeriesID>558</SeriesID></BookContext></BookInfo><BookHeader><EditorGroup><Editor AffiliationIDS="Aff4"><EditorName DisplayOrder="Western"><GivenName>Manuel</GivenName><GivenName>V.</GivenName><FamilyName>Hermenegildo</FamilyName></EditorName><Contact><Email>herme@fi.upm.es</Email></Contact></Editor><Editor AffiliationIDS="Aff4"><EditorName DisplayOrder="Western"><GivenName>Germán</GivenName><FamilyName>Puebla</FamilyName></EditorName><Contact><Email>german@fi.upm.es</Email></Contact></Editor><Affiliation ID="Aff4"><OrgDivision>Department of Computer Science Facultad de Informática</OrgDivision><OrgName>Technical University of Madrid</OrgName><OrgAddress><Street>Campus de Montegancedo</Street><Postcode>28660</Postcode><City>Boadilla del Monte, Madrid</City><Country>Spain</Country></OrgAddress></Affiliation></EditorGroup></BookHeader><Chapter ID="Chap4" Language="En"><ChapterInfo ChapterType="OriginalPaper" ContainsESM="No" Language="En" NumberingStyle="Unnumbered" TocLevels="0"><ChapterID>4</ChapterID><ChapterDOI>10.1007/3-540-45789-5_4</ChapterDOI><ChapterSequenceNumber>4</ChapterSequenceNumber><ChapterTitle Language="En">Polynomial Constants Are Decidable</ChapterTitle><ChapterFirstPage>4</ChapterFirstPage><ChapterLastPage>19</ChapterLastPage><ChapterCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2002</CopyrightYear></ChapterCopyright><ChapterHistory><RegistrationDate><Year>2002</Year><Month>9</Month><Day>4</Day></RegistrationDate><OnlineDate><Year>2002</Year><Month>9</Month><Day>5</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><BookID>3-540-45789-5</BookID><BookTitle>Static Analysis</BookTitle></ChapterContext></ChapterInfo><ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff5"><AuthorName DisplayOrder="Western"><GivenName>Markus</GivenName><FamilyName>Müller-Olm</FamilyName></AuthorName><Contact><Email>mmo@ls5.cs.uni-dortmund.de</Email></Contact></Author><Author AffiliationIDS="Aff6"><AuthorName DisplayOrder="Western"><GivenName>Helmut</GivenName><FamilyName>Seidl</FamilyName></AuthorName><Contact><Email>seidl@uni-trier.de</Email></Contact></Author><Affiliation ID="Aff5"><OrgName>University of Dortmund</OrgName><OrgAddress><Postbox>FB 4, LS5</Postbox><Postcode>44221</Postcode><City>Dortmund</City><Country>Germany</Country></OrgAddress></Affiliation><Affiliation ID="Aff6"><OrgName>Trier University</OrgName><OrgAddress><Postbox>FB 4-Informatik</Postbox><Postcode>54286</Postcode><City>Trier</City><Country>Germany</Country></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading><Para>Constant propagation aims at identifying expressions that always yield a unique constant value at run-time. It is well-known that constant propagation is undecidable for programs working on integers even if guards are ignored as in non-deterministic flow graphs. We show that <Emphasis Type="Italic">polynomial constants</Emphasis> are decidable in non-deterministic flow graphs. In polynomial constant propagation, assignment statements that use the operators +, -,* are interpreted exactly but all assignments that use other operators are conservatively interpreted as non-deterministic assignments.</Para><Para>We present a generic algorithm for constant propagation via a symbolic weakest precondition computation and show how this generic algorithm can be instantiated for polynomial constant propagation by exploiting techniques from computable ring theory.</Para></Abstract><ArticleNote Type="Misc"><SimplePara>The work was supported by the RTD project IST-1999-20527 ”DAEDALUS” of the European FP5 programme.</SimplePara></ArticleNote></ChapterHeader><NoBody></NoBody></Chapter></Book></Series></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>Polynomial Constants Are Decidable</title></titleInfo><titleInfo type="alternative" contentType="CDATA" lang="en"><title>Polynomial Constants Are Decidable</title></titleInfo><name type="personal"><namePart type="given">Markus</namePart><namePart type="family">Müller-Olm</namePart><affiliation>University of Dortmund, FB 4, LS5, 44221, Dortmund, Germany</affiliation><affiliation>E-mail: mmo@ls5.cs.uni-dortmund.de</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Helmut</namePart><namePart type="family">Seidl</namePart><affiliation>Trier University, FB 4-Informatik, 54286, Trier, Germany</affiliation><affiliation>E-mail: seidl@uni-trier.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">2002-09-05</dateIssued><copyrightDate encoding="w3cdtf">2002</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: Constant propagation aims at identifying expressions that always yield a unique constant value at run-time. It is well-known that constant propagation is undecidable for programs working on integers even if guards are ignored as in non-deterministic flow graphs. We show that polynomial constants are decidable in non-deterministic flow graphs. In polynomial constant propagation, assignment statements that use the operators +, -,* are interpreted exactly but all assignments that use other operators are conservatively interpreted as non-deterministic assignments. We present a generic algorithm for constant propagation via a symbolic weakest precondition computation and show how this generic algorithm can be instantiated for polynomial constant propagation by exploiting techniques from computable ring theory.</abstract><relatedItem type="host"><titleInfo><title>Static Analysis</title><subTitle>9th International Symposium, SAS 2002 Madrid, Spain, September 17–20, 2002 Proceedings</subTitle></titleInfo><name type="personal"><namePart type="given">Manuel</namePart><namePart type="given">V.</namePart><namePart type="family">Hermenegildo</namePart><affiliation>Department of Computer Science Facultad de Informática, Technical University of Madrid, Campus de Montegancedo, 28660, Boadilla del Monte, Madrid, Spain</affiliation><affiliation>E-mail: herme@fi.upm.es</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Germán</namePart><namePart type="family">Puebla</namePart><affiliation>Department of Computer Science Facultad de Informática, Technical University of Madrid, Campus de Montegancedo, 28660, Boadilla del Monte, Madrid, Spain</affiliation><affiliation>E-mail: german@fi.upm.es</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><genre type="book-series" displayLabel="Proceedings"></genre><originInfo><copyrightDate encoding="w3cdtf">2002</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="I14029">Software Engineering</topic><topic authority="SpringerSubjectCodes" authorityURI="I16048">Mathematical Logic and Formal Languages</topic><topic authority="SpringerSubjectCodes" authorityURI="I14010">Programming Techniques</topic></subject><identifier type="DOI">10.1007/3-540-45789-5</identifier><identifier type="ISBN">978-3-540-44235-6</identifier><identifier type="eISBN">978-3-540-45789-3</identifier><identifier type="ISSN">0302-9743</identifier><identifier type="BookTitleID">72502</identifier><identifier type="BookID">3-540-45789-5</identifier><identifier type="BookChapterCount">35</identifier><identifier type="BookVolumeNumber">2477</identifier><identifier type="BookSequenceNumber">2477</identifier><part><date>2002</date><detail type="volume"><number>2477</number><caption>vol.</caption></detail><extent unit="pages"><start>4</start><end>19</end></extent></part><recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 2002</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">2002</copyrightDate><issuance>serial</issuance></originInfo><identifier type="ISSN">0302-9743</identifier><identifier type="SeriesID">558</identifier><recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 2002</recordOrigin></recordInfo></relatedItem><identifier type="istex">B23AF436A3751F520EE989F38508C61937601004</identifier><identifier type="DOI">10.1007/3-540-45789-5_4</identifier><identifier type="ChapterID">4</identifier><identifier type="ChapterID">Chap4</identifier><accessCondition type="use and reproduction" contentType="copyright">Springer-Verlag Berlin Heidelberg, 2002</accessCondition><recordInfo><recordContentSource>SPRINGER</recordContentSource><recordOrigin>Springer-Verlag Berlin Heidelberg, 2002</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 001264 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 001264 | 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:B23AF436A3751F520EE989F38508C61937601004
|texte= Polynomial Constants Are Decidable
}}
| This area was generated with Dilib version V0.6.31. |  |