A generic framework for the analysis and specialization of logic programs

Authors:
Germán Puebla;Elvira Albert;Manuel Hermenegildo
Affiliations:
School of Computer Science, Technical U. of Madrid;School of Computer Science, Complutense U. of Madrid;School of Computer Science, Technical U. of Madrid
Venue:
ICLP'05 Proceedings of the 21st international conference on Logic Programming
Year:
2005

Citing 8
Cited 1

A practical framework for the abstract interpretation of logic programs

Journal of Logic Programming
Partial evaluation in logic programming

Journal of Logic Programming
Partial evaluation and automatic program generation

Partial evaluation and automatic program generation
Tutorial on specialisation of logic programs

PEPM '93 Proceedings of the 1993 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Incremental analysis of constraint logic programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Optimized Algorithms for Incremental Analysis of Logic Programs

SAS '96 Proceedings of the Third International Symposium on Static Analysis
A framework for the integration of partial evaluation and abstract interpretation of logic programs

ACM Transactions on Programming Languages and Systems (TOPLAS)

The Ecce and Logen partial evaluators and their web interfaces

Proceedings of the 2006 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation

Quantified Score

Hi-index	0.00

Visualization

Abstract

The relationship between abstract interpretation [2] and partial evaluation [5] has received considerable attention and (partial) integrations have been proposed starting from both the partial deduction (see e.g. [6] and its references) and abstract interpretation perspectives. Abstract interpretation-based analyzers (such as the CiaoPP analyzer [9,4]) generally compute a program analysis graph [1] in order to propagate (abstract) call and success information by performing fixpoint computations when needed. On the other hand, partial deduction methods [7] incorporate powerful techniques for on-line specialization including (concrete) call propagation and unfolding.