{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,28]],"date-time":"2026-07-28T01:29:44Z","timestamp":1785202184991,"version":"3.55.0"},"reference-count":16,"publisher":"Association for Computing Machinery (ACM)","issue":"Suppl 1","license":[{"start":{"date-parts":[[1994,11,1]],"date-time":"1994-11-01T00:00:00Z","timestamp":783648000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Form. Asp. Comput."],"published-print":{"date-parts":[[1994,11]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>We provide here a systematic comparative study of the relative strength and expressive power of a number of methods for program analysis of Prolog. Among others we show that these methods can be arranged in the following hierarchy: mode analysis \u21d2 type analysis \u21d2 monotonic properties \u21d2 nonmonotonic run-time properties. We also discuss a method allowing us to prove global run-time properties.<\/jats:p>","DOI":"10.1007\/bf01213601","type":"journal-article","created":{"date-parts":[[2005,2,25]],"date-time":"2005-02-25T14:32:57Z","timestamp":1109341977000},"page":"743-765","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":62,"title":["Reasoning about Prolog programs: From modes through types to assertions"],"prefix":"10.1145","volume":"6","author":[{"given":"Krzysztof R.","family":"Apt","sequence":"first","affiliation":[{"name":"Centrum voor Wiskunde and Computer Science (CWI) and Faculty of Mathematics and Computer Science, University of Amsterdam, The Netherlands"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Elena","family":"Marchiori","sequence":"additional","affiliation":[{"name":"CWI, P.O. Box 94079, 1090, GB Amsterdam, The Netherlands"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","reference":[{"key":"e_1_2_1_2_1_2","first-page":"1","volume-title":"Lecture Notes in Computer Science","author":"Apt K. R.","year":"1993"},{"key":"e_1_2_1_2_2_2","doi-asserted-by":"crossref","unstructured":"Apt K. R. and Pellegrini A.: On the occur-check free Prolog programs. ACM Toplas 1994. In press.","DOI":"10.1145\/177492.177673"},{"key":"e_1_2_1_2_3_2","doi-asserted-by":"crossref","unstructured":"Apt K. R.: Logic programming. In J. van Leeuwen editor Handbook of Theoretical Computer Science pp. 493\u2013574. Elsevier 1990. Vol. B.","DOI":"10.1016\/B978-0-444-88074-1.50015-9"},{"key":"e_1_2_1_2_4_2","doi-asserted-by":"crossref","unstructured":"Bossi A. and Cocco N.: Verifying correctness of logic programs. In Proceedings of Tapsoft '89 pp. 96\u2013110 1989.","DOI":"10.1007\/3-540-50940-2_30"},{"key":"e_1_2_1_2_5_2","doi-asserted-by":"crossref","unstructured":"Bossi A. Cocco N. and Fabris M.: Proving termination of logic programs by exploiting term properties. In Proceedings of Tapsoft '91 pp. 153\u2013180 1991.","DOI":"10.1007\/3540539816_66"},{"key":"e_1_2_1_2_6_2","unstructured":"Bronsard F. Lakshman T. K. and Reddy U. S.: A framework of directionality for proving termination of logic programs. In K.R. Apt editor Proc. of the Joint International Conference and Symposium on Logic Programming pp. 321\u2013335. MIT Press 1992."},{"key":"e_1_2_1_2_7_2","unstructured":"Colussi L. and Marchiori E.: Proving correctness of logic programs using axiomatic semantics. In Proceedings of the Eight International Conference on Logic Programming pp. 629\u2013644. The MIT Press 1991."},{"key":"e_1_2_1_2_8_2","unstructured":"Colussi L. and Marchiori E.: Unification as predicate transformer. Submitted 1993. Preliminary version in Proceedings JICSLP' 92 pp. 67\u201385."},{"key":"e_1_2_1_2_9_2","unstructured":"Dembinski P. and Maluszynski J.: AND-parallelism with intelligent backtracking for annotated logic programs. In Proceedings of the International Symposium on Logic Programming pp. 29\u201338 Boston 1985."},{"key":"e_1_2_1_2_10_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(88)90099-0"},{"key":"e_1_2_1_2_11_2","unstructured":"Drabent W.: Do logic programs resemble programs in conventional languages? In Proc. of the Joint International Symposium on Logic Programming pp. 389\u2013396. IEEE Computer Society 1987."},{"key":"e_1_2_1_2_12_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-83189-8"},{"key":"e_1_2_1_2_13_2","unstructured":"Mellish C. S.: The automatic generation of mode declarations for prolog programs. Technical report Department of Artificial Intelligence Univ. of Edinburgh 1981. DAI Research Paper 163."},{"key":"e_1_2_1_2_14_2","unstructured":"Reddy U. S.: Transformation of logic programs into functional programs. In International Symposium on Logic Programming pp. 187\u2013198. IEEE Computer Society 1984."},{"key":"e_1_2_1_2_15_2","doi-asserted-by":"crossref","unstructured":"Reddy U. S.: On the relationship between logic and functional languages. In D. DeGroot and G. Lindstrom editors Functional and Logic Programming pp. 3\u201336. Prentice-Hall 1986.","DOI":"10.1016\/0743-1066(86)90014-2"},{"key":"e_1_2_1_2_16_2","unstructured":"Rosenblueth D. A.: Using program transformation to obtain methods for eliminating backtracking in fixed-mode logic programs. Technical Report 7 Universidad Nacional Autonoma de Mexico Instituto de Investigaciones en Matematicas Aplicadas y en Sistemas 1991."}],"container-title":["Formal Aspects of Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01213601.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01213601\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1007\/BF01213601","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,6]],"date-time":"2022-01-06T15:28:28Z","timestamp":1641482908000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1007\/BF01213601"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,11]]},"references-count":16,"journal-issue":{"issue":"Suppl 1","published-print":{"date-parts":[[1994,11]]}},"alternative-id":["10.1007\/BF01213601"],"URL":"https:\/\/doi.org\/10.1007\/bf01213601","relation":{},"ISSN":["0934-5043","1433-299X"],"issn-type":[{"value":"0934-5043","type":"print"},{"value":"1433-299X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,11]]}}}