skip to main content
research-article
Open Access

Reasoning about Prolog programs: From modes through types to assertions

Authors Info & Claims
Published:01 November 1994Publication History
Skip Abstract Section

Abstract

Abstract

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 ⇒ type analysis ⇒ monotonic properties ⇒ nonmonotonic run-time properties. We also discuss a method allowing us to prove global run-time properties.

References

  1. [ApE93] Apt K. R.Etalle S.Borzyszkowski A.Sokolowski S.On the unification free Prolog programsLecture Notes in Computer Science1993BerlinSpringer London119Google ScholarGoogle Scholar
  2. [ApP94] Apt, K. R. and Pellegrini, A.: On the occur-check free Prolog programs.ACM Toplas, 1994. In press.Google ScholarGoogle Scholar
  3. [Apt90] Apt, K. R.: Logic programming. In J. van Leeuwen, editor,Handbook of Theoretical Computer Science, pp. 493–574. Elsevier, 1990. Vol. B.Google ScholarGoogle Scholar
  4. [BoC89] Bossi, A. and Cocco, N.: Verifying correctness of logic programs. InProceedings of Tapsoft '89, pp. 96–110, 1989.Google ScholarGoogle Scholar
  5. [BCF91] Bossi, A., Cocco, N. and Fabris, M.: Proving termination of logic programs by exploiting term properties. InProceedings of Tapsoft '91, pp. 153–180, 1991.Google ScholarGoogle Scholar
  6. [BLR92] 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–335. MIT Press, 1992.Google ScholarGoogle Scholar
  7. [CoM91] Colussi, L. and Marchiori, E.: Proving correctness of logic programs using axiomatic semantics. InProceedings of the Eight International Conference on Logic Programming, pp. 629–644. The MIT Press, 1991.Google ScholarGoogle Scholar
  8. [CoM93] Colussi, L. and Marchiori, E.: Unification as predicate transformer. Submitted, 1993. Preliminary version inProceedings JICSLP' 92, pp. 67–85.Google ScholarGoogle Scholar
  9. [DeM85] Dembinski, P. and Maluszynski, J.: AND-parallelism with intelligent backtracking for annotated logic programs. InProceedings of the International Symposium on Logic Programming, pp. 29–38, Boston, 1985.Google ScholarGoogle Scholar
  10. [DrM88] Drabent W.Maluszynski J.Inductive assertion method for logic programsTheoretical Computer Science198859113315510.1016/0304-3975(88)90099-00648.68019968904Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. [Dra87] Drabent, W.: Do logic programs resemble programs in conventional languages? InProc. of the Joint International Symposium on Logic Programming, pp. 389–396. IEEE Computer Society, 1987.Google ScholarGoogle Scholar
  12. [Llo87] Lloyd J. W.Foundations of Logic Programming1987second editionBerlinSpringer London10.1007/978-3-642-83189-80668.68004Google ScholarGoogle ScholarCross RefCross Ref
  13. [Mel81] 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.Google ScholarGoogle Scholar
  14. [Red84] Reddy, U. S.: Transformation of logic programs into functional programs. InInternational Symposium on Logic Programming, pp. 187–198. IEEE Computer Society, 1984.Google ScholarGoogle Scholar
  15. [Red86] Reddy, U. S.: On the relationship between logic and functional languages. In D. DeGroot and G. Lindstrom, editors,Functional and Logic Programming, pp. 3–36. Prentice-Hall, 1986.Google ScholarGoogle Scholar
  16. [Ros91] 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.Google ScholarGoogle Scholar

Index Terms

  1. Reasoning about Prolog programs: From modes through types to assertions
          Index terms have been assigned to the content through auto-classification.

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in

          Full Access

          • Published in

            cover image Formal Aspects of Computing
            Formal Aspects of Computing  Volume 6, Issue Suppl 1
            Nov 1994
            108 pages
            ISSN:0934-5043
            EISSN:1433-299X
            Issue’s Table of Contents

            © British Computer Society 1994

            Publisher

            Springer-Verlag

            Berlin, Heidelberg

            Publication History

            • Published: 1 November 1994
            • Accepted: 15 September 1994
            • Received: 15 July 1993
            Published in fac Volume 6, Issue Suppl 1

            Qualifiers

            • research-article

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader