The University of Southampton
University of Southampton Institutional Repository

Fully Automatic Binding Time Analysis for Prolog

Fully Automatic Binding Time Analysis for Prolog
Fully Automatic Binding Time Analysis for Prolog
Offline partial evaluation techniques rely on an annotated version of the source program to control the specialisation process. These annotations guide the specialisation and have to ensure termination of the partial evaluation. We present an algorithm for generating these annotations automatically. The algorithm uses state-of-the-art termination analysis techniques, combined with a new type-based abstract interpretation for propagating the binding types. This algorithm has been implemented as part of the Logen partial evaluation system, and we report on performance of the algorithm on a series of benchmarks.
Partial Evaluation, BTA, Abstract Interpretation, Termination Analysis, Logic Programming, Prolog
3-540-26655-0
53-68
Springer Verlag
Craig, Stephen-John
70e3474a-2043-482f-9e1c-27f68e9aba16
Gallagher, John
78debb3b-1eaf-41a1-8140-722433d86313
Leuschel, Michael
c2c18572-66cf-4f84-ade4-218ce3afe78b
Henriksen, Kim S.
be8d4116-0d8e-4665-a0f5-e37305b64b0f
Etalle, Sandro
Craig, Stephen-John
70e3474a-2043-482f-9e1c-27f68e9aba16
Gallagher, John
78debb3b-1eaf-41a1-8140-722433d86313
Leuschel, Michael
c2c18572-66cf-4f84-ade4-218ce3afe78b
Henriksen, Kim S.
be8d4116-0d8e-4665-a0f5-e37305b64b0f
Etalle, Sandro

Craig, Stephen-John, Gallagher, John, Leuschel, Michael and Henriksen, Kim S. (2004) Fully Automatic Binding Time Analysis for Prolog. Etalle, Sandro (ed.) In Logic Based Program Synthesis and Transformation: 14th International Symposium, LOPSTR 2004. Springer Verlag. pp. 53-68 .

Record type: Conference or Workshop Item (Paper)

Abstract

Offline partial evaluation techniques rely on an annotated version of the source program to control the specialisation process. These annotations guide the specialisation and have to ensure termination of the partial evaluation. We present an algorithm for generating these annotations automatically. The algorithm uses state-of-the-art termination analysis techniques, combined with a new type-based abstract interpretation for propagating the binding types. This algorithm has been implemented as part of the Logen partial evaluation system, and we report on performance of the algorithm on a series of benchmarks.

Text
bta_final.pdf - Other
Download (352kB)
Text
bta_pre.pdf - Other
Download (304kB)

More information

Published date: 2004
Additional Information: Event Dates: August 2004
Venue - Dates: Lopstr'04 (Pre-proceedings), Verona, Italy, 2004-07-31
Keywords: Partial Evaluation, BTA, Abstract Interpretation, Termination Analysis, Logic Programming, Prolog
Organisations: Electronics & Computer Science

Identifiers

Local EPrints ID: 259546
URI: http://eprints.soton.ac.uk/id/eprint/259546
ISBN: 3-540-26655-0
PURE UUID: d7abeae7-c1e4-433b-b985-92063e68f8bf

Catalogue record

Date deposited: 28 Jul 2004
Last modified: 23 Sep 2020 16:33

Export record

Contributors

Author: Stephen-John Craig
Author: John Gallagher
Author: Michael Leuschel
Author: Kim S. Henriksen
Editor: Sandro Etalle

University divisions

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×