Formal Aspects of Computing

, Volume 6, Supplement 1, pp 743-765

First online:

Reasoning about Prolog programs: From modes through types to assertions

  • Krzysztof R. AptAffiliated withCentrum voor Wiskunde and Computer Science (CWI) and Faculty of Mathematics and Computer Science, University of Amsterdam
  • , Elena MarchioriAffiliated withCWI Email author 

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


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.


Prolog programs Program verification