Constraint-based partial evaluation for imperative languages

Authors:
Jin Ying;Jin Chengzhi
Affiliations:
College of Computer Science and Technology, Jilin University, Changchun 130012, P.R. China;College of Computer Science and Technology, Jilin University, Changchun 130012, P.R. China
Venue:
Journal of Computer Science and Technology
Year:
2002

Citing 8
Cited 0

The concept of a supercompiler

ACM Transactions on Programming Languages and Systems (TOPLAS) - The MIT Press scientific computation series
Generalized partial computation for a lazy functional language

PEPM '91 Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Techniques for partial evaluation of imperative languages

PEPM '91 Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Software Specialization Via Symbolic Execution

IEEE Transactions on Software Engineering
Partial evaluation and automatic program generation

Partial evaluation and automatic program generation
Fortran program specialization

ACM SIGPLAN Notices
Generalized Partial Computation using Disunification to Solve Constraints

CTRS '92 Proceedings of the Third International Workshop on Conditional Term Rewriting Systems
Towards Semantics-Based Partial Evaluation of Imperative Programs

Towards Semantics-Based Partial Evaluation of Imperative Programs

Quantified Score

Hi-index	0.00

Visualization

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.