© University of Kent - Contact | Feedback | Legal | FOI | Cookies
Forward versus Backward Verification of Logic Programs
Andy King and Lunjin Lu
In Catuscia Palamidessi, editor, International Conference on Logic Programming, volume 2916 of Lecture Notes in Computer Science, pages 182-196. Springer-Verlag, December 2003 Also see http://www.springer.de/comp/lncs/index.html.Abstract
One recent development in logic programming has been the application of abstract interpretation to verify the partial correctness of a logic program with respect to a given set of assertions. One approach to verification is to apply forward analysis that starts with an initial goal and traces the execution in the direction of the control-flow to approximate the program state at each program point. This is often enough to verify that the assertions hold. The dual approach is to apply backward analysis to propagate properties of the allowable states against the control-flow to infer queries for which the program will not violate any assertion. This paper is a systematic comparison of these two approaches to verification. The paper reports some equivalence results that relate the relative power of various forward and backward analysis frameworks.
Download publication 337 kbytes (PostScript)Bibtex Record
@inproceedings{1656,
author = {Andy King and Lunjin Lu},
title = {Forward versus {B}ackward {V}erification of {L}ogic {P}rograms},
month = {December},
year = {2003},
pages = {182-196},
keywords = {determinacy analysis, Craig interpolants},
note = {Also see http://www.springer.de/comp/lncs/index.html.},
doi = {},
url = {http://www.cs.kent.ac.uk/pubs/2003/1656},
publication_type = {inproceedings},
submission_id = {14308_1058889116},
booktitle = {International Conference on Logic Programming},
editor = {Catuscia Palamidessi},
series = {Lecture Notes in Computer Science},
publisher = {Springer-Verlag},
refereed = {yes},
volume = {2916},
}