Propagating differences: An efficient new fixpoint algorithm for distributive constraint systems
Identifieur interne : 002282 ( Main/Exploration ); précédent : 002281; suivant : 002283Propagating differences: An efficient new fixpoint algorithm for distributive constraint systems
Auteurs : Christian Fecht [Allemagne] ; Helmut Seidl [Allemagne]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 1998.
Descripteurs français
- Pascal (Inist)
- Wicri :
- topic : Langage de programmation.
English descriptors
Abstract
Abstract: Integrating semi-naive fixpoint iteration from deductive data bases [3,2,4] as well as continuations into worklist-based solvers, we derive a new application independent local fixpoint algorithm for distributive constraint systems. Seemingly different efficient algorithms for abstract interpretation like those for linear constant propagation for imperative languages [17] as well as for control-flow analysis for functional languages [13] turn out to be instances of our scheme. Besides this systematizing contribution we also derive a new efficient algorithm for abstract OLDT-resolution as considered in [15,16, 25] for Prolog.
Url:
DOI: 10.1007/BFb0053565
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001130
- to stream Istex, to step Curation: 001019
- to stream Istex, to step Checkpoint: 000E53
- to stream Main, to step Merge: 002671
- to stream PascalFrancis, to step Corpus: 001146
- to stream PascalFrancis, to step Curation: 001679
- to stream PascalFrancis, to step Checkpoint: 000E70
- to stream Main, to step Merge: 002741
- to stream Main, to step Curation: 002282
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Propagating differences: An efficient new fixpoint algorithm for distributive constraint systems</title>
<author><name sortKey="Fecht, Christian" sort="Fecht, Christian" uniqKey="Fecht C" first="Christian" last="Fecht">Christian Fecht</name>
</author>
<author><name sortKey="Seidl, Helmut" sort="Seidl, Helmut" uniqKey="Seidl H" first="Helmut" last="Seidl">Helmut Seidl</name>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:539423816445C6AC42AF8B410E6BF0081C091C5C</idno>
<date when="1998" year="1998">1998</date>
<idno type="doi">10.1007/BFb0053565</idno>
<idno type="url">https://api.istex.fr/document/539423816445C6AC42AF8B410E6BF0081C091C5C/fulltext/pdf</idno>
<idno type="wicri:Area/Istex/Corpus">001130</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001130</idno>
<idno type="wicri:Area/Istex/Curation">001019</idno>
<idno type="wicri:Area/Istex/Checkpoint">000E53</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000E53</idno>
<idno type="wicri:doubleKey">0302-9743:1998:Fecht C:propagating:differences:an</idno>
<idno type="wicri:Area/Main/Merge">002671</idno>
<idno type="wicri:source">INIST</idno>
<idno type="RBID">Pascal:98-0234333</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">001146</idno>
<idno type="wicri:Area/PascalFrancis/Curation">001679</idno>
<idno type="wicri:Area/PascalFrancis/Checkpoint">000E70</idno>
<idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000E70</idno>
<idno type="wicri:doubleKey">0302-9743:1998:Fecht C:propagating:differences:an</idno>
<idno type="wicri:Area/Main/Merge">002741</idno>
<idno type="wicri:Area/Main/Curation">002282</idno>
<idno type="wicri:Area/Main/Exploration">002282</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Propagating differences: An efficient new fixpoint algorithm for distributive constraint systems</title>
<author><name sortKey="Fecht, Christian" sort="Fecht, Christian" uniqKey="Fecht C" first="Christian" last="Fecht">Christian Fecht</name>
<affiliation wicri:level="3"><country xml:lang="fr">Allemagne</country>
<wicri:regionArea>Universität des Saarlandes, Postfach 151150, D-66041, Saarbrücken</wicri:regionArea>
<placeName><region type="land" nuts="2">Sarre (Land)</region>
<settlement type="city">Sarrebruck</settlement>
</placeName>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country>
</affiliation>
</author>
<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>Fachbereich 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>
</analytic>
<monogr></monogr>
<series><title level="s">Lecture Notes in Computer Science</title>
<imprint><date>1998</date>
</imprint>
<idno type="ISSN">0302-9743</idno>
<idno type="eISSN">1611-3349</idno>
<idno type="ISSN">0302-9743</idno>
</series>
<idno type="istex">539423816445C6AC42AF8B410E6BF0081C091C5C</idno>
<idno type="DOI">10.1007/BFb0053565</idno>
<idno type="ChapterID">7</idno>
<idno type="ChapterID">Chap7</idno>
</biblStruct>
</sourceDesc>
<seriesStmt><idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Functional programming</term>
<term>Logical programming</term>
<term>Optimal algorithm</term>
<term>Programming language</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Algorithme optimal</term>
<term>Langage programmation</term>
<term>Programmation fonctionnelle</term>
<term>Programmation logique</term>
<term>Programmation sous contrainte</term>
</keywords>
<keywords scheme="Wicri" type="topic" xml:lang="fr"><term>Langage de programmation</term>
</keywords>
</textClass>
<langUsage><language ident="en">en</language>
</langUsage>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Abstract: Integrating semi-naive fixpoint iteration from deductive data bases [3,2,4] as well as continuations into worklist-based solvers, we derive a new application independent local fixpoint algorithm for distributive constraint systems. Seemingly different efficient algorithms for abstract interpretation like those for linear constant propagation for imperative languages [17] as well as for control-flow analysis for functional languages [13] turn out to be instances of our scheme. Besides this systematizing contribution we also derive a new efficient algorithm for abstract OLDT-resolution as considered in [15,16, 25] for Prolog.</div>
</front>
</TEI>
<affiliations><list><country><li>Allemagne</li>
</country>
<region><li>Sarre (Land)</li>
</region>
<settlement><li>Sarrebruck</li>
</settlement>
</list>
<tree><country name="Allemagne"><region name="Sarre (Land)"><name sortKey="Fecht, Christian" sort="Fecht, Christian" uniqKey="Fecht C" first="Christian" last="Fecht">Christian Fecht</name>
</region>
<name sortKey="Fecht, Christian" sort="Fecht, Christian" uniqKey="Fecht C" first="Christian" last="Fecht">Christian Fecht</name>
<name sortKey="Seidl, Helmut" sort="Seidl, Helmut" uniqKey="Seidl H" first="Helmut" last="Seidl">Helmut Seidl</name>
<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/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002282 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 002282 | 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= Exploration |type= RBID |clé= ISTEX:539423816445C6AC42AF8B410E6BF0081C091C5C |texte= Propagating differences: An efficient new fixpoint algorithm for distributive constraint systems }}
This area was generated with Dilib version V0.6.31. |