On Edge Addition Rewrite Systems and their Relevance to Program Analysis

In this paper we define a special class of graph rewrite systems for program analysis: edge addition rewrite systemsEars). Ears can be applied to distributive data-flow frameworks over finite lattices [Hec77] [RSH94], as well as many other program analysis problems. We also present some techniques for optimized evaluation of Ears. They show that Ears are very well suited for generating efficient program analyzers.