{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:34:25Z","timestamp":1725561265365},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540206422"},{"type":"electronic","value":"9783540245995"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-24599-5_22","type":"book-chapter","created":{"date-parts":[[2010,7,29]],"date-time":"2010-07-29T08:53:55Z","timestamp":1280393635000},"page":"315-330","source":"Crossref","is-referenced-by-count":9,"title":["Forward versus Backward Verification of Logic Programs"],"prefix":"10.1007","author":[{"given":"Andy","family":"King","sequence":"first","affiliation":[]},{"given":"Lunjin","family":"Lu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/3-540-58485-4_32","volume-title":"Static Analysis","author":"A. Aiken","year":"1994","unstructured":"Aiken, A., Lakshman, T.K.: Directional Type Checking of Logic Programs. In: LeCharlier, B. (ed.) SAS 1994. LNCS, vol.\u00a0864, pp. 43\u201360. Springer, Heidelberg (1994)"},{"key":"22_CR2","unstructured":"Birkhoff, G.: Lattice Theory. AMS Press (1967)"},{"issue":"1,2,3,4","key":"22_CR3","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0743-1066(91)80001-T","volume":"10","author":"M. Bruynooghe","year":"1991","unstructured":"Bruynooghe, M.: A Practical Framework for the Abstract Interpretation of Logic Programs. The Journal of Logic Programming\u00a010(1,2,3,4), 91\u2013124 (1991)","journal-title":"The Journal of Logic Programming"},{"key":"22_CR4","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/S0304-3975(98)00122-4","volume":"238","author":"M. Codish","year":"2000","unstructured":"Codish, M., Lagoon, V.: Type Dependencies for Logic Programs using ACIunification. Theoretical Computer Science\u00a0238, 131\u2013159 (2000)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"22_CR5","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 Basis 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":"22_CR6","doi-asserted-by":"crossref","unstructured":"Comini, M., Gori, R., Levi, G., Volpe, P.: Abstract Interpretation based Verification of Logic Programs. Electronic Notes of Theoretical Computer Science, vol.\u00a030(1) (1999)","DOI":"10.1016\/S1571-0661(04)00112-4"},{"issue":"2-3","key":"22_CR7","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/0743-1066(92)90030-7","volume":"13","author":"P. Cousot","year":"1992","unstructured":"Cousot, P., Cousot, R.: Abstract Interpretation and Application to Logic Programs. The Journal of Logic Programming\u00a013(2-3), 103\u2013179 (1992)","journal-title":"The Journal of Logic Programming"},{"issue":"1","key":"22_CR8","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0304-3975(88)90099-0","volume":"59","author":"W. Drabent","year":"1988","unstructured":"Drabent, W., Maluszy\u0144ski, J.: Inductive Assertion Method for Logic Programs. Theoretical Computer Science\u00a059(1), 133\u2013155 (1988)","journal-title":"Theoretical Computer Science"},{"key":"22_CR9","first-page":"37","volume-title":"Principles of Programming Languages","author":"E. Duesterwald","year":"1995","unstructured":"Duesterwald, E., Gupta, R., Soffa, M.L.: Demand-driven Computation of Interprocedural Data Flow. In: Principles of Programming Languages, pp. 37\u201348. ACM, New York (1995)"},{"issue":"2-3","key":"22_CR10","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/S0167-6423(99)00009-X","volume":"35","author":"C. Fecht","year":"1999","unstructured":"Fecht, C., Seidl, H.: A Faster Solver for General Systems of Equations. Science of Computer Programming\u00a035(2-3), 137\u2013162 (1999)","journal-title":"Science of Computer Programming"},{"issue":"1","key":"22_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0743-1066(97)10002-4","volume":"35","author":"M. Garc\u00eda de la Banda","year":"1998","unstructured":"Garc\u00eda de la Banda, M., Marriott, K., Stuckey, P.J., S\u00f8ndergaard, H.: Differential Methods in Logic Program Analysis. The Journal of Logic Programming\u00a035(1), 1\u201337 (1998)","journal-title":"The Journal of Logic Programming"},{"key":"22_CR12","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 for Logic Programs using Backwards Analysis. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS (LNAI), vol.\u00a02250, pp. 681\u2013690. Springer, Heidelberg (2001); Technical report version available at http:\/\/www.cs.bgu.ac.il\/~mcodish\/Papers\/Pages\/lpar01.html"},{"issue":"5","key":"22_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":"2","key":"22_CR14","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1145\/349214.349216","volume":"22","author":"M. Hermenegildo","year":"2000","unstructured":"Hermenegildo, M., Puebla, G., Marriott, K., Stuckey, P.: Incremental analysis of constraint logic programs. ACM Transactions on Programming Languages and Systems\u00a022(2), 187\u2013223 (2000)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"3","key":"22_CR15","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/0167-6423(94)00008-5","volume":"22","author":"R.J.M. Hughes","year":"1994","unstructured":"Hughes, R.J.M., Launchbury, J.: Reversing Abstract Interpretations. Science of Computer Programming\u00a022(3), 307\u2013326 (1994)","journal-title":"Science of Computer Programming"},{"issue":"1\/2\/3&4","key":"22_CR16","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0743-1066(92)90034-Z","volume":"13","author":"D. Jacobs","year":"1992","unstructured":"Jacobs, D., Langen, A.: Static Analysis of Logic Programs for Independent And-Parallelism. The Journal of Logic Programming\u00a013(1\/2\/3&4), 291\u2013314 (1992)","journal-title":"The Journal of Logic Programming"},{"issue":"4-5","key":"22_CR17","doi-asserted-by":"publisher","first-page":"517","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), 517\u2013547 (2002)","journal-title":"Theory and Practice of Logic Programming"},{"key":"22_CR18","doi-asserted-by":"crossref","unstructured":"King, A., Lu, L.: Forward versus Backward Verification of Logic Programs. Technical Report 5-03, Computing Laboratory, University of Kent (April 2003)","DOI":"10.1007\/978-3-540-24599-5_22"},{"key":"22_CR19","unstructured":"Langen, A.: Advanced Techniques for Approximating Variable Aliasing in Logic Programs. PhD thesis, Computer Science Department, University of Southern California, Los Angeles (1991)"},{"issue":"1-3","key":"22_CR20","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0743-1066(98)10032-8","volume":"39","author":"B. Charlier Le","year":"1999","unstructured":"Le Charlier, B., Lecl\u00e9re, C., Rossi, S., Cortesi, A.: Automatic Verification of Prolog Programs. The Journal of Logic Programming\u00a039(1-3), 3\u201342 (1999)","journal-title":"The Journal of Logic Programming"},{"issue":"1","key":"22_CR21","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1145\/174625.174627","volume":"16","author":"B. Charlier Le","year":"1994","unstructured":"Le Charlier, B., Van Hentenryck, P.: Experimental Evaluation of a Generic Abstract Interpretation Algorithm for Prolog. ACM Transactions on Programming\u00a016(1), 35\u2013101 (1994)","journal-title":"ACM Transactions on Programming"},{"key":"22_CR22","doi-asserted-by":"crossref","first-page":"63","DOI":"10.7551\/mitpress\/4299.003.0011","volume-title":"International Conference on Logic Programming","author":"N. Lindenstrauss","year":"1997","unstructured":"Lindenstrauss, N., Sagiv, Y.: Automatic Termination Analysis of Logic Programs. In: International Conference on Logic Programming, pp. 63\u201377. MIT Press, Cambridge (1997)"},{"key":"22_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/3-540-45789-5_9","volume-title":"Static Analysis","author":"L. Lu","year":"2002","unstructured":"Lu, L., King, A.: Backward Type Inference Generalises Type Checking. In: Hermenegildo, M.V., Puebla, G. (eds.) SAS 2002. LNCS, vol.\u00a02477, pp. 85\u2013101. Springer, Heidelberg (2002)"},{"issue":"2","key":"22_CR24","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1145\/635499.635503","volume":"4","author":"F. Mesnard","year":"2003","unstructured":"Mesnard, F., Ruggieri, S.: On Proving Left Termination of Constraint Logic Programs. ACM Transactions on Computational Logic\u00a04(2), 207\u2013259 (2003)","journal-title":"ACM Transactions on Computational Logic"},{"key":"22_CR25","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1109\/WCRE.2001.957836","volume-title":"Eighth Working Conference on Reverse Engineering","author":"A. Min\u00e9","year":"2001","unstructured":"Min\u00e9, A.: The Octagon Abstract Domain. In: Eighth Working Conference on Reverse Engineering, pp. 310\u2013319. IEEE Computer Society Press, Los Alamitos (2001)"},{"key":"22_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/10722311_2","volume-title":"Analysis and Visualization Tools for Constraint Programming","author":"G. Puebla","year":"2000","unstructured":"Puebla, G., Bueno, F., Hermenegildo, M.: An Assertion Language for Constraint Logic Programs. In: Deransart, P., Ma\u0142uszy\u0144ski, J. (eds.) DiSCiPl 1999. LNCS, vol.\u00a01870, pp. 23\u201361. Springer, Heidelberg (2000)"},{"key":"22_CR27","unstructured":"Schachte, P.: Precise and Efficient Static Analysis of Logic Programs. PhD thesis, Department of Computer Science, University of Melbourne (1999)"},{"issue":"3","key":"22_CR28","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1016\/S0304-3975(02)00614-X","volume":"293","author":"P. Schachte","year":"2003","unstructured":"Schachte, P.: Precise Goal-independent Abstract Interpretation of Constraint Logic Programs. Theoretical Computer Science\u00a0293(3), 557\u2013577 (2003)","journal-title":"Theoretical Computer Science"},{"key":"22_CR29","volume-title":"Logic and Structure","author":"D. Dalen van","year":"1997","unstructured":"van Dalen, D.: Logic and Structure. Springer, Heidelberg (1997)"},{"issue":"1","key":"22_CR30","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0167-6423(00)00017-4","volume":"39","author":"P. Volpe","year":"2001","unstructured":"Volpe, P.: A First-Order Language for Expressing Aliasing and Type Properties of Logic Programs. Science of Computer Programming\u00a039(1), 125\u2013148 (2001)","journal-title":"Science of Computer Programming"}],"container-title":["Lecture Notes in Computer Science","Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24599-5_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,28]],"date-time":"2024-03-28T21:50:52Z","timestamp":1711662652000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24599-5_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540206422","9783540245995"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24599-5_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}