{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:25:55Z","timestamp":1761611155039,"version":"build-2065373602"},"reference-count":25,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":4958,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2000]]},"DOI":"10.1016\/s1571-0661(05)80637-1","type":"journal-article","created":{"date-parts":[[2005,4,24]],"date-time":"2005-04-24T07:16:06Z","timestamp":1114326966000},"page":"163-187","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":11,"title":["Some Issues in Analysis and Specialization of Modular Ciao-Prolog Programs"],"prefix":"10.1016","volume":"30","author":[{"given":"G.","family":"Puebla","sequence":"first","affiliation":[]},{"given":"M.","family":"Hermenegildo","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"year":"1991","series-title":"Warren's Abstract Machine, A Tutorial Reconstruction","author":"Hassan Ait-Kaci","key":"10.1016\/S1571-0661(05)80637-1_BIB1"},{"key":"10.1016\/S1571-0661(05)80637-1_BIB2","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0743-1066(91)80001-T","article-title":"A Practical Framework for the Abstract Interpretation of Logic Programs","volume":"10","author":"Bruynooghe","year":"1991","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/S1571-0661(05)80637-1_BIB3","article-title":"The Ciao Prolog System","author":"Bueno","year":"1997","journal-title":"Reference Manual. The Ciao System Documentation Series-TR CLIP3\/97.1, School of Computer Science, Technical University of Madrid (UPM)"},{"key":"10.1016\/S1571-0661(05)80637-1_BIB4","series-title":"Global Analysis of Standard Prolog Programs, European Symposium on Programming, number 1058 in LNCS","first-page":"108","author":"Bueno","year":"1996"},{"key":"10.1016\/S1571-0661(05)80637-1_BIB5","series-title":"ICLP'99 WS on Parallelism and Implementation of (C)LP Systems","first-page":"110","article-title":"A New Module System for Prolog","author":"Cabeza","year":"1999"},{"key":"10.1016\/S1571-0661(05)80637-1_BIB6","series-title":"ICLP'99 WS on Parallelism and Implementation of (C)LP Systems","first-page":"147","article-title":"The Ciao Modular Compiler and Its Generic Program Processing Library","author":"Cabeza","year":"1999"},{"key":"10.1016\/S1571-0661(05)80637-1_BIB7","first-page":"238","article-title":"Abstract Interpretation: a Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints","author":"Cousot","year":"1977","journal-title":"Fourth ACM Symposium on Principles of Programming Languages"},{"key":"10.1016\/S1571-0661(05)80637-1_BIB8","series-title":"Proceedings of PEPM\u203293, the ACM Sigplan Symposium on Partial Evaluation and Semantics-Based Program Manipulation","first-page":"88","article-title":"Tutorial on specialisation of logic programs","author":"Gallagher","year":"1993"},{"key":"10.1016\/S1571-0661(05)80637-1_BIB9","series-title":"Proc. 3rd. Int'l Symposium on Programming Language Implementation and Logic Programming, number 528 in LNCS","first-page":"323","article-title":"A Technique for Recursive Invariance Detection and Selective Program Specialization","author":"Giannotti","year":"1991"},{"key":"10.1016\/S1571-0661(05)80637-1_BIB10","series-title":"The Logic Programming Paradigm: a 25-Year Perspective","first-page":"161","article-title":"Using Global Analysis, Partial Specifications, and an Extensible Assertion Language for Program Validation and Debugging","author":"Hermenegildo","year":"1999"},{"key":"10.1016\/S1571-0661(05)80637-1_BIB11","series-title":"International Conference on Logic Programming","first-page":"797","article-title":"Incremental Analysis of Logic Programs","author":"Hermenegildo","year":"1995"},{"key":"10.1016\/S1571-0661(05)80637-1_BIB12","doi-asserted-by":"crossref","DOI":"10.1145\/349214.349216","article-title":"Incremental Analysis of Constraint Logic Programs","author":"Hermenegildo","year":"2000","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"10.1016\/S1571-0661(05)80637-1_BIB13","series-title":"1990 International Conference on Logic Programming","first-page":"718","article-title":"Multiple specialization of logic programs with run-time tests","author":"Jacobs","year":"1990"},{"year":"1993","series-title":"Partial Evaluation and Automatic Program Generation","author":"Jones","key":"10.1016\/S1571-0661(05)80637-1_BIB14"},{"key":"10.1016\/S1571-0661(05)80637-1_BIB15","series-title":"Proceedings of Joint International Conference and Symposium on Logic Programming","first-page":"37","article-title":"Effectiveness of optimizing compilation for CLP(R)","author":"Kelly","year":"1996"},{"key":"10.1016\/S1571-0661(05)80637-1_BIB16","unstructured":"Michael Leuschel. Advanced Techniques for Logic Program Specialisation. PhD thesis, K.U. Leuven, May 1997."},{"key":"10.1016\/S1571-0661(05)80637-1_BIB17","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0743-1066(91)90027-M","article-title":"Partial Evaluation in Logic Programming","volume":"11","author":"Lloyd","year":"1991","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/S1571-0661(05)80637-1_BIB18","article-title":"Deriving A Fixpoint Computation Algorithm for Top-down Abstract Interpretation of Logic Programs","author":"Muthukumar","year":"1990","journal-title":"Technical Report ACT-DC-153-90, Microelectronics and Computer Technology Corporation (MCC), Austin, TX 78759"},{"issue":"2\/3","key":"10.1016\/S1571-0661(05)80637-1_BIB19","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/0743-1066(92)90035-2","article-title":"Compile-time Derivation of Variable Dependency Using Abstract Interpretation","volume":"13","author":"Muthukumar","year":"1992","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/S1571-0661(05)80637-1_BIB20","series-title":"Analysis and Visualization Tools for Constraint Programming","article-title":"An Assertion Language for Constraint Logic Programs","author":"Puebla","year":"2000"},{"key":"10.1016\/S1571-0661(05)80637-1_BIB21","series-title":"Proc. ACM SIGPLAN Symposium on Partial Evaluation and Semantics Based Program Manipulation","first-page":"77","article-title":"Implementation of Multiple Specialization in Logic Programs","author":"Puebla","year":"1995"},{"key":"10.1016\/S1571-0661(05)80637-1_BIB22","series-title":"International Static Analysis Symposium, number 1145 in LNCS","first-page":"270","article-title":"Optimized Algorithms for the Incremental Analysis of Logic Programs","author":"Puebla","year":"1996"},{"issue":"2&3","key":"10.1016\/S1571-0661(05)80637-1_BIB23","first-page":"279","article-title":"Abstract Multiple Specialization and its Application to Program Parallelization","volume":"41","author":"Puebla","year":"1999","journal-title":"J. of Logic Programming. Special Issue on Synthesis, Transformation and Analysis of Logic Programs"},{"key":"10.1016\/S1571-0661(05)80637-1_BIB24","series-title":"In Workshop on Static Analysis, number 724 in LNCS","first-page":"1","article-title":"The Impact of Granularity in Abstract Interpretation of Prolog","author":"Van Hentenryck","year":"1993"},{"issue":"2 and 3","key":"10.1016\/S1571-0661(05)80637-1_BIB25","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0743-1066(92)90033-Y","article-title":"Multiple Specialization using Minimal-Function Graph Semantics","volume":"13","author":"Winsborough","year":"1992","journal-title":"Journal of Logic Programming"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105806371?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105806371?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:08:55Z","timestamp":1761610135000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105806371"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2000]]}},"alternative-id":["S1571066105806371"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)80637-1","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Some Issues in Analysis and Specialization of Modular Ciao-Prolog Programs","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(05)80637-1","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2000 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}