Skip to main content

Forward versus Backward Verification of Logic Programs (appendix for conference submission)

King, Andy, Lu, Lunjin (2003) Forward versus Backward Verification of Logic Programs (appendix for conference submission). University of Kent, School of Computing, University of Kent (KAR id:13989)

Language: English
Download (1MB) Preview
[thumbnail of mycontent.pdf]
This file may not be suitable for users of assistive technology.
Request an accessible format
Official URL


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 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: Research report (external)
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User: Andy King
Date Deposited: 24 Nov 2008 18:01 UTC
Last Modified: 16 Feb 2021 12:24 UTC
Resource URI: (The current URI for this page, for reference purposes)
King, Andy:
  • Depositors only (login required):


Downloads per month over past year