Abstract

In this paper we present a new approach for incremental data flow analysis based on elimination methods. Unlike previous elimination-based incremental data flow analysis, our approach can handle arbitrary non-structural and structural changes to program flowgraphs, including irreducibility. We use properties of dominance frontiers and iterated dominance frontiers for updating data flow solutions. These properties are applicable to both reducible and irreducible flowgraphs. Since we use properties of dominance frontiers (and iterated dominance frontiers) we also give a simple algorithm for updating the dominance frontier relation. The dominance frontier update algorithm is based on our previous work for updating dominator trees. i Contents 1 Introduction 1 2 Exhaustive Elimination Method: An Overview 2 3 Our Approach 5 3.1 Initial and Final Flow Equations : : : : : : : : : : : : : : : : : : : : : : : : : : : 5 3.2 Basic Steps : : : : : : : : : : : : : : : : : : : : : : : : : : : : :...

Citations