{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T14:14:58Z","timestamp":1649168098145},"reference-count":13,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1996,9,1]],"date-time":"1996-09-01T00:00:00Z","timestamp":841536000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,19]],"date-time":"2013-07-19T00:00:00Z","timestamp":1374192000000},"content-version":"vor","delay-in-days":6165,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Journal of Logic Programming"],"published-print":{"date-parts":[[1996,9]]},"DOI":"10.1016\/0743-1066(96)00050-7","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T01:04:03Z","timestamp":1027645443000},"page":"217-229","source":"Crossref","is-referenced-by-count":2,"title":["Polyvariant detection of uninitialized arguments of prolog predicates"],"prefix":"10.1016","volume":"28","author":[{"given":"Thomas","family":"Lindgren","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0743-1066(96)00050-7_BIB1","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0743-1066(88)90012-X","article-title":"The Occur-Check Problem Revisited","volume":"5","author":"Beer","year":"1988","journal-title":"J. Logic Programming"},{"key":"10.1016\/0743-1066(96)00050-7_BIB2","unstructured":"Bigot, P., Gudeman, D., and Debray, S. K., Output Value Placement in Moded Logic Programs, in: Proc. ICLP'94."},{"key":"10.1016\/0743-1066(96)00050-7_BIB3","doi-asserted-by":"crossref","unstructured":"De Bosschere, K., Debray, S. K., Gudeman, D., and Kannan, S., Call Forwarding: A Simple Interprocedural Optimization Technique for Dynamically Typed Languages, in: Proc. POPL'94.","DOI":"10.1145\/174675.178041"},{"key":"10.1016\/0743-1066(96)00050-7_BIB4","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0743-1066(92)90030-7","article-title":"Abstract Interpretation and Application to Logic Programs","volume":"13","author":"Cousot","year":"1992","journal-title":"J. Logic Programming"},{"key":"10.1016\/0743-1066(96)00050-7_BIB5","article-title":"Abstract Interpretation for the Compile-Time Analysis of Logic Programs","author":"Getzinger","year":"1993"},{"key":"10.1016\/0743-1066(96)00050-7_BIB6","doi-asserted-by":"crossref","unstructured":"Getzinger, T., The Costs and Benefits of Abstract Interpretation-Driven Prolog Optimization, in: Proc. SAS'94.","DOI":"10.1007\/3-540-58485-4_30"},{"key":"10.1016\/0743-1066(96)00050-7_BIB7","doi-asserted-by":"crossref","unstructured":"Puebla, G., and Hermenegildo, M., Implementation of Multiple Specialization in Logic Programs, in: Proc. PEPM'95.","DOI":"10.1145\/215465.215561"},{"key":"10.1016\/0743-1066(96)00050-7_BIB8","unstructured":"Sahlin, D., The Mixtus Approach to Automatic Partial Evaluation of Full Prolog, in: Proc. NACLP'90."},{"key":"10.1016\/0743-1066(96)00050-7_BIB9","unstructured":"Somogyi, Z., Henderson, F., and Conway, T., The Execution Algorithm of Mercury: An Efficient Purely Declarative Logic Programming Language, revised version of paper appearing in ILPS'94 Post-Conf. Workshop on Implementation Techniques for Logic Programming Languages."},{"key":"10.1016\/0743-1066(96)00050-7_BIB10","article-title":"High Performance Prolog Implementation","author":"Taylor","year":"1991"},{"key":"10.1016\/0743-1066(96)00050-7_BIB11","article-title":"Can Logic Programming Execute as Fast as Imperative Programming","author":"Van Roy","year":"1990"},{"key":"10.1016\/0743-1066(96)00050-7_BIB12","unstructured":"Van Roy, P., and Despain, A., The Benefits of Global Dataflow Analysis for an Optimizing Prolog Compiler, in: Proc. NACLP'90."},{"key":"10.1016\/0743-1066(96)00050-7_BIB13","article-title":"An Abstract Prolog Instruction Set","author":"Warren","year":"1983"}],"container-title":["The Journal of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743106696000507?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743106696000507?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T05:26:03Z","timestamp":1555392363000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0743106696000507"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,9]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1996,9]]}},"alternative-id":["0743106696000507"],"URL":"https:\/\/doi.org\/10.1016\/0743-1066(96)00050-7","relation":{},"ISSN":["0743-1066"],"issn-type":[{"value":"0743-1066","type":"print"}],"subject":[],"published":{"date-parts":[[1996,9]]}}}