{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:30:30Z","timestamp":1759638630208},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540617396"},{"type":"electronic","value":"9783540706748"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61739-6_40","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:18:22Z","timestamp":1330294702000},"page":"159-173","source":"Crossref","is-referenced-by-count":4,"title":["A comparison of three occur-check analysers"],"prefix":"10.1007","author":[{"given":"Lobel","family":"Crnogorac","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew D.","family":"Kelly","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Harald","family":"S\u00d8ndergaard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"K. R. Apt and A. Pellegrini. Why the occur-check is not a problem. In M. Bruynooghe and M. Wirsing, editors, Proc. PLILP '92, LNCS 631, pages 69\u201386. Springer-Verlag, 1992.","DOI":"10.1007\/3-540-55844-6_128"},{"issue":"3","key":"12_CR2","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1145\/177492.177673","volume":"16","author":"K. R. Apt","year":"1994","unstructured":"K. R. Apt and A. Pellegrini. On the occur-check-free Prolog programs. ACM TOPLAS, 16(3):687\u2013726, 1994.","journal-title":"ACM TOPLAS"},{"key":"12_CR3","unstructured":"T. Armstrong, K. Marriott, P. Schachte, and H. S\u00d8ndergaard. Two classes of Boolean functions for dependency analysis. To appear in Sci. Comp. Prog."},{"key":"12_CR4","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0743-1066(88)90012-X","volume":"5","author":"J. Beer","year":"1988","unstructured":"J. Beer. The occur-check problem revisited. J. Logic Prog., 5:243\u2013261, 1988.","journal-title":"J. Logic Prog."},{"key":"12_CR5","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0743-1066(94)90048-5","volume":"18","author":"R. Chadha","year":"1994","unstructured":"R. Chadha and D. A. Plaisted. Correctness of unification without occur check in Prolog. J. Logic Prog., 18:99\u2013122, 1994.","journal-title":"J. Logic Prog."},{"key":"12_CR6","unstructured":"M. Codish, D. Dams, and E. Yardeni. Derivation and safety of an abstract unification algorithm for groundness and aliasing analysis. In K. Furukawa, editor, Logic Programming: Proc. Eighth Int. Conf., pages 79\u201393. MIT Press, 1991."},{"issue":"2","key":"12_CR7","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 Prog., 13(2&3):103\u2013179, 1992.","journal-title":"J. Logic Prog."},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"L. Crnogorac, A. D. Kelly, and H. S\u00d8ndergaard. A comparison of three occur-check analyses. Technical Report 96\/20, Dept. of Computer Science, The University of Melbourne, 1996.","DOI":"10.1007\/3-540-61739-6_40"},{"key":"12_CR9","unstructured":"P. Deransart, G. Ferrand, and M. T\u00e9guia. NSTO programs (Not Subject To Occur-check). In V. Saraswat and K. Ueda, editors, Logic Programming: Proc. 1991 Int. Symp., pages 533\u2013547. MIT Press, 1991."},{"issue":"2","key":"12_CR10","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0743-1066(85)90015-9","volume":"2","author":"P. Deransart","year":"1985","unstructured":"P. Deransart and J. Ma\u0142uszy\u0144ski. Relating logic programs and attribute grammars. J. Logic Prog., 2(2):119\u2013156, 1985.","journal-title":"J. Logic Prog."},{"key":"12_CR11","unstructured":"B. Dumant. Checking the soundness of resolution schemes. In K. Apt, editor, Logic Programming: Proc. Joint Int. Conf. Symp., pages 37\u201351. MIT Press, 1992."},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"M. Hermenegildo, G. Puebla, K. Marriott, and P. Stuckey. Incremental analysis of logic programs. In L. Sterling, editor, Logic Programming: Proc. Twelfth Int. Conf., pages 797\u2013811. MIT Press, 1995.","DOI":"10.7551\/mitpress\/4298.003.0075"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"A. D. Kelly, A. Macdonald, K. Marriott, H. S\u00d8ndergaard, P. Stuckey, and R. Yap. An optimizing compiler for CLP({ie173-01}). In U. Montanari and F. Rossi, editors, Proc. CP'95, LNCS 976, pages 222\u2013239. Springer-Verlag, 1995.","DOI":"10.1007\/3-540-60299-2_14"},{"issue":"1","key":"12_CR14","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1145\/174625.174627","volume":"16","author":"B. Charlier Le","year":"1994","unstructured":"B. Le Charlier and P. Van Hentenryck. Experimental evaluation of a generic abstract interpretation algorithm for Prolog. ACM TOPLAS, 16(1):35\u2013101, 1994.","journal-title":"ACM TOPLAS"},{"issue":"5","key":"12_CR15","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1145\/66068.66075","volume":"24","author":"K. Marriott","year":"1989","unstructured":"K. Marriott and H. S\u00d8ndergaard. On Prolog and the occur check problem. SIGPLAN Notices, 24(5):76\u201382, 1989.","journal-title":"SIGPLAN Notices"},{"key":"12_CR16","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:181\u2013196, 1993.","journal-title":"ACM Letters on Programming Languages and Systems"},{"issue":"3","key":"12_CR17","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1145\/177492.177650","volume":"16","author":"K. Marriott","year":"1994","unstructured":"K. Marriott, H. S\u00d8ndergaard, and N. Jones. Denotational abstract interpretation of logic programs. ACM TOPLAS, 16(3):607\u2013648, 1994.","journal-title":"ACM TOPLAS"},{"issue":"2","key":"12_CR18","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. Hermenegildo. Compile-time derivation of variable dependency using abstract interpretation. J. Logic Prog., 13(2&3):315\u2013347, 1992.","journal-title":"J. Logic Prog."},{"issue":"4","key":"12_CR19","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/BF03037324","volume":"2","author":"D. A. Plaisted","year":"1984","unstructured":"D. A. Plaisted. The occur-check problem in Prolog. New Generation Computing, 2(4):309\u2013322, 1984.","journal-title":"New Generation Computing"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"H. S\u00d8ndergaard. An application of abstract interpretation of logic programs: Occur check reduction. In B. Robinet and R. Wilhelm, editors, Proc. European Symposium on Programming, LNCS 213, pages 327\u2013338. Springer-Verlag, 1986.","DOI":"10.1007\/3-540-16442-1_25"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61739-6_40.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,20]],"date-time":"2024-04-20T17:44:37Z","timestamp":1713635077000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61739-6_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540617396","9783540706748"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-61739-6_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}