Specialization of imperative programs through analysis of relational expressions

  • Alexander Sakharov
Conference paper

DOI: 10.1007/3-540-61580-6_21

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1110)
Cite this paper as:
Sakharov A. (1996) Specialization of imperative programs through analysis of relational expressions. In: Danvy O., Glück R., Thiemann P. (eds) Partial Evaluation. Lecture Notes in Computer Science, vol 1110. Springer, Berlin, Heidelberg

Abstract

An inter-procedural data flow analysis operating on control flow graphs and collecting information about program expressions is described in this paper. The following relational and other expressions are analyzed: equivalences between program expressions and constants; linear-ordering inequalities between program expressions and constants; equalities originating from some program assignments; atomic constituents of controlling expressions of program branches. Analysis is executed by a worklist-based fixpoint algorithm which interprets conditional branches and incorporates a rule-based inference procedure. Two variants of the polyvariant program point specialization using results of the analysis are presented. The both specializations are done at the level of control flow graphs. The variants differ in terms of the size of residual programs.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1996

Authors and Affiliations

  • Alexander Sakharov
    • 1
  1. 1.MotorolaArlington HeightsUSA

Personalised recommendations