Pedreschi, Dino and Ruggieri, Salvatore (1997) Verification of Logic Programs. Technical Report del Dipartimento di Informatica . Università di Pisa, Pisa, IT.
Postscript (GZip) - Published Version Available under License Creative Commons Attribution No Derivatives. Download (196Kb) |
Abstract
We propose a proof method in the style of Hoare's logic, aimed at providing a unifying framework for the verification of logic and Prolog programs with respect to their specifications. The method, which relies on purely declarative reasoning, has been designed as a trade-off between expressive power and ease of use. On the basis of a few simple principles, we reason uniformly on several properties of logic and Prolog programs, including partial correctness, total correctness, absence of run-time errors, safe omission of the occur-check, computed answers, modular program development. We finally generalize the method to general programs.
Item Type: | Book |
---|---|
Uncontrolled Keywords: | Verification of logic and Prolog programs, Semantics |
Subjects: | Area01 - Scienze matematiche e informatiche > INF/01 - Informatica |
Divisions: | Dipartimenti (until 2012) > DIPARTIMENTO DI INFORMATICA |
Depositing User: | dott.ssa Sandra Faita |
Date Deposited: | 23 Jan 2015 11:11 |
Last Modified: | 23 Jan 2015 11:11 |
URI: | http://eprints.adm.unipi.it/id/eprint/1971 |
Repository staff only actions
View Item |