{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,20]],"date-time":"2024-09-20T15:44:49Z","timestamp":1726847089193},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540643029"},{"type":"electronic","value":"9783540697220"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0053565","type":"book-chapter","created":{"date-parts":[[2006,6,7]],"date-time":"2006-06-07T01:40:18Z","timestamp":1149644418000},"page":"90-104","source":"Crossref","is-referenced-by-count":11,"title":["Propagating differences: An efficient new fixpoint algorithm for distributive constraint systems"],"prefix":"10.1007","author":[{"given":"Christian","family":"Fecht","sequence":"first","affiliation":[]},{"given":"Helmut","family":"Seidl","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,23]]},"reference":[{"key":"7_CR1","first-page":"33","volume":"983","author":"M. Alt","year":"1995","unstructured":"M. Alt and F. Martin. Generation of Efficient Interprocedural Analyzers with PAG. In 2nd SAS, 33\u201350. LNCS 983, 1995.","journal-title":"LNCS"},{"issue":"3","key":"7_CR2","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0743-1066(87)90004-5","volume":"4","author":"I. Balbin","year":"1987","unstructured":"I. Balbin and K. Ramamohanarao. A Generalization of the Differential Approach to Recursive Query Evaluation. JLP, 4(3):259\u2013262, 1987.","journal-title":"JLP"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"F. Bancilhon and R. Ramakrishnan. An Amateur's Introduction to Recursive Query Processing Strategies. In ACM SIGMOD Conference 1986, 16\u201352, 1986.","DOI":"10.1145\/16894.16859"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"F. Bancilhon and R. Ramakrishnan. Performance Evaluation of Data Intensive Logic Programs. In Jack Minker, editor, Foundations of Deductive Databases and Logic Programming, chapter 12, 439\u2013517. Morgan Kaufmann Publishers, 1988.","DOI":"10.1016\/B978-0-934613-40-8.50016-6"},{"key":"7_CR5","volume-title":"Technical Report CS-92-25","author":"B. L. Charlier","year":"1992","unstructured":"B. Le Charlier and P. Van Hentenryck. A Universal Top-Down Fixpoint Algorithm. Technical Report CS-92-25, Brown University, Providence, RI 02912, 1992."},{"issue":"1","key":"7_CR6","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1145\/174625.174627","volume":"16","author":"B. L. Charlier","year":"1994","unstructured":"B. Le Charlier and P. Van Hentenryck. Experimental Evaluation of a Generic Abstract Interpretation Algorithm for Prolog. A CM TOPLAS, 16(1):35\u2013101, 1994.","journal-title":"A CM TOPLAS"},{"key":"7_CR7","unstructured":"M. Codish, D. Dams, and E, Yardeni. Derivation of an Abstract Unification Algorithm for groundnes and Aliasing Analysis. In ICLP, 79\u201393, 1991."},{"key":"7_CR8","unstructured":"P. Cousot and R. Cousot. Static Determination of Dynamic Properties of Recursive Programs. In E.J. Neuhold, editor, Formal Descriptions of Programming Concepts, 237\u2013277. North-Holland Publishing Company, 1977."},{"issue":"4","key":"7_CR9","first-page":"419","volume":"23","author":"V. Englebert","year":"1993","unstructured":"V. Englebert, B. Le Charlier, D. Roland, and P. Van Hentenryck. Generic Abstract Interpretation Algorithms for Prolog: Two Optimization Techniques and their Experimental Evaluation. SPE, 23(4):419\u2013459, 1993.","journal-title":"SPE"},{"key":"7_CR10","first-page":"418","volume":"983","author":"C. Fecht","year":"1995","unstructured":"C. Fecht. GENA-A Tool for Generating Prolog Analyzers from Specifications. 2nd SAS, 418\u2013419. LNCS 983, 1995.","journal-title":"LNCS"},{"key":"7_CR11","volume-title":"PhD thesis","author":"C. Fecht","year":"1997","unstructured":"C. Fecht. Abstrakte Interpretation logischer Programme: Theorie, Implementierung, Generierung. PhD thesis, Universit\u00e4t des Saarlandes, Saarbr\u00fccken, 1997."},{"key":"7_CR12","first-page":"189","volume":"1145","author":"C. Fecht","year":"1996","unstructured":"C. Fecht and H. Seidl. An Even Faster Solver for General Systems of Equations. 3rd SAS, 189\u2013204. LNCS 1145, 1996. Extended version to appear in SCP'99.","journal-title":"LNCS"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"N. Heintze. Set-Based Analysis of ML Programs. ACM Conf. LFP, 306\u2013317, 1994.","DOI":"10.1145\/182590.182495"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"N. Heintze and D.A. McAllester. On the Cubic Bottleneck in Subtyping and Flow Analysis. IEEE Symp. LICS, 342\u2013351, 1997.","DOI":"10.1109\/LICS.1997.614960"},{"key":"7_CR15","volume-title":"Technical Report CS-93-05","author":"P. Hentenryck Van","year":"1993","unstructured":"P. Van Hentenryck, 0. Degimbe, B. Le Charlier, and L. Michel. Abstract Interpretation of Prolog Based on OLDT Resolution. Technical Report CS-93-05, Brown University, Providence, RI 02912, 1993."},{"key":"7_CR16","first-page":"1","volume":"724","author":"P. Hentenryck Van","year":"1993","unstructured":"P. Van Hentenryck, O. Degimbe, B. Le Charlier, and L. Michel. The Impact of Granularity in Abstract Interpretation of Prolog. 3rd WSA, 1\u201314. LNCS 724, 1993.","journal-title":"LNCS"},{"key":"7_CR17","first-page":"651","volume":"915","author":"S. Horwitz","year":"1995","unstructured":"S. Horwitz, T.W. Reps, and M. Sagiv. Precise Interprocedural Dataflow Analysis with Applications to Constant Propagation. 6th TAPSOFT, 651\u2013665. LNCS 915, 1995.","journal-title":"LNCS"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"S. Horwitz, T.W. Reps, and M. Sagiv. Precise Interprocedural Dataflow Analysis via Graph Reachability. 22nd POPL, 49\u201361, 1995.","DOI":"10.1145\/222124.222146"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"D. Melski and T.W. Reps. Interconvertability of Set Constraints and Context-Free Language Reachability. ACM SIGPLAN Symp. PEPM, 74\u201389, 1997.","DOI":"10.1145\/258994.259006"},{"issue":"2","key":"7_CR20","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/0743-1066(92)90035-2","volume":"13","author":"K. Muthukumar","year":"1992","unstructured":"K. Muthukumar and M. V. Hermenegildo. Compile-Time Derivation of Variable Dependency Using Abstract Interpretation. JLP, 13(2&3):315\u2013347, 1992.","journal-title":"JLP"},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"H. Riis Nielson and F. Nielson. Infinitary Control Flow Analysis: A Collecting Semantics for Closure Analysis. 24th POPL, 332\u2013345, 1997.","DOI":"10.1145\/263699.263745"},{"key":"7_CR22","first-page":"36","volume":"432","author":"R. Paige","year":"1990","unstructured":"R. Paige. Symbolic Finite Differencing-Part I. 3rd ESOP, 36\u201356. LNCS 432, 1990.","journal-title":"LNCS"},{"key":"7_CR23","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1145\/200994.201001","volume":"17","author":"J. Palsberg","year":"1995","unstructured":"J. Palsberg. Closure Analysis in Constraint Form. A CM TOPLAS, 17:47\u201382, 1995.","journal-title":"A CM TOPLAS"},{"key":"7_CR24","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1145\/210184.210187","volume":"17","author":"J. Palsberg","year":"1995","unstructured":"J. Palsberg and P. O'Keefe. A Type System Equivalent to Flow Analysis. ACM TOPLAS, 17:576\u2013599, 1995.","journal-title":"ACM TOPLAS"},{"key":"7_CR25","unstructured":"H. Seidl and C. Fecht. Interprocedural Analysis Based on PDAs. Technical Report 97-06, University Trier, 1997. Extended Abstract in: Verification, Model Checking and Abstract Interpretation. A Workshop in Assiciation with ILPS'97."},{"key":"7_CR26","doi-asserted-by":"crossref","unstructured":"H. Seidl and M.H. S0rensen. Constraints to Stop Higher-Order Deforestation. 24th POPL, 400\u2013413, 1997.","DOI":"10.1145\/263699.263758"},{"key":"7_CR27","first-page":"327","volume":"213","author":"H. S0ndergaard","year":"1986","unstructured":"H. S0ndergaard. An Application of Abstract Interpretation of Logic Programs: Occur Check Reduction. 1st ESOP, 327\u2013338. LNCS 213, 1986.","journal-title":"LNCS"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0053565","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T02:34:24Z","timestamp":1555641264000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0053565"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540643029","9783540697220"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/bfb0053565","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}