{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:10:08Z","timestamp":1742598608202,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540584858"},{"type":"electronic","value":"9783540490050"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58485-4_50","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:27:26Z","timestamp":1330273646000},"page":"329-345","source":"Crossref","is-referenced-by-count":11,"title":["Finding fixpoints in finite function spaces using neededness analysis and chaotic iteration"],"prefix":"10.1007","author":[{"given":"Niels","family":"J\u00f8rgensen","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"issue":"8","key":"21_CR1","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, SIGPLAN Notices"},{"key":"21_CR2","first-page":"237","volume-title":"Static determination of dynamic properties of recursive procedures","author":"P. Cousot","year":"1977","unstructured":"P. Cousot, and R. Cousot. Static determination of dynamic properties of recursive procedures. IFIP Conf. on Formal description of programming concepts, North-Holland Publ. Co., Amsterdam 1977, pp. 237\u2013277."},{"key":"21_CR3","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/BF03037167","volume":"9","author":"J. Gallagher","year":"1991","unstructured":"J. Gallagher, and M. Bruynooghe. The derivation of an algorithm for program specialisation. New Generation Computing, 9, 1991, 305\u2013333.","journal-title":"New Generation Computing"},{"key":"21_CR4","unstructured":"N. J\u00f8rgensen. Abstract interpretation of constraint logic programs. Ph.D. thesis. Computer Science Dept., Roskilde University, 1992."},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"N. J\u00f8rgensen. Chaotic fixpoint iteration guided by dynamic dependency. Proc. Workshop on Static Analysis, 1993, LNCS 724, Springer-Verlag, pp. 1\u201314","DOI":"10.1007\/3-540-57264-3_27"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"N. J\u00f8rgensen. Finding fixpoints in finite function spaces using neededness analysis and chaotic iteration. Datalogiske Skrifter, Computer Science Dept., Roskilde University, 1994.","DOI":"10.1007\/3-540-58485-4_50"},{"key":"21_CR7","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/0743-1066(92)90035-2","volume":"13","author":"K. Muthukumar","year":"1992","unstructured":"K. Muthukumar, and M. Hermenegildo. Compile-time derivation of variable dependency using abstract interpretation. J. Logic Programming 1992, 13, pp. 315\u2013347.","journal-title":"J. Logic Programming"},{"key":"21_CR8","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, 1986, pp. 296\u2013306.","DOI":"10.1145\/512644.512672"},{"key":"21_CR9","unstructured":"R.A. O'Keefe. Finite fixed-point problems. Proc. 4th International Conference on Logic Programming, 1987, pp. 729\u2013743."},{"key":"21_CR10","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, pp. 64\u201378."},{"key":"21_CR11","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":"21_CR12","doi-asserted-by":"crossref","unstructured":"G.A. Kildall. A unified approach to global program optimization. Proc. ACM Symposium on Principles of Programming Languages, 1993, 194\u2013206.","DOI":"10.1145\/512927.512945"},{"key":"21_CR13","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/BF01237234","volume":"28","author":"T.J. Marlowe","year":"1990","unstructured":"T.J. Marlowe, and B.G. Ryder. Properties of data flow frameworks. A unified model. Acta Informatica 28, 1990, pp. 121\u2013163.","journal-title":"Acta Informatica"},{"key":"21_CR14","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":"21_CR15","doi-asserted-by":"crossref","unstructured":"M. Rosendahl. Higher-order chaotic iteration sequences. Proc. 5th International Symposium on Programming Language and Implementation and Logic Programming, 1993, LNCS 714, Springer-Verlag, pp. 332\u2013345.","DOI":"10.1007\/3-540-57186-8_89"},{"key":"21_CR16","doi-asserted-by":"crossref","unstructured":"P. Van Hentenryck, O. Degimbe, B. Le Charlier, and L. Michel. The impact of granularity in abstract interpretation of Prolog. Proc. Workshop on Static Analysis, 1993, LNCS 724, Springer-Verlag, pp. 1\u201314.","DOI":"10.1007\/3-540-57264-3_25"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58485-4_50.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:33:01Z","timestamp":1742596381000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58485-4_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540584858","9783540490050"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-58485-4_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}