Abstract
In this paper we define a special class of graph rewrite systems for program analysis: edge addition rewrite systems (TSars,). 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.
Cite
CITATION STYLE
Aßmann, U. (1996). On edge addition rewrite systems and their relevance to program analysis. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1073, pp. 321–335). Springer Verlag. https://doi.org/10.1007/3-540-61228-9_96
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
