ITEM METADATA RECORD
Title: Logic program specialisation: how to be more specific
Authors: Leuschel, Michael ×
De Schreye, Danny #
Issue Date: 1996
Host Document: Programming Languages: Implementations, Logic, and Programs, 8th International Symposium, Lecture Notes in Computer Science 1140 pages:136-151
Conference: the International Symposium on Programming Languages, Implementations, Logics and Programs (PLILP'96) location:Aachen, Germany date:September 24-27, 1996
Abstract: Standard partial deduction suffers from several drawbacks when
compared to top-down abstract interpretation schemes. Conjunctive
partial deduction, an extension of standard partial deduction,
remedies one of those, namely the lack of side-ways information
passing. But two other problems remain: the lack of
success-propagation as well as the lack of inference of global
success-information. We illustrate these drawbacks and show how they
can be remedied by combining conjunctive partial deduction with an
abstract interpretation technique known as more specific program
construction. We present a simple, as well as a more refined
integration of these methods. Finally we illustrate the practical
relevance of this approach for some advanced applications, like
proving functionality or specialising certain meta-programs written in
the ground representation, where it surpasses the precision of current
abstract interpretation techniques.
ISBN: 3-540-61756-6
Publication status: published
KU Leuven publication type: IC
Appears in Collections:Informatics Section
× corresponding author
# (joint) last author

Files in This Item:
File Status SizeFormat
LeDe96_86.pdf Published 237KbAdobe PDFView/Open

 


All items in Lirias are protected by copyright, with all rights reserved.