{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:59:35Z","timestamp":1725663575624},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540572640"},{"type":"electronic","value":"9783540480273"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57264-3_27","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T07:34:31Z","timestamp":1330241671000},"page":"27-44","source":"Crossref","is-referenced-by-count":1,"title":["Chaotic fixpoint iteration guided by dynamic dependency"],"prefix":"10.1007","author":[{"given":"Niels","family":"J\u00d8rgensen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"3_CR1","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. J. Logic Programming 1987, 4, pp. 259\u2013262.","journal-title":"J. Logic Programming"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"F. Bancilhon and R. Ramakrishnan. An Amateur's Intorduction to Recursive Query Processing Strategies. MCC Technical Report No. DB-091-86, March 1986.","DOI":"10.1145\/16894.16859"},{"key":"3_CR3","first-page":"225","volume":"10","author":"C. Beeri","year":"1991","unstructured":"C. Beeri and R. Ramakrishnan. On the power of magic. J. Logic Programming 1991, 10, pp. 225\u2013299.","journal-title":"J. Logic Programming"},{"key":"3_CR4","unstructured":"B. Le Charlier, K. Musumbu, P. Van Hentenryck. A generic abstract interpretation algorithm and its complexity analysis. Proc. 8th International Conference on Logic Programming, 1991, Paris, pp. 64\u201378."},{"key":"3_CR5","unstructured":"B. Le Charlier and P. Van Hentenryck. Experimental evaluation of a generic abstract interpretation algorithm for Prolog. Technical Report CS-91-55, August 1991, Brown University."},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"P. Cousot and R. Cousot. Abstract Interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. Proc. 4th ACM Symposium on Principles of Programming Languages, 1977, pp. 238\u2013252,.","DOI":"10.1145\/512950.512973"},{"issue":"8","key":"3_CR7","first-page":"1","volume":"12","author":"P. Cousot","year":"1977","unstructured":"P. Cousot and R. Cousot. Automatic synthesis of optimal invariant assertions: Mathematical foundations. Proc. ACM Symposium on Artificial Intelligence and programming languages, SIGPLAN Notices, 12 (8), 1977, pp. 1\u201312.","journal-title":"Proc. ACM Symposium on Artificial Intelligence and programming languages"},{"key":"3_CR8","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0743-1066(92)90030-7","volume":"13","author":"P. Cousot","year":"1992","unstructured":"P. Cousot and R. Cousot. Abstract interpretation and application to logic programs. J. Logic Programming 1992 13, pp. 103\u2013179.","journal-title":"J. Logic Programming"},{"issue":"3","key":"3_CR9","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1145\/65979.65983","volume":"11","author":"S. K. Debray","year":"1989","unstructured":"S. K. Debray. Static inference of modes and data dependencies in logic programs. ACM Transactions on Programming Languages and Systems, 11 (3), 1989, pp. 418\u2013450.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"J. Jaffar and J.-L. Lassez. Constraint logic programming. Technical Report, Monash University, June 1986.","DOI":"10.1145\/41625.41635"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"J. Jaffar, S. Michaylov, P. Stuckey and R. Yap. An abstract machine for CLP( $$\\mathcal{R}$$ }). SIGPLAN PLDI, San Francisco, June 1992.","DOI":"10.1145\/143095.143127"},{"key":"3_CR12","unstructured":"N. J\u00d8rgensen. Abstract interpretation of constraint logic programs. Ph.D. thesis. To appear in Datalogiske skrifter, 1993, Computer Science Dept., Roskilde University Center."},{"key":"3_CR13","unstructured":"N. J\u00d8rgensen, K. Marriott, and S. Michaylov. Some global compile-time optimizations of CLP( $$\\mathcal{R}$$ ). Proc. International Logic Programming Symposium, San Diego, 1991, pp. 420\u2013434."},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"N. D. Jones and A. Mycroft. Data flow analysis of applicative programs using minimal function graphs. Proc. 13th ACM Symposium on Principles of Programming Languages, Florida, 1986, pp. 296\u2013306.","DOI":"10.1145\/512644.512672"},{"key":"3_CR15","unstructured":"R.A. O'Keefe. Finite fixed-point problems. Proc. 4th International Conference on Logic Programming, 1987, Melbourne, 729\u2013743."},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"J.W. Lloyd. Foundations of logic programming. Springer-Verlag, 1984.","DOI":"10.1007\/978-3-642-96826-6"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"G.A. Kildall. A unified approach to global program optimization. Proc. POPL 1973, Boston, 194\u2013206.","DOI":"10.1145\/512927.512945"},{"key":"3_CR18","unstructured":"K. Marriott and H. S\u00d8ndergaard. Analysis of constraint logic programs. Proc. North American Conference on Logic Programming, Austin, 1998, pp. 521\u2013540."},{"key":"3_CR19","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0743-1066(92)90031-W","volume":"13","author":"K. Marriott","year":"1992","unstructured":"K. Marriott and H. S\u00d8ndergaard. Bottom-up dataflow analysis of normal logic programs. J. Logic Programming 1992, 13, pp. 181\u2013204.","journal-title":"J. Logic Programming"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"C. Martin and C. Hanking. Finding fixed points in finite lattices. FPLCA 1987 Portland, Ohio.","DOI":"10.1007\/3-540-18317-5_23"},{"key":"3_CR21","unstructured":"C. S. Mellish. The automatic generation of mode declarations for Prolog programs. DAI Research Paper 163, University of Edinburgh, 1981."},{"key":"3_CR22","unstructured":"S. Peyton-Jones and C. Clack. Finding fixpoints in abstract interpretation, in: S. Abramski and C. Hankin (eds): Abstract interpretation of declarative languages. Ellis Horwood, 1987, pp. 246\u2013265."},{"key":"3_CR23","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","volume":"5","author":"A. Tarski","year":"1955","unstructured":"A. Tarski. A lattice-theoretical fixpoint theorem and its application. Pacific Journal of Mathematics, 1955, 5, pp. 285\u2013309.","journal-title":"Pacific Journal of Mathematics"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57264-3_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T00:24:33Z","timestamp":1640910273000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57264-3_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540572640","9783540480273"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-57264-3_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}