School of Computing

Goal-Independent Suspension Analysis for Logic Programs with Dynamic Scheduling

Samir Genaim and Andy King

In Pierpaolo Degano, editor, European Symposium on Programming, volume 2618 of Lecture Notes in Computer Science, pages 182-196. Springer-Verlag, April 2003 Also see http://www.springer.de/comp/lncs/index.html.

Abstract

A goal-independent suspension analysis is presented that infers a class of goals for which a logic program with delays can be executed without suspension. The crucial point is that the analysis does not verify that an (abstract) goal does not lead to suspension but rather it infers (abstract) goals which do not lead to suspension.

Download publication 358 kbytes (PostScript)

Bibtex Record

@inproceedings{1568,
author = {Samir Genaim and Andy King},
title = {Goal-{I}ndependent {S}uspension {A}nalysis for {L}ogic {P}rograms with {D}ynamic {S}cheduling},
month = {April},
year = {2003},
pages = {182-196},
keywords = {determinacy analysis, Craig interpolants},
note = {Also see http://www.springer.de/comp/lncs/index.html},
doi = {},
url = {http://www.cs.kent.ac.uk/pubs/2003/1568},
    publication_type = {inproceedings},
    submission_id = {16124_1042573660},
    booktitle = {European Symposium on Programming},
    editor = {Pierpaolo Degano},
    series = {Lecture Notes in Computer Science},
    publisher = {Springer-Verlag},
    refereed = {yes},
    volume = {2618},
}

School of Computing, University of Kent, Canterbury, Kent, CT2 7NF

Enquiries: +44 (0)1227 824180 or contact us.

Last Updated: 21/03/2014