Abstract
Most program analyses and optimisations face the problem of controlling poly-variance, i.e. deciding in how many ways a single program entity is analysed and/or annotated for optimisation. In the context of logic programming, an analysis creates a number of versions for each original predicate, where each such version corresponds with a particular use or optimisation of the predicate. There is a trade-off between the number of versions (the size of the program) and the optimality of the resulting program.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
A. King and L. Lu. A Backward Analysis for Constraint Logic Programs. Theory and Practice of Logic Programming, 2(4–5):517–547, July–September 2002.
N. Mazur, G. Janssens, and W. Vanhoof. Collecting Potential Optimisations. Report CW 357, Department of Computer Science, K.U.Leuven, Leuven, Belgium, February 2003.
G. Puebla and M. Hermenegildo. Abstract Multiple Specialization and its Application to Program Parallelization. Journal of Logic Programming. Special Issue on Synthesis, Transformation and Analysis of Logic Programs, 41(2&3):279–316, November 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mazur, N., Janssens, G., Vanhoof, W. (2003). Collecting Potential Optimisations. In: Leuschel, M. (eds) Logic Based Program Synthesis and Transformation. LOPSTR 2002. Lecture Notes in Computer Science, vol 2664. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45013-0_9
Download citation
DOI: https://doi.org/10.1007/3-540-45013-0_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40438-5
Online ISBN: 978-3-540-45013-9
eBook Packages: Springer Book Archive