Propagating differences: An efficient new fixpoint algorithm for distributive constraint systems
Identifieur interne : 001130 ( Istex/Corpus ); précédent : 001129; suivant : 001131Propagating differences: An efficient new fixpoint algorithm for distributive constraint systems
Auteurs : Christian Fecht ; Helmut SeidlSource :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 1998.
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
Links to Exploration step
ISTEX:539423816445C6AC42AF8B410E6BF0081C091C5CLe 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><affiliation><mods:affiliation>Universität des Saarlandes, Postfach 151150, D-66041, Saarbrücken, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: fecht@cs.uni-sb.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>Fachbereich IV - Informatik, Universität Trier, D-54286, Trier, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: seidl@psi.uni-trier.de</mods:affiliation></affiliation></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></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><mods:affiliation>Universität des Saarlandes, Postfach 151150, D-66041, Saarbrücken, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: fecht@cs.uni-sb.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>Fachbereich IV - Informatik, Universität Trier, D-54286, Trier, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: seidl@psi.uni-trier.de</mods:affiliation></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></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><istex><corpusName>springer</corpusName><author><json:item><name>Christian Fecht</name><affiliations><json:string>Universität des Saarlandes, Postfach 151150, D-66041, Saarbrücken, Germany</json:string><json:string>E-mail: fecht@cs.uni-sb.de</json:string></affiliations></json:item><json:item><name>Helmut Seidl</name><affiliations><json:string>Fachbereich IV - Informatik, Universität Trier, D-54286, Trier, Germany</json:string><json:string>E-mail: seidl@psi.uni-trier.de</json:string></affiliations></json:item></author><language><json:string>eng</json:string></language><originalGenre><json:string>ReviewPaper</json:string></originalGenre><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.</abstract><qualityIndicators><score>6.032</score><pdfVersion>1.3</pdfVersion><pdfPageSize>440.928 x 666 pts</pdfPageSize><refBibsNative>false</refBibsNative><keywordCount>0</keywordCount><abstractCharCount>641</abstractCharCount><pdfWordCount>7795</pdfWordCount><pdfCharCount>36356</pdfCharCount><pdfPageCount>15</pdfPageCount><abstractWordCount>86</abstractWordCount></qualityIndicators><title>Propagating differences: An efficient new fixpoint algorithm for distributive constraint systems</title><chapterId><json:string>7</json:string><json:string>Chap7</json:string></chapterId><refBibs><json:item><author><json:item><name>M Alt</name></json:item><json:item><name>F Martin</name></json:item></author><host><pages><last>50</last><first>33</first></pages><author></author><title>2nd 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>I Balbin</name></json:item><json:item><name>K Ramamohanarao</name></json:item></author><host><volume>4</volume><pages><last>262</last><first>259</first></pages><issue>3</issue><author></author><title>JLP</title><publicationDate>1987</publicationDate></host><title>A Generalization of the Differential Approach to Recursive Query Evaluation</title><publicationDate>1987</publicationDate></json:item><json:item><author><json:item><name>F Bancilhon</name></json:item><json:item><name>R Ramakrishnan</name></json:item></author><host><pages><last>52</last><first>16</first></pages><author></author><title>ACM SIGMOD Conference</title><publicationDate>1986</publicationDate></host><title>An Amateur's Introduction to Recursive Query Processing Strategies</title><publicationDate>1986</publicationDate></json:item><json:item><author><json:item><name>F Bancilhon</name></json:item><json:item><name>R Ramakrishnan</name></json:item></author><host><pages><last>517</last><first>439</first></pages><author></author><title>Foundations of Deductive Databases and Logic Programming</title><publicationDate>1988</publicationDate></host><title>Performance Evaluation of Data Intensive Logic Programs</title><publicationDate>1988</publicationDate></json:item><json:item><host><author><json:item><name>B </name></json:item><json:item><name>Le Charlier</name></json:item><json:item><name>P Van Hentenryck</name></json:item></author><title>A Universal Top-Down Fixpoint Algorithm</title><publicationDate>1992</publicationDate></host></json:item><json:item><author><json:item><name>B </name></json:item><json:item><name>Le Charlier</name></json:item><json:item><name>P Van Hentenryck</name></json:item></author><host><volume>16</volume><pages><last>101</last><first>35</first></pages><issue>1</issue><author></author><title>A CM TOPLAS</title><publicationDate>1994</publicationDate></host><title>Experimental Evaluation of a Generic Abstract Interpretation Algorithm for Prolog</title><publicationDate>1994</publicationDate></json:item><json:item><author><json:item><name>M Codish</name></json:item><json:item><name>D Dams</name></json:item><json:item><name>E Yardeni</name></json:item></author><host><pages><last>93</last><first>79</first></pages><author></author><title>ICLP</title><publicationDate>1991</publicationDate></host><title>Derivation of an Abstract Unification Algorithm for groundnes and Aliasing Analysis</title><publicationDate>1991</publicationDate></json:item><json:item><author><json:item><name>P Cousot</name></json:item><json:item><name>R 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>V Englebert</name></json:item><json:item><name>B,Le Charlier</name></json:item><json:item><name>D Roland</name></json:item><json:item><name>P Van Hentenryck</name></json:item></author><host><volume>23</volume><pages><last>459</last><first>419</first></pages><issue>4</issue><author></author><title>SPE</title><publicationDate>1993</publicationDate></host><title>Generic Abstract Interpretation Algorithms for Prolog: Two Optimization Techniques and their Experimental Evaluation</title><publicationDate>1993</publicationDate></json:item><json:item><author><json:item><name>C Fecht</name></json:item></author><host><volume>983</volume><pages><last>419</last><first>418</first></pages><author></author><title>LNCS</title><publicationDate>1995</publicationDate></host><title>GENA -A Tool for Generating Prolog Analyzers from Specifications</title><publicationDate>1995</publicationDate></json:item><json:item><host><author><json:item><name>C Fecht</name></json:item></author><title>Abstrakte Interpretation logischer Programme: Theorie, Implementierung , Generierung</title><publicationDate>1997</publicationDate></host></json:item><json:item><author><json:item><name>C Fecht</name></json:item><json:item><name>H Seidl</name></json:item></author><host><volume>1145</volume><pages><last>204</last><first>189</first></pages><author></author><title>LNCS</title><publicationDate>1996</publicationDate></host><title>An Even Faster Solver for General Systems of Equations</title><publicationDate>1996</publicationDate></json:item><json:item><author><json:item><name>N Heintze</name></json:item></author><host><pages><last>317</last><first>306</first></pages><author></author><title>ACM Conf. LFP</title><publicationDate>1994</publicationDate></host><title>Set-Based Analysis of ML Programs</title><publicationDate>1994</publicationDate></json:item><json:item><author><json:item><name>N Heintze</name></json:item><json:item><name>D,A Mcallester</name></json:item></author><host><pages><last>351</last><first>342</first></pages><author></author><title>IEEE Symp. LICS</title><publicationDate>1997</publicationDate></host><title>On the Cubic Bottleneck in Subtyping and Flow Analysis</title><publicationDate>1997</publicationDate></json:item><json:item><host><author><json:item><name>P Van Hentenryck</name></json:item><json:item><name>O Degimbe</name></json:item><json:item><name>B,Le Charlier</name></json:item><json:item><name>L Michel</name></json:item></author><title>Abstract Interpretation of Prolog Based on OLDT Resolution</title><publicationDate>1993</publicationDate></host></json:item><json:item><author><json:item><name>P Van Hentenryck</name></json:item><json:item><name>O Degimbe</name></json:item><json:item><name>B,Le Charlier</name></json:item><json:item><name>L Michel</name></json:item></author><host><pages><last>14</last><first>1</first></pages><author></author><title>The Impact of Granularity in Abstract Interpretation of Prolog. 3rd WSA</title><publicationDate>1993</publicationDate></host><publicationDate>1993</publicationDate></json:item><json:item><author><json:item><name>S Horwitz</name></json:item><json:item><name>T,W Reps</name></json:item><json:item><name>M Sagiv</name></json:item></author><host><volume>915</volume><pages><last>665</last><first>651</first></pages><author></author><title>LNCS</title><publicationDate>1995</publicationDate></host><title>Precise Interprocedural Dataflow Analysis with Applications to Constant Propagation</title><publicationDate>1995</publicationDate></json:item><json:item><author><json:item><name>S Horwitz</name></json:item><json:item><name>T,W Reps</name></json:item><json:item><name>M Sagiv</name></json:item></author><host><pages><last>61</last><first>49</first></pages><author></author><title>Precise Interprocedural Dataflow Analysis via Graph Reachability. 22nd POPL</title><publicationDate>1995</publicationDate></host><publicationDate>1995</publicationDate></json:item><json:item><author><json:item><name>D Melski</name></json:item><json:item><name>T,W Reps</name></json:item></author><host><pages><last>89</last><first>74</first></pages><author></author><title>ACM SIGPLAN Symp. PEPM</title><publicationDate>1997</publicationDate></host><title>Interconvertability of Set Constraints and Context-Free Language Reachability</title><publicationDate>1997</publicationDate></json:item><json:item><author><json:item><name>K Muthukumar</name></json:item><json:item><name>M,V Hermenegildo</name></json:item></author><host><volume>13</volume><pages><last>347</last><first>315</first></pages><issue>2&3</issue><author></author><title>JLP</title><publicationDate>1992</publicationDate></host><title>Compile-Time Derivation of Variable Dependency Using Abstract Interpretation</title><publicationDate>1992</publicationDate></json:item><json:item><host><pages><last>345</last><first>332</first></pages><author><json:item><name>H </name></json:item><json:item><name>Riis Nielson</name></json:item><json:item><name>F Nielson</name></json:item></author><title>Infinitary Control Flow Analysis: A Collecting Semantics for Closure Analysis</title><publicationDate>1997</publicationDate></host></json:item><json:item><author><json:item><name>R Paige</name></json:item></author><host><volume>432</volume><pages><last>56</last><first>36</first></pages><author></author><title>LNCS</title><publicationDate>1990</publicationDate></host><title>Symbolic Finite Differencing -Part I</title><publicationDate>1990</publicationDate></json:item><json:item><author><json:item><name>J Palsberg</name></json:item></author><host><volume>17</volume><pages><last>82</last><first>47</first></pages><author></author><title>ACM TOPLAS</title><publicationDate>1995</publicationDate></host><title>Closure Analysis in Constraint Form</title><publicationDate>1995</publicationDate></json:item><json:item><author><json:item><name>J Palsberg</name></json:item><json:item><name>P O 'keefe</name></json:item></author><host><volume>17</volume><pages><last>599</last><first>576</first></pages><author></author><title>ACM TOPLAS</title><publicationDate>1995</publicationDate></host><title>A Type System Equivalent to Flow Analysis</title><publicationDate>1995</publicationDate></json:item><json:item><host><author><json:item><name>H Seidl</name></json:item><json:item><name>C Fecht</name></json:item></author><title>Interprocedural Analysis Based on PDAs Extended Abstract in: Verification, Model Checking and Abstract Interpretation</title><publicationDate>1997</publicationDate></host></json:item><json:item><host><pages><last>413</last><first>400</first></pages><author><json:item><name>H Seidl</name></json:item><json:item><name>M,H Serensen</name></json:item></author><title>Constraints to Stop Higher-Order Deforestation</title><publicationDate>1997</publicationDate></host></json:item><json:item><author><json:item><name>H Sendergaard</name></json:item></author><host><volume>213</volume><pages><last>338</last><first>327</first></pages><author></author><title>LNCS</title><publicationDate>1986</publicationDate></host><title>An Application of Abstract Interpretation of Logic Programs: Occur Check Reduction</title><publicationDate>1986</publicationDate></json:item></refBibs><genre><json:string>conference</json:string></genre><serie><editor><json:item><name>Gerhard Goos</name></json:item><json:item><name>Juris Hartmanis</name></json:item><json:item><name>Jan van Leeuwen</name></json:item></editor><issn><json:string>0302-9743</json:string></issn><language><json:string>unknown</json:string></language><eissn><json:string>1611-3349</json:string></eissn><title>Lecture Notes in Computer Science</title><copyrightDate>1998</copyrightDate></serie><host><editor><json:item><name>Chris Hankin</name></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>Mathematical Logic and Formal Languages</value></json:item><json:item><value>Programming Techniques</value></json:item><json:item><value>Software Engineering</value></json:item></subject><isbn><json:string>978-3-540-64302-9</json:string></isbn><language><json:string>unknown</json:string></language><eissn><json:string>1611-3349</json:string></eissn><title>Programming Languages and Systems</title><bookId><json:string>3540643028</json:string></bookId><volume>1381</volume><pages><last>104</last><first>90</first></pages><issn><json:string>0302-9743</json:string></issn><genre><json:string>book-series</json:string></genre><eisbn><json:string>978-3-540-69722-0</json:string></eisbn><copyrightDate>1998</copyrightDate><doi><json:string>10.1007/BFb0053558</json:string></doi></host><publicationDate>2006</publicationDate><copyrightDate>1998</copyrightDate><doi><json:string>10.1007/BFb0053565</json:string></doi><id>539423816445C6AC42AF8B410E6BF0081C091C5C</id><score>0.47684604</score><fulltext><json:item><extension>pdf</extension><original>true</original><mimetype>application/pdf</mimetype><uri>https://api.istex.fr/document/539423816445C6AC42AF8B410E6BF0081C091C5C/fulltext/pdf</uri></json:item><json:item><extension>zip</extension><original>false</original><mimetype>application/zip</mimetype><uri>https://api.istex.fr/document/539423816445C6AC42AF8B410E6BF0081C091C5C/fulltext/zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/document/539423816445C6AC42AF8B410E6BF0081C091C5C/fulltext/tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Propagating differences: An efficient new fixpoint algorithm for distributive constraint systems</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, 1998</p></availability><date>1998</date></publicationStmt><sourceDesc><biblStruct type="inbook"><analytic><title level="a" type="main" xml:lang="en">Propagating differences: An efficient new fixpoint algorithm for distributive constraint systems</title><author xml:id="author-1"><persName><forename type="first">Christian</forename><surname>Fecht</surname></persName><email>fecht@cs.uni-sb.de</email><affiliation>Universität des Saarlandes, Postfach 151150, D-66041, Saarbrücken, Germany</affiliation></author><author xml:id="author-2"><persName><forename type="first">Helmut</forename><surname>Seidl</surname></persName><email>seidl@psi.uni-trier.de</email><affiliation>Fachbereich IV - Informatik, Universität Trier, D-54286, Trier, Germany</affiliation></author></analytic><monogr><title level="m">Programming Languages and Systems</title><title level="m" type="sub">7th European Symposium on Programming, ESOP'98 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS'98 Lisbon, Portugal, March 28 – April 4, 1998 Proceedings</title><idno type="pISBN">978-3-540-64302-9</idno><idno type="eISBN">978-3-540-69722-0</idno><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="DOI">10.1007/BFb0053558</idno><idno type="book-ID">3540643028</idno><idno type="book-title-ID">55105</idno><idno type="book-volume-number">1381</idno><idno type="book-chapter-count">18</idno><editor><persName><forename type="first">Chris</forename><surname>Hankin</surname></persName></editor><imprint><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><date type="published" when="2006-05-23"></date><biblScope unit="volume">1381</biblScope><biblScope unit="page" from="90">90</biblScope><biblScope unit="page" to="104">104</biblScope></imprint></monogr><series><title level="s">Lecture Notes in Computer Science</title><editor><persName><forename type="first">Gerhard</forename><surname>Goos</surname></persName></editor><editor><persName><forename type="first">Juris</forename><surname>Hartmanis</surname></persName></editor><editor><persName><forename type="first">Jan</forename><surname>van Leeuwen</surname></persName></editor><biblScope><date>1998</date></biblScope><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="series-Id">558</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></fileDesc><profileDesc><creation><date>1998</date></creation><langUsage><language ident="en">en</language></langUsage><abstract xml:lang="en"><p>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.</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>I16048</label><label>I14010</label><label>I14029</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>Mathematical Logic and Formal Languages</term></item><item><term>Programming Techniques</term></item><item><term>Software Engineering</term></item></list></keywords></textClass></profileDesc><revisionDesc><change when="2006-05-23">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/539423816445C6AC42AF8B410E6BF0081C091C5C/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 TocLevels="0"><SeriesID>558</SeriesID><SeriesPrintISSN>0302-9743</SeriesPrintISSN><SeriesElectronicISSN>1611-3349</SeriesElectronicISSN><SeriesTitle Language="En">Lecture Notes in Computer Science</SeriesTitle><SeriesAbbreviatedTitle>Lect Notes Comput Sci</SeriesAbbreviatedTitle></SeriesInfo><SeriesHeader><EditorGroup><Editor><EditorName DisplayOrder="Western"><GivenName>Gerhard</GivenName><FamilyName>Goos</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Juris</GivenName><FamilyName>Hartmanis</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Jan</GivenName><Particle>van</Particle><FamilyName>Leeuwen</FamilyName></EditorName></Editor></EditorGroup></SeriesHeader><Book Language="En"><BookInfo MediaType="eBook" BookProductType="Proceedings" Language="En" NumberingStyle="Unnumbered" TocLevels="0"><BookID>3540643028</BookID><BookTitle>Programming Languages and Systems</BookTitle><BookSubTitle>7th European Symposium on Programming, ESOP'98 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS'98 Lisbon, Portugal, March 28 – April 4, 1998 Proceedings</BookSubTitle><BookVolumeNumber>1381</BookVolumeNumber><BookDOI>10.1007/BFb0053558</BookDOI><BookTitleID>55105</BookTitleID><BookPrintISBN>978-3-540-64302-9</BookPrintISBN><BookElectronicISBN>978-3-540-69722-0</BookElectronicISBN><BookChapterCount>18</BookChapterCount><BookCopyright><CopyrightHolderName>Springer-Verlag</CopyrightHolderName><CopyrightYear>1998</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="I16048" Priority="3" Type="Secondary">Mathematical Logic and Formal Languages</BookSubject><BookSubject Code="I14010" Priority="4" Type="Secondary">Programming Techniques</BookSubject><BookSubject Code="I14029" Priority="5" Type="Secondary">Software Engineering</BookSubject><SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection></BookSubjectGroup></BookInfo><BookHeader><EditorGroup><Editor><EditorName DisplayOrder="Western"><GivenName>Chris</GivenName><FamilyName>Hankin</FamilyName></EditorName></Editor></EditorGroup></BookHeader><Chapter ID="Chap7" Language="En"><ChapterInfo ChapterType="ReviewPaper" ContainsESM="No" NumberingStyle="Unnumbered" TocLevels="0"><ChapterID>7</ChapterID><ChapterDOI>10.1007/BFb0053565</ChapterDOI><ChapterSequenceNumber>7</ChapterSequenceNumber><ChapterTitle Language="En">Propagating differences: An efficient new fixpoint algorithm for distributive constraint systems</ChapterTitle><ChapterFirstPage>90</ChapterFirstPage><ChapterLastPage>104</ChapterLastPage><ChapterCopyright><CopyrightHolderName>Springer-Verlag</CopyrightHolderName><CopyrightYear>1998</CopyrightYear></ChapterCopyright><ChapterHistory><OnlineDate><Year>2006</Year><Month>5</Month><Day>23</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>3540643028</BookID><BookTitle>Programming Languages and Systems</BookTitle></ChapterContext></ChapterInfo><ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff1"><AuthorName DisplayOrder="Western"><GivenName>Christian</GivenName><FamilyName>Fecht</FamilyName></AuthorName><Contact><Email>fecht@cs.uni-sb.de</Email></Contact></Author><Author AffiliationIDS="Aff2"><AuthorName DisplayOrder="Western"><GivenName>Helmut</GivenName><FamilyName>Seidl</FamilyName></AuthorName><Contact><Email>seidl@psi.uni-trier.de</Email></Contact></Author><Affiliation ID="Aff1"><OrgName>Universität des Saarlandes</OrgName><OrgAddress><Postbox>Postfach 151150</Postbox><Postcode>D-66041</Postcode><City>Saarbrücken</City><Country>Germany</Country></OrgAddress></Affiliation><Affiliation ID="Aff2"><OrgDivision>Fachbereich IV - Informatik</OrgDivision><OrgName>Universität Trier</OrgName><OrgAddress><Postcode>D-54286</Postcode><City>Trier</City><Country>Germany</Country></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading><Para>Integrating <Emphasis Type="Italic">semi-naive</Emphasis> 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.</Para></Abstract></ChapterHeader><NoBody></NoBody></Chapter></Book></Series></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>Propagating differences: An efficient new fixpoint algorithm for distributive constraint systems</title></titleInfo><titleInfo type="alternative" contentType="CDATA" lang="en"><title>Propagating differences: An efficient new fixpoint algorithm for distributive constraint systems</title></titleInfo><name type="personal"><namePart type="given">Christian</namePart><namePart type="family">Fecht</namePart><affiliation>Universität des Saarlandes, Postfach 151150, D-66041, Saarbrücken, Germany</affiliation><affiliation>E-mail: fecht@cs.uni-sb.de</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Helmut</namePart><namePart type="family">Seidl</namePart><affiliation>Fachbereich IV - Informatik, Universität Trier, D-54286, Trier, Germany</affiliation><affiliation>E-mail: seidl@psi.uni-trier.de</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre type="conference" displayLabel="ReviewPaper"></genre><originInfo><publisher>Springer Berlin Heidelberg</publisher><place><placeTerm type="text">Berlin, Heidelberg</placeTerm></place><dateIssued encoding="w3cdtf">2006-05-23</dateIssued><copyrightDate encoding="w3cdtf">1998</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: 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.</abstract><relatedItem type="host"><titleInfo><title>Programming Languages and Systems</title><subTitle>7th European Symposium on Programming, ESOP'98 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS'98 Lisbon, Portugal, March 28 – April 4, 1998 Proceedings</subTitle></titleInfo><name type="personal"><namePart type="given">Chris</namePart><namePart type="family">Hankin</namePart><role><roleTerm type="text">editor</roleTerm></role></name><genre type="book-series" displayLabel="Proceedings"></genre><originInfo><copyrightDate encoding="w3cdtf">1998</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="I16048">Mathematical Logic and Formal Languages</topic><topic authority="SpringerSubjectCodes" authorityURI="I14010">Programming Techniques</topic><topic authority="SpringerSubjectCodes" authorityURI="I14029">Software Engineering</topic></subject><identifier type="DOI">10.1007/BFb0053558</identifier><identifier type="ISBN">978-3-540-64302-9</identifier><identifier type="eISBN">978-3-540-69722-0</identifier><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="BookTitleID">55105</identifier><identifier type="BookID">3540643028</identifier><identifier type="BookChapterCount">18</identifier><identifier type="BookVolumeNumber">1381</identifier><part><date>1998</date><detail type="volume"><number>1381</number><caption>vol.</caption></detail><extent unit="pages"><start>90</start><end>104</end></extent></part><recordInfo><recordOrigin>Springer-Verlag, 1998</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><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Juris</namePart><namePart type="family">Hartmanis</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Jan</namePart><namePart type="family">van Leeuwen</namePart><role><roleTerm type="text">editor</roleTerm></role></name><originInfo><copyrightDate encoding="w3cdtf">1998</copyrightDate><issuance>serial</issuance></originInfo><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="SeriesID">558</identifier><recordInfo><recordOrigin>Springer-Verlag, 1998</recordOrigin></recordInfo></relatedItem><identifier type="istex">539423816445C6AC42AF8B410E6BF0081C091C5C</identifier><identifier type="DOI">10.1007/BFb0053565</identifier><identifier type="ChapterID">7</identifier><identifier type="ChapterID">Chap7</identifier><accessCondition type="use and reproduction" contentType="copyright">Springer-Verlag, 1998</accessCondition><recordInfo><recordContentSource>SPRINGER</recordContentSource><recordOrigin>Springer-Verlag, 1998</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 001130 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 001130 | 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:539423816445C6AC42AF8B410E6BF0081C091C5C
|texte= Propagating differences: An efficient new fixpoint algorithm for distributive constraint systems
}}
| This area was generated with Dilib version V0.6.31. |  |