King, Andy and Lu, Lunjin (2003) Forward versus Backward Verification of Logic Programs. In: Palamidessi, Catuscia, ed. Logic Programming. Lecture Notes in Computer Science, 2916. Springer-Verlag pp. 315-330. ISBN 3-540-20642-6 .
|The full text of this publication is not available from this repository. (Contact us about this Publication)|
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:||Conference or workshop item (UNSPECIFIED)|
|Additional information:||Also see http://www.springer.de/comp/lncs/index.html.|
|Subjects:||Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,|
|Divisions:||Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group|
|Depositing User:||Mark Wheadon|
|Date Deposited:||24 Nov 2008 18:00|
|Last Modified:||20 May 2011 23:35|
|Resource URI:||http://kar.kent.ac.uk/id/eprint/13863 (The current URI for this page, for reference purposes)|
- Depositors only (login required):