Forward versus Backward Verification of Logic Programs: 19th International Conference, ICLP 2003, Mumbai, India, December 9-13, 2003. Proceedings

King, Andy and Lu, Lunjin (2003) Forward versus Backward Verification of Logic Programs: 19th International Conference, ICLP 2003, Mumbai, India, December 9-13, 2003. Proceedings. In: Palamidessi, Catuscia, ed. Logic Programming. Lecture Notes in Computer Science, 2916 . Springer, pp. 315-330. ISBN 978-3-540-20642-2. (doi:https://doi.org/10.1007/978-3-540-24599-5_22) (Full text available)

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.

Item Type: Book section
Subjects: A General Works
Divisions: Faculties > Sciences > School of Computing > Programming Languages and Systems Group
Depositing User: Andy King
Date Deposited: 13 Dec 2013 08:50 UTC
Last Modified: 07 Jul 2015 09:27 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/37611 (The current URI for this page, for reference purposes)
  • Depositors only (login required):

Downloads

Downloads per month over past year