Polynomial constants are decidable
Identifieur interne : 001F46 ( Main/Merge ); précédent : 001F45; suivant : 001F47Polynomial constants are decidable
Auteurs : Markus Müller-Olm [Allemagne] ; Helmut Seidl [Allemagne]Source :
- Lecture notes in computer science [ 0302-9743 ] ; 2002.
Descripteurs français
- Pascal (Inist)
English descriptors
- KwdEn :
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.
Links toward previous steps (curation, corpus...)
- to stream PascalFrancis, to step Corpus: 000C40
- to stream PascalFrancis, to step Curation: 000275
- to stream PascalFrancis, to step Checkpoint: 000A81
Links to Exploration step
Pascal:03-0334456Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">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 wicri:level="3"><inist:fA14 i1="01"><s1>University of Dortmund, FB 4, LS5</s1><s2>44221 Dortmund</s2><s3>DEU</s3><sZ>1 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><author><name sortKey="Seidl, Helmut" sort="Seidl, Helmut" uniqKey="Seidl H" first="Helmut" last="Seidl">Helmut Seidl</name><affiliation wicri:level="1"><inist:fA14 i1="02"><s1>Trier University, FB 4-Informatik</s1><s2>54286 Trier</s2><s3>DEU</s3><sZ>2 aut.</sZ></inist:fA14><country>Allemagne</country><wicri:noRegion>54286 Trier</wicri:noRegion><wicri:noRegion>FB 4-Informatik</wicri:noRegion><wicri:noRegion>54286 Trier</wicri:noRegion></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">INIST</idno><idno type="inist">03-0334456</idno><date when="2002">2002</date><idno type="stanalyst">PASCAL 03-0334456 INIST</idno><idno type="RBID">Pascal:03-0334456</idno><idno type="wicri:Area/PascalFrancis/Corpus">000C40</idno><idno type="wicri:Area/PascalFrancis/Curation">000275</idno><idno type="wicri:Area/PascalFrancis/Checkpoint">000A81</idno><idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000A81</idno><idno type="wicri:doubleKey">0302-9743:2002:Muller Olm M:polynomial:constants:are</idno><idno type="wicri:Area/Main/Merge">001F46</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">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 wicri:level="3"><inist:fA14 i1="01"><s1>University of Dortmund, FB 4, LS5</s1><s2>44221 Dortmund</s2><s3>DEU</s3><sZ>1 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><author><name sortKey="Seidl, Helmut" sort="Seidl, Helmut" uniqKey="Seidl H" first="Helmut" last="Seidl">Helmut Seidl</name><affiliation wicri:level="1"><inist:fA14 i1="02"><s1>Trier University, FB 4-Informatik</s1><s2>54286 Trier</s2><s3>DEU</s3><sZ>2 aut.</sZ></inist:fA14><country>Allemagne</country><wicri:noRegion>54286 Trier</wicri:noRegion><wicri:noRegion>FB 4-Informatik</wicri:noRegion><wicri:noRegion>54286 Trier</wicri:noRegion></affiliation></author></analytic><series><title level="j" type="main">Lecture notes in computer science</title><idno type="ISSN">0302-9743</idno><imprint><date when="2002">2002</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>Data flow</term><term>Decidability</term><term>Flow graphs</term><term>Fluence graph</term><term>Graph flow</term><term>Non determinism</term><term>Non deterministic system</term></keywords><keywords scheme="Pascal" xml:lang="fr"><term>Flot graphe</term><term>Décidabilité</term><term>Non déterminisme</term><term>Système non déterministe</term><term>Flot donnée</term><term>Graphe flux</term><term>Graphe fluence</term><term>Constante polynomiale</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">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><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"><region name="Rhénanie-du-Nord-Westphalie"><name sortKey="Muller Olm, Markus" sort="Muller Olm, Markus" uniqKey="Muller Olm M" first="Markus" last="Müller-Olm">Markus Müller-Olm</name></region><name sortKey="Seidl, Helmut" sort="Seidl, Helmut" uniqKey="Seidl H" first="Helmut" last="Seidl">Helmut Seidl</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Main/Merge
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001F46 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 001F46 | 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= Merge
|type= RBID
|clé= Pascal:03-0334456
|texte= Polynomial constants are decidable
}}
| This area was generated with Dilib version V0.6.31. |  |