Skip to main content

Trace Analysis for Predicting the Effectiveness of Partial Evaluation

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 5366))

Abstract

The main goal of partial evaluation [1] is program specialization. Essentially, given a program and part of its input data|the so called static data|a partial evaluator returns a new, residual program which is specialized for the given data. An appropriate residual program for executing the remaining computations|those that depend on the so called dynamic data|is thus the output of the partial evaluator. Despite the fact that the main goal of partial evaluation is improving program efficiency (i.e., producing faster programs), there are very few approaches devoted to formally analyze the effects of partial evaluation, either a priori (prediction) or a posteriori. Recent approaches (e.g., [2,3]) have considered experimental frameworks for estimating the best division (roughly speaking, a classification of program parameters into static or dynamic), so that the optimal choice is followed when specializing the source program.

This work is partially supported by the EU (FEDER) and the Spanish Ministry MEC/MICINN under grants TIN2005-09207-C03-02, TIN2008-06622-C03-02, and Acción Integrada HA2006-0008.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Jones, N.D., Gomard, C.K., Sestoft, P.: Partial Evaluation and Automatic Program Generation. Prentice-Hall, Englewood Cliffs (1993)

    MATH  Google Scholar 

  2. Craig, S.-J., Leuschel, M.: Self-tuning resource aware specialisation for Prolog. In: Barahona, P., Felty, A.P. (eds.) PPDP, pp. 23–34. ACM, New York (2005)

    Google Scholar 

  3. Ochoa, C., Puebla, G.: Poly-controlled partial evaluation in practice. In: Ramalingam, G., Visser, E. (eds.) PEPM, pp. 164–173. ACM, New York (2007)

    Chapter  Google Scholar 

  4. Vidal, G.: Predicting the Speedup of Partial Evaluation. Technical report, DSIC, UPV (2008), http://www.dsic.upv.es/~gvidal/german/papers.html

  5. Mohri, M., Nederhof, M.-J.: Regular Approximation of Context-Free Grammars through Transformation, ch. 9, pp. 153–163. Kluwer Academic Publishers, The Netherlands (2001)

    MATH  Google Scholar 

  6. Gallagher, J.P., Lafave, L.: Regular approximation of computation paths in logic and functional languages. In: Danvy, O., Glück, R., Thiemann, P. (eds.) Dagstuhl Seminar 1996. LNCS, vol. 1110, pp. 115–136. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Vidal, G. (2008). Trace Analysis for Predicting the Effectiveness of Partial Evaluation. In: Garcia de la Banda, M., Pontelli, E. (eds) Logic Programming. ICLP 2008. Lecture Notes in Computer Science, vol 5366. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89982-2_78

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-89982-2_78

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-89981-5

  • Online ISBN: 978-3-540-89982-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics