Determinacy Inference by Suspension Inference

King, Andy and Lu, L. and Genaim, S. (2005) Determinacy Inference by Suspension Inference. Technical report. , University of Kent

PDF
Download (183Kb)	Preview

Abstract

The aim of determinacy inference is to infer a class of calls to a given logic program, for which execution will generate at most one answer and generate the answer only once. Two serious impediments to accurate determinacy inference are: (1) the way bindings imposed by a rightmost goal can make a leftmost goal deterministic; (2) the way determinacy is often enforced with cut. Rather surprisingly, this paper shows how: problem (1) can be tackled by recasting determinacy inference as a problem in concurrency; problem (2) can be addressed within this concurrency framework. Experimental evaluation shows that the new analysis can infer richer classes of deterministic calls for many programs.

Item Type:	Monograph (Technical report)
Uncontrolled keywords:	abstract interpretation, backwards analysis
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:	08 Jun 2012 14:55
Resource URI:	http://kar.kent.ac.uk/id/eprint/14247 (The current URI for this page, for reference purposes)

• Depositors only (login required):