{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:03:24Z","timestamp":1725663804767},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540554608"},{"type":"electronic","value":"9783540470830"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-55460-2_18","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:05:41Z","timestamp":1330250741000},"page":"240-262","source":"Crossref","is-referenced-by-count":1,"title":["On abstracting the procedural behaviour of logic programs"],"prefix":"10.1007","author":[{"given":"G.","family":"Janssens","sequence":"first","affiliation":[]},{"given":"M.","family":"Bruynooghe","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,27]]},"reference":[{"key":"18_CR1","unstructured":"A. Bansal and L. Sterling, \u201cAn abstract interpretation scheme for logic programs based on type expression\u201d pp. 422\u2013429 in Proc. Int. Conf. on Fifth Generation Computer Systems, Tokyo (1988)."},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"M. Bruynooghe, \u201cA practical framework for the abstract interpretation of logic programs\u201d to appear in J.Logic Programming (1990).","DOI":"10.1016\/0743-1066(91)80001-T"},{"key":"18_CR3","unstructured":"M. Bruynooghe and G. Janssens, \u201cAn instance of abstract interpretation integrating type and mode inferencing\u201d pp. 669\u2013683 in Proc. 5th Int. Conf. and Symp. on Logic Programming, Seattle (1988)."},{"key":"18_CR4","unstructured":"M. Bruynooghe, G. Janssens, A. Callebaut, and B. Demoen, \u201cAbstract interpretation: towards the global optimization of Prolog programs\u201d pp. 192\u2013204 in Proc. 4th Symp. on Logic Programming, San Francisco (1987)."},{"key":"18_CR5","unstructured":"M. Codish, D. Dams, and E. Yardeni, Bottom-up abstract interpretation of sequential and concurrent logic programs, draft (June 1990)."},{"key":"18_CR6","unstructured":"A. Colmerauer, \u201cProlog and infinite trees\u201d pp. 231\u2013251 in Logic programming, ed. K.L. Clark and S.-A. T\u00e4rnlund, Academic Press (1982)."},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"P. Cousot and R. Cousot, \u201cAbstract interpretation: A unified lattice model for static analysis of programs by construction of approximation of fixpoints\u201d pp. 238\u2013252 in Proc. 4th ACM POPL Symp. (1977).","DOI":"10.1145\/512950.512973"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"S.K. Debray, \u201cStatic analysis of parallel logic programs\u201d pp. 711\u2013732 in Proc. 5th Int. Conf. and Symp. on Logic Programming, Seattle (1988).","DOI":"10.1016\/0743-1066(88)90010-6"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"S.K. Debray, \u201cEfficient dataflow of logic programs\u201d pp. 260\u2013273 in Proc. 15th Ann. ACM Symp. Principles of Programming Languages, San Diego (1988).","DOI":"10.1145\/73560.73583"},{"key":"18_CR10","volume-title":"Efficient dataflow of logic programs","author":"S. K. Debray","year":"1990","unstructured":"S.K. Debray, Efficient dataflow of logic programs, Draft, Dept. of Computer Science, The university of Arizona, Tucson (1990)."},{"issue":"3","key":"18_CR11","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0743-1066(88)90010-6","volume":"5","author":"S. K. Debray","year":"1988","unstructured":"S.K. Debray and D.S. Warren, \u201cAutomatic mode inference of logic programs\u201d J.Logic Programming, Vol. 5 (3), pp. 207\u2013229 (1988).","journal-title":"J.Logic Programming"},{"key":"18_CR12","unstructured":"J. Gallagher and M. Bruynooghe, \u201cThe derivation of an algorithm for program specialisation\u201d pp. 732\u2013746 in Proc. 7th Int. Conf. on Logic Programming, Jerusalem (1990)."},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"N. Heintze and J. Jaffar, \u201cA finite presentation theorem for approximating logic programs\u201d in Proc. 17th Ann. ACM Symp. Principles of Programming Languages, San Francisco (1990).","DOI":"10.1145\/96709.96729"},{"key":"18_CR14","unstructured":"D. Jacobs and A. Langen, \u201cAccurate and efficient approximation of variable aliasing in logic programs\u201d pp. 154\u2013165 in North American Conference on Logic Programming (1989)."},{"key":"18_CR15","unstructured":"G. Janssens and M. Bruynooghe, \u201cDeriving descriptions of possible values of program variables by means of abstract interpretation\u201d to appear in J.Logic Programming."},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"N. Jones and A. Mycroft, \u201cData flow analysis of applicative programs using minimal function graphs: abridged version\u201d pp. 296\u2013306 in Conference record of the 13th Ann. ACM Symposium on Principles of Programming Languages, New York (1986).","DOI":"10.1145\/512644.512672"},{"key":"18_CR17","unstructured":"N. Jones and H. Sondergaard, \u201cA semantics-based framework for the abstract interpretation of Prolog\u201d pp. 123\u2013142 in Abstract interpretation of declarative languages, ed. C. Hankin, Ellis Horwood (1987)."},{"key":"18_CR18","unstructured":"T. Kanamori and T. Kawamura, Analyzing success patterns of logic programs by abstract hybrid interpretation, ICOT Technical Report, TR. 279 (1987)."},{"key":"18_CR19","doi-asserted-by":"crossref","unstructured":"J.W. Lloyd, Foundations of Logic Programming, Springer Series Symbolic Computation \u2014 Artificial Intelligence (1987).","DOI":"10.1007\/978-3-642-83189-8"},{"key":"18_CR20","unstructured":"H. Mannila and E. Ukkonen, \u201cFlow analysis of Prolog programs\u201d pp. 205\u2013214 in Proc. 4th Symp. on Logic Programming, San Francisco (1987)."},{"key":"18_CR21","unstructured":"A. Mari\u00ebn, G. Janssens, A. Mulkers, and M. Bruynooghe, \u201cThe impact of abstract interpretation on code generation: an experiment in efficiency\u201d pp. 33\u201347 in Proc. 6th Int. Conf. on Logic Programming, Lisbon (1989)."},{"key":"18_CR22","unstructured":"K. Marriot and H. Sondergaard, \u201cBottom-up abstract interpretation of logic programs\u201d pp. 733\u2013748 in Proc. 5th Int. Conf. and Symp. on Logic Programming, Seattle (1988)."},{"key":"18_CR23","unstructured":"K. Marriot, H. Sondergaard, and N. Jones, Denotational abstract interpretation of logic programs, draft (1990)."},{"key":"18_CR24","doi-asserted-by":"crossref","unstructured":"C.S. Mellish, \u201cAbstract interpretation of Prolog programs\u201d pp. 463\u2013474 in Proc. 3th Int. Conf. on Logic Programming, London (1986), revised pp. 181\u2013198 in Abstract Interpretation of Declarative Languages, eds. S. Abramsky and C. Hankin, Ellis Horwood (1987).","DOI":"10.1007\/3-540-16492-8_95"},{"key":"18_CR25","unstructured":"A. Mulkers, W. Winsborough, and M. Bruynooghe, \u201cAnalysis of shared data structures for compile-time garbage collection in logic programs\u201d pp. 747\u2013762 in Proc. 7th Int. Conf. on Logic Programming, Jerusalem (1990)."},{"key":"18_CR26","unstructured":"A. Mulkers, W. Winsborough, and M. Bruynooghe, Analysis of shared data structures for compile-time garbage collection in logic programs (Extended version), Report CW117, Department of Computer Science, Katholieke Universiteit Leuven (1990)."},{"key":"18_CR27","unstructured":"K. Muthukumar and M. Hermenegildo, \u201cDetermination of variable dependence information at compile time through abstract interpretation\u201d pp. 166\u2013185 in North American Conference on Logic Programming (1989)."},{"key":"18_CR28","unstructured":"D.H.D. Warren, Implementing Prolog \u2014 compiling predicate logic programs, DAI research reports 39 40, Dept. of Artificial Intelligence, University of Edinburg (1977)."},{"key":"18_CR29","unstructured":"D.H.D. Warren, An abstract Prolog instruction set, Technical Report, SRI international, Artificial intelligence center (1983)."},{"key":"18_CR30","unstructured":"W. Winsborough, Multiple specialization using minimal-function graph semantics, Department of Computer Science, The Pennsylvania State University, to appear in J.Logic Programming."},{"key":"18_CR31","unstructured":"W. Winsborough, \u201cPath-dependent reachability analysis for multiple specialization\u201d pp. 133\u2013153 in North American Conference on Logic Programming, Cleveland (1989)."}],"container-title":["Lecture Notes in Computer Science","Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-55460-2_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T04:21:42Z","timestamp":1640924502000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-55460-2_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540554608","9783540470830"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/3-540-55460-2_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}