Reasoning about prolog programs: From modes through types to assertions

DOI10.1007/BF01213601zbMath0816.68046WikidataQ56059067 ScholiaQ56059067MaRDI QIDQ1346766

Krzysztof R. Apt, Elena Marchiori

Publication date: 9 April 1995

Published in: Formal Aspects of Computing (Search for Journal in Brave)

zbMATH Keywords

program analysisProlog

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Logic programming (68N17)

Related Items (6)

A logical semantics for depth-first Prolog with ground negation ⋮ Design of abstract domains using first-order logic ⋮ A simple correctness proof for magic transformation ⋮ Modules and specifications ⋮ On the verification of finite failure ⋮ Automated modular termination proofs for real Prolog programs

Cites Work

• Inductive assertion method for logic pograms
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Reasoning about prolog programs: From modes through types to assertions