{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:27:23Z","timestamp":1761611243182},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[1991,8,1]],"date-time":"1991-08-01T00:00:00Z","timestamp":681004800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["New Gener Comput"],"published-print":{"date-parts":[[1991,8]]},"DOI":"10.1007\/bf03037167","type":"journal-article","created":{"date-parts":[[2009,4,22]],"date-time":"2009-04-22T02:52:58Z","timestamp":1240368778000},"page":"305-333","source":"Crossref","is-referenced-by-count":42,"title":["The derivation of an algorithm for program specialisation"],"prefix":"10.1007","volume":"9","author":[{"given":"John","family":"Gallagher","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maurice","family":"Bruynooghe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF03037167_CR1","unstructured":"Abramsky, S. and Hankin, C., eds.:Abstract Interpretation of Declarative Languages, Ellis Horwood, 1987."},{"key":"BF03037167_CR2","unstructured":"Benkerimi, K. and Lloyd, J. W., \u201cA Procedure for Partial Evaluation of Logic Programs,\u201dProceedings of the North American Conference on Logic Programming, November 1990, Austin, Texas (S. Debray and M. Hermenegildo, eds.), MIT Press, 1990."},{"key":"BF03037167_CR3","unstructured":"Bruynooghe, M., \u201cA Practical Framework for the Abstract Interpretation of Logic Programs,\u201d to appear inJournal of Logic Programming."},{"key":"BF03037167_CR4","unstructured":"Codish, M., Gallagher, J. and Shapiro, E., \u201cUsing Safe Approximations of Fixed Points for Analysis of Logic Programs,\u201d inMeta-Programming in Logic Programming (H. Abramson and M. Rogers, eds.), MIT Press, 1989."},{"key":"BF03037167_CR5","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/BF03037136","volume":"6","author":"J. Gallagher","year":"1988","unstructured":"Gallagher, J. and Codish, M. and Shapiro, E., \u201cSpecialisation of Prolog and FCP Programs Using Abstract Interpretation,\u201dNew Generation Computing, 6, pp. 159\u2013186, 1988.","journal-title":"New Generation Computing"},{"key":"BF03037167_CR6","unstructured":"Gallagher, J. and Bruynooghe, M., \u201cSome Low-Level Source Transformations for Logic Programs,\u201dProceedings of Meta 90 Workshop on Meta Programming in Logic, Leuven, Belgium, April 1990."},{"key":"BF03037167_CR7","unstructured":"Jones, N. D. and S\u00f8ndergaard, H., \u201cA Semantics-Based Framework for the Abstract Interpretation of Prolog,\u201dInterpretation of Declarative Language Abstruct (S. Abramsky and C. Hankin, eds.), Ellis Horwood, 1987."},{"key":"BF03037167_CR8","doi-asserted-by":"crossref","unstructured":"Jones, N. D. and Mycroft, A., \u201cDataflow Analysis of Applicative Programs Using Minimal Function Graphs,\u201dProceedings of Principles of Programming Languages, 1986.","DOI":"10.1145\/512644.512672"},{"key":"BF03037167_CR9","doi-asserted-by":"crossref","unstructured":"Komorowski, H. J., \u201cPartial Evaluation as a Means for Inferencing Data Structures in an Applicative Language: A Theory and Implementation in the Case of Prolog,\u201d in9th ACM Symposium on Principles of Programming Languages, Albuquerque, New Mexico, pp. 255\u2013267, 1982.","DOI":"10.1145\/582153.582181"},{"key":"BF03037167_CR10","doi-asserted-by":"crossref","unstructured":"Lloyd, J. W.,Foundations of Logic Programming, 2nd Edition, Springer-Verlag, 1987.","DOI":"10.1007\/978-3-642-83189-8"},{"key":"BF03037167_CR11","unstructured":"Lloyd, J. W. and Shepherdson, J. C., \u201cPartial Evaluation in Logic Programming,\u201dTechnical Report, TR-87-09, Department of Computer Science, University of Bristol, 1987 (revised 1989), to appear inJournal of Logic Programming."},{"key":"BF03037167_CR12","unstructured":"Marriott, K. and S\u00f8ndergaard, H., \u201cSemantics-Based Dataflow Analysis of Logic Programs,\u201d inInformation Processing 89 (G. Ritter, ed.), North-Holland, 1989."},{"key":"BF03037167_CR13","doi-asserted-by":"crossref","unstructured":"Mellish, C. S., \u201cAbstract Interpretation of Prolog Programs,\u201dProc. 3rd ICLP, LNCS 225, Springer-Verlag, 1986; also Chapter 8 in 1).","DOI":"10.1007\/3-540-16492-8_95"},{"key":"BF03037167_CR14","unstructured":"Plotkin, G., \u201cA Note on Inductive Generalisation,\u201d inMachine Intelligence, Vol. 5 (B. Meltzer and D. Michie, eds.), Edinburgh University Press, 1974."},{"key":"BF03037167_CR15","unstructured":"Reynolds, J. C., \u201cTransformational Systems and the Algebraic Structure of Atomic Formulas,\u201d inMachine Intelligence, Vol. 5 (B. Meltzer and D. Michie, eds.), Edinburgh University Press, 1974."},{"key":"BF03037167_CR16","unstructured":"Safra, S., \u201cpartial Evaluation of Concurrent Prolog and Its Implications,\u201dMasters thesis, Technical Report, CS86-24, Dept. of Computer Science, Weizmann Institute, 1986."},{"key":"BF03037167_CR17","unstructured":"Sestoft, P., \u201cA Bibliography on Partial Evaluation and Mixed Computation,\u201d inProceedings of Workshop on Partial Evaluation and Mixed Computation, Denmark, Oct. 1987."},{"key":"BF03037167_CR18","doi-asserted-by":"crossref","unstructured":"Tamaki, H. and Sato, T., \u201cOLD Resolution with Tabulation,\u201dProc. 3rd ICLP, LNCS 225, Springer-Verlag, 1986.","DOI":"10.1007\/3-540-16492-8_66"},{"key":"BF03037167_CR19","unstructured":"Winsborough, W., \u201cA Minimal Function Graph Semantics for Logic Programs,\u201dTechnical Report, 711, Computer Sciences Dept., University of Wisconsin-Madison, Aug. 1987."},{"key":"BF03037167_CR20","unstructured":"Winsborough, W., \u201cPath-Dependent Reachability Analysis for Multiple Specialization,Proceedings of the North American Conference on Logic Programming, Cleveland, MIT Press, Oct. 1989."}],"container-title":["New Generation Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03037167.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF03037167\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03037167","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T00:52:31Z","timestamp":1558572751000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF03037167"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,8]]},"references-count":20,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[1991,8]]}},"alternative-id":["BF03037167"],"URL":"https:\/\/doi.org\/10.1007\/bf03037167","relation":{},"ISSN":["0288-3635","1882-7055"],"issn-type":[{"value":"0288-3635","type":"print"},{"value":"1882-7055","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,8]]}}}