{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:15:04Z","timestamp":1725560104858},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540221746"},{"type":"electronic","value":"9783540259381"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-25938-1_8","type":"book-chapter","created":{"date-parts":[[2010,7,25]],"date-time":"2010-07-25T12:45:52Z","timestamp":1280061952000},"page":"92-105","source":"Crossref","is-referenced-by-count":4,"title":["A Program Transformation for Backwards Analysis of Logic Programs"],"prefix":"10.1007","author":[{"given":"John P.","family":"Gallagher","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0743-1066(94)90026-4","volume":"19\/20","author":"A. Bossi","year":"1994","unstructured":"Bossi, A., Gabbrielli, M., Levi, G., Martelli, M.: The s-semantics approach: Theory and applications. Journal of Logic Programming\u00a019\/20, 149\u2013197 (1994)","journal-title":"Journal of Logic Programming"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Bancilhon, F., Maier, D., Sagiv, Y., Ullman, J.: Magic sets and other strange ways to implement logic programs. In: Proceedings of the 5th ACM SIGMOD-SIGACT Symposium on Principles of Database Systems (1986)","DOI":"10.1145\/6012.15399"},{"key":"8_CR3","volume-title":"Proceedings of the 1993 International Symposium on Logic Programming","author":"M. Codish","year":"1993","unstructured":"Codish, M., Demoen, B.: Analysing logic programs using \u201cProp\u201d- ositional logic programs and a magic wand. In: Miller, D. (ed.) Proceedings of the 1993 International Symposium on Logic Programming, Vancouver, MIT Press, Cambridge (1993)"},{"key":"8_CR4","unstructured":"Clark, K.: Predicate logic as a computational formalism. Technical Report DOC 79\/59, Imperial College, London, Department of Computing (1979)"},{"issue":"1","key":"8_CR5","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1006\/inco.2000.3024","volume":"169","author":"M. Comini","year":"2001","unstructured":"Comini, M., Levi, G., Meo, M.C.: A theory of observables for logic programs. Information and Computation\u00a0169(1), 23\u201380 (2001)","journal-title":"Information and Computation"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/3-540-36377-7_6","volume-title":"The Essence of Computation","author":"M. Codish","year":"2002","unstructured":"Codish, M., S\u00f8ndergaard, H.: Meta-circular abstract interpretation in prolog. In: Mogensen, T.\u00c6., Schmidt, D.A., Sudborough, I.H. (eds.) The Essence of Computation. LNCS, vol.\u00a02566, pp. 109\u2013134. Springer, Heidelberg (2002)"},{"issue":"1","key":"8_CR7","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/S0743-1066(99)00006-0","volume":"41","author":"M. Codish","year":"1999","unstructured":"Codish, M., Taboch, C.: A semantic basic for the termination analysis of logic programs. The Journal of Logic Programming\u00a041(1), 103\u2013123 (1999)","journal-title":"The Journal of Logic Programming"},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0743-1066(94)90050-7","volume":"18","author":"S. Debray","year":"1994","unstructured":"Debray, S., Ramakrishnan, R.: Abstract Interpretation of Logic Programs Using Magic Transformations. Journal of Logic Programming\u00a018, 149\u2013176 (1994)","journal-title":"Journal of Logic Programming"},{"key":"8_CR9","unstructured":"Gallagher, J., Boulanger, D., Sa\u011flam, H.: Practical model-based static analysis for definite logic programs. In: Lloyd, J.W. (ed.) Proc. of International Logic Programming Symposium, pp. 351\u2013365 (1995)"},{"key":"8_CR10","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1007\/3-540-45653-8_47","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"S. Genaim","year":"2001","unstructured":"Genaim, S., Codish, M.: Inferring termination conditions of logic programs by backwards analysis. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS (LNAI), vol.\u00a02250, pp. 681\u2013690. Springer, Heidelberg (2001)"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Gabbrielli, M., Giacobazzi, R.: Goal independency and call patterns in the analysis of logic programs. In: Proceedings of the 1994 ACM Symposium on Applied Computing, SAC 1994, pp. 394\u2013399 (1994)","DOI":"10.1145\/326619.326789"},{"issue":"4","key":"8_CR12","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1093\/logcom\/6.4.491","volume":"6","author":"M. Gabbrielli","year":"1996","unstructured":"Gabbrielli, M., Levi, G., Meo, M.C.: Resultants semantics for Prolog. Journal of Logic and Computation\u00a06(4), 491\u2013521 (1996)","journal-title":"Journal of Logic and Computation"},{"issue":"5","key":"8_CR13","doi-asserted-by":"publisher","first-page":"1067","DOI":"10.1145\/293677.293680","volume":"20","author":"R. Giacobazzi","year":"1998","unstructured":"Giacobazzi, R., Scozzari, F.: A logical model for relational abstract domains. ACM Transactions on Programming Languages and Systems\u00a020(5), 1067\u20131109 (1998)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"4-5","key":"8_CR14","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1017\/S1471068402001436","volume":"2","author":"A. King","year":"2002","unstructured":"King, A., Lu, L.: A backward analysis for constraint logic programs. Theory and Practice of Logic Programming\u00a02(4-5), 514\u2013547 (2002)","journal-title":"Theory and Practice of Logic Programming"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/978-3-540-24599-5_22","volume-title":"Logic Programming","author":"A. King","year":"2003","unstructured":"King, A., Lu, L.: Forward versus backward verification of logic programs. In: Palamidessi, C. (ed.) ICLP 2003. LNCS, vol.\u00a02916, pp. 315\u2013330. Springer, Heidelberg (2003) (to appear)"},{"key":"8_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-83189-8","volume-title":"Foundations of Logic Programming","author":"J.W. Lloyd","year":"1987","unstructured":"Lloyd, J.W.: Foundations of Logic Programming, 2nd edn. Springer, Heidelberg (1987)","edition":"2"},{"key":"8_CR17","first-page":"7","volume-title":"Joint International Conference and Symposium on Logic Programming","author":"F. Mesnard","year":"1996","unstructured":"Mesnard, F.: Inferring left-terminating classes of queries for constraint logic programs. In: Maher, M.J. (ed.) Joint International Conference and Symposium on Logic Programming, pp. 7\u201321. MIT Press, Cambridge (1996)"},{"key":"8_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/3-540-47764-0_6","volume-title":"Static Analysis","author":"F. Mesnard","year":"2001","unstructured":"Mesnard, F., Neumerkel, U.: Applying static analysis techniques for inferring termination conditions of logic programs. In: Cousot, P. (ed.) SAS 2001. LNCS, vol.\u00a02126, pp. 93\u2013110. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","Logic Based Program Synthesis and Transformation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-25938-1_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:58:58Z","timestamp":1605761938000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-25938-1_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540221746","9783540259381"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-25938-1_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}