1994/11/01 by Krzysztof R. Apt, Elena Marchiori · 1 citation
Computer Science · #Logic, programming, and type systems #Formal Methods in Verification #Logic, Reasoning, and Knowledge
paper · doi:10.1007/bf01213601
openalex publication_date 1994/11/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/23
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.