Skip to main content

Design of Syntactic Program Transformations by Abstract Interpretation of Semantic Transformations

  • Conference paper
  • First Online:
Logic Programming (ICLP 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2237))

Included in the following conference series:

  • 234 Accesses

Abstract

Traditionally, static program analysis has been used for offline program transformation i.e. an abstraction of the subject program semantics is used to determine which syntactic transformations are applicable. A classical example is binding-time analysis before partial evaluation [4],[5].

This work was supported in part by the european FP5 project IST-1999-20527 Daedalus.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. P. Cousot and R. Cousot. Systematic design of program analysis frameworks. In 6 th POPL, pages 269–282, San Antonio, TX, 1979. ACM Press.

    Google Scholar 

  2. P. Cousot and R. Cousot. Abstract interpretation frameworks. J. Logic and Comp., 2(4):511–547, Aug. 1992.

    Article  MATH  MathSciNet  Google Scholar 

  3. P. Cousot and R. Cousot. A case study in abstract interpretation based program transformation: Blocking command elimination. ENTCS, 45, 2001. http://www.elsevier.nl/locate/entcs/volume45.html, 23 pages.

    Google Scholar 

  4. N. Jones, C.K. Gomard, and P. Sestoft. Partial Evaluation and Automatic Program Generation. Int. Series in Computer Science. Prentice-Hall, June 1993.

    Google Scholar 

  5. N.D. Jones. An introduction to partial evaluation. ACM Comput. Surv., 28(3):480–504, Sep. 1996.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cousot, P. (2001). Design of Syntactic Program Transformations by Abstract Interpretation of Semantic Transformations. In: Codognet, P. (eds) Logic Programming. ICLP 2001. Lecture Notes in Computer Science, vol 2237. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45635-X_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-45635-X_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42935-7

  • Online ISBN: 978-3-540-45635-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy