Formal Aspects of Computing

, Volume 6, Supplement 1, pp 743–765

Reasoning about Prolog programs: From modes through types to assertions

Article

DOI: 10.1007/BF01213601

Cite this article as:
Apt, K.R. & Marchiori, E. Formal Aspects of Computing (1994) 6(Suppl 1): 743. doi:10.1007/BF01213601

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.

Keywords

Prolog programsProgram verification

Copyright information

© British Computer Society 1994

Authors and Affiliations

  1. 1.Centrum voor Wiskunde and Computer Science (CWI) and Faculty of Mathematics and Computer ScienceUniversity of AmsterdamThe Netherlands
  2. 2.CWIGB AmsterdamThe Netherlands