Lu, Lunjin and King, Andy (2004) Backward Pair Sharing Analysis. In: UNSPECIFIED, Apr 07-Jul 09, 2004, Nara, Japan .
| Postscript | ||
|
Download (331Kb)
|
![[img]](http://kar.kent.ac.uk/style/images/fileicons/application_postscript.png)
|
|
|
Download (250Kb)
|
![[img]](http://kar.kent.ac.uk/style/images/fileicons/application_pdf.png)
|
|
Abstract
This paper presents a backward sharing analysis for logic programs. The analysis computes pre-conditions for a query that guarantee a given post-condition is satisfied after the query is successfully executed. The analysis uses a pair sharing domain and is capable of inferring pre-conditions that ensure the absence of sharing. This, in turn, has many applications in logic programming. The work is unique in that it demonstrates that backward analysis is applicable even for properties that are not closed under instantiation.
| Item Type: | Conference or workshop item (UNSPECIFIED) |
|---|---|
| Additional information: | Also see http://www.springer.de/comp/lncs/index.html |
| Uncontrolled keywords: | Abstract interpretation; backward analysis; logic programming |
| 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:02 |
| Last Modified: | 06 Sep 2011 01:25 |
| Resource URI: | http://kar.kent.ac.uk/id/eprint/14177 (The current URI for this page, for reference purposes) |
- Depositors only (login required):
