Skip to main content
Springer Nature Link
Log in

Constraint-based partial evaluation for imperative languages

  • Correspondence
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

Constraint-based partial evaluation (CBPE) is a program optimization technique based on partial evaluation (PE) and constraint solving. Conventional PE only utilizes given parameter values to specialize programs. However, CBPE makes use of not only given values but also the following information: (a) the relationship between input parameters and program variables; (b) logical structure of a program to be evaluated. In this paper, a formal description of CBPE method for imperative languages is presented, and some related problems are discussed.

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

Access this article

Log in via an institution

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

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Jones N D, Gomard C K, Sestoft P S. Partial Evaluation and Automatic Program Generation. International Series in Computer Science, Hoare C A R (ed.), ISBN 0-13-020249-5, Prentice Hall International, June, 1993.

  2. Jones N D, Sestoft P S. Self-applicable partial evaluator for experiments in compiler generation.Journal of LISP and Symbolic Computation, 1989, (1): 9–50.

    Article  Google Scholar 

  3. Laura Lafave. A constraint-based partial evaluation for functional logic programs and its application [dissertation]. Bristol University, UK, Oct., 1998.

    Google Scholar 

  4. Kleinrubatscher P, Kriegshaber A, Zöchling R, Glück R. Fortran program specialization.SIGPLAN Notices, 1995, 30(4): 61–70.

    Article  Google Scholar 

  5. Ershov A P. On the Essence of Compilation. InFormal Description of Programming Concepts, Neuhold E J (ed.), Noth-Holland, 1978, pp.391–420.

  6. Uwe Meyer. Techniques for partial evaluation of imperative programs. InProceeding of the Symposium on Partial Evaluation and Semantics-Based Program Manipulation, New Haven, Connecticut, ACM Press, 1991, pp.94–115.

    Google Scholar 

  7. Marquard M, Steensgaard B. Partial Evaluation of an Object-Oriented Imperative Language [thesis]. DIKU, University of Copenhagen, Denmark, April, 1992.

    Google Scholar 

  8. Alberto Coen-Porisini, Flavio De Paoli, Carlo Ghezzi, Dino Mandrioli. Software specialization via symbol execution.IEEE Transactions on Software Engineering, 1991, 17(9): 884–899.

    Article  Google Scholar 

  9. Lars Ole Andersen. Program analysis and specialization for the C programming language [dissertation]. DIKU, University of Copenhagen, Denmark, May, 1994.

    Google Scholar 

  10. Peralta J C, Gallagher J P. Towards semantics-based partial evaluation of imperative programs. Technical Report, CSTR-97-003. Department of Computer Science, University of Bristol, April, 1997.

  11. Turchin V F. The concept of supercompiler.ACM Transaction on Programming Languages and Systems, July, 1986, 8(3): 292–325.

    Article  MATH  MathSciNet  Google Scholar 

  12. Takano A. Generalized partial computation using disunification to solve constraints.LNCS 656, 1992, pp.424–428.

  13. Takano A. Generalized partial computation for a lazy functional language. InProc. ACM Symp. on Partial Evaluation and Semantics-Based Program Manipulation. ACM SIGPLAN Notices, June, 1991, 26(9): 1–11.

  14. Zhao Dongfan, Liu Lei, Song Litong. An efficient method of unfolding loop for partial computation of imperative languages.Computer Research and Development, Jan., 2000, 37(1): 102–108.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Computer Science and Technology, Jilin University, 130012, Changchun, P.R. China

    Ying Jin & Chengzhi Jin

Authors
  1. Ying Jin
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Chengzhi Jin
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Ying Jin.

Additional information

Supported by the National Natural Science Foundation of China (No.60073041).

JIN Ying was born in 1971. She received her B.S. and M.S. degrees in computer science from Jilin University in 1992 and 1995, respectively. She is currently a Ph.D. candidate in the Computer Science Department, Jilin University. Her research interests include semantics of programming languages, formal methodology and program analysis.

JIN Chengzhi is a professor of the Computer Science Department, Jilin University. He has published five books on compilation and program theory. His major research interests include compilation, formal methodology, program theory, automatic generation of software.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Jin, Y., Jin, C. Constraint-based partial evaluation for imperative languages. J. Comput. Sci. & Technol. 17, 64–72 (2002). https://doi.org/10.1007/BF02949826

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02949826

Keywords