Comprehensive isomorphic subtree enumeration

Partha Pratim Biswas, Girish Venkataramani · 2008

A fundamental problem in program analysis and optimization concerns the discovery of structural similarities between different sections of a given program and/or across different programs. Specifically, there is a need to find topologically identical segments within compiler intermediate representations (IRs).

Read the paper · More papers on PaperTik