{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T04:19:50Z","timestamp":1742617190781,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540620341"},{"type":"electronic","value":"9783540496311"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-62034-6_63","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:32:08Z","timestamp":1330295528000},"page":"359-370","source":"Crossref","is-referenced-by-count":2,"title":["Immediate fixpoints and their use in groundness analysis"],"prefix":"10.1007","author":[{"given":"Harald","family":"S\u00d8ndergaard","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"31_CR1","unstructured":"T. Armstrong, K. Marriott, P. Schachte and H. S\u00d8ndergaard. Two classes of Boolean functions for dependency analysis. To appear in Science of Computer Programming."},{"key":"31_CR2","doi-asserted-by":"crossref","unstructured":"T.-R. Chuang and B. Goldberg. A syntactic approach to fixed point computation on finite domains. Proc. 1992 ACM Conf. Lisp and Functional Programming, pages 109\u2013118. ACM Press, 1992.","DOI":"10.1145\/141471.141517"},{"key":"31_CR3","doi-asserted-by":"crossref","unstructured":"A. Cortesi, G. Fil\u00e9 and W. Winsborough. Prop revisited: Propositional formula as abstract domain for groundness analysis. Proc. Sixth Ann. IEEE Symp. Logic in Computer Science, pages 322\u2013327. Amsterdam, The Netherlands, 1991.","DOI":"10.1109\/LICS.1991.151656"},{"issue":"3","key":"31_CR4","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0743-1066(94)00029-6","volume":"23","author":"A. Cortesi","year":"1995","unstructured":"A. Cortesi, B. Le Charlier and P. Van Hentenryck. Evaluation of the domain Prop. Journal of Logic Programming 23 (3): 237\u2013278, 1995.","journal-title":"Journal of Logic Programming"},{"issue":"2&3","key":"31_CR5","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. Journal of Logic Programming 13 (2&3): 103\u2013179, 1992.","journal-title":"Journal of Logic Programming"},{"key":"31_CR6","unstructured":"K. Marriott and H. S\u00d8ndergaard. Notes for a tutorial on abstract interpretation of logic programs. North American Conf. Logic Programming, Cleveland, Ohio, 1989."},{"issue":"1\u20134","key":"31_CR7","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1145\/176454.176519","volume":"2","author":"K. Marriott","year":"1993","unstructured":"K. Marriott and H. S\u00d8ndergaard. Precise and efficient groundness analysis for logic programs. ACM Letters on Programming Languages and Systems 2 (1\u20134): 181\u2013196, 1993.","journal-title":"ACM Letters on Programming Languages and Systems"},{"key":"31_CR8","volume-title":"PhD Thesis","author":"A. Mycroft","year":"1981","unstructured":"A. Mycroft. Abstract Interpretation and Optimising Transformations for Applicative Programs. PhD Thesis, University of Edinburgh, Scotland, 1981."},{"key":"31_CR9","doi-asserted-by":"crossref","unstructured":"F. Nielson and H. R. Nielson. Finiteness conditions for fixed point iteration. Proc. 1992 ACM Conf. Lisp and Functional Programming, pages 96\u2013108. ACM Press, 1992.","DOI":"10.1145\/141471.141514"},{"key":"31_CR10","doi-asserted-by":"crossref","unstructured":"F. Nielson and H. R. Nielson. Finiteness conditions for strictness analysis. In P. Cousot et al., Static Analysis: Proc. Third Int. Workshop. Lecture Notes in Computer Science 724, pages 194\u2013205. Springer-Verlag, 1993.","DOI":"10.1007\/3-540-57264-3_41"},{"key":"31_CR11","doi-asserted-by":"crossref","unstructured":"H. R. Nielson and F. Nielson. Bounded fixed point iteration. Proc. Nineteenth Ann. ACM SIGPLAN-SIGACT Symp. Principles of Programming Languages, pages 71\u201382. ACM Press, 1992.","DOI":"10.1145\/143165.143182"},{"key":"31_CR12","unstructured":"S. Rudeanu. Boolean Functions and Equations. North-Holland, 1974."},{"issue":"6","key":"31_CR13","doi-asserted-by":"crossref","first-page":"896","DOI":"10.1145\/218570.218573","volume":"17","author":"R. Sekar","year":"1995","unstructured":"R. Sekar and I. V. Ramakrishnan. Fast strictness analysis based on demand propagation. ACM Trans. Programming Languages and Systems 17 (6): 896\u2013937, 1995.","journal-title":"ACM Trans. Programming Languages and Systems"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-62034-6_63.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:27:34Z","timestamp":1742599654000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-62034-6_63"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540620341","9783540496311"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-62034-6_63","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}