We build a transformation Pass at the function level with properties that best capture the input program. Each vertex is labeled with the operation of the instruction it represents, while edges display the order of precedence between operations.
We therefore construct canonical form of DFS, which the minimum code that can be derived from a graph g [1]. Specifically, the strategy consists in:
(1) Building frequent subgraphs bottom-up, using DFS code as regularized representation.
(2) Eliminating redundancies via minimal canonical DFS code based on lexicographic ordering.
[1] X. Yan and J. Han, “gspan: Graph-based substructure pattern mining,” inData Mining, 2002. ICDM 2003. Proceedings. 2002 IEEE InternationalConference on. IEEE, 2002, pp. 721–724
[2] Mbongue, Joel Mandebi, Danielle Tchuinkou Kwadjo, and Christophe Bobda. "Automatic Generation of Application-Specific FPGA Overlays with RapidWright." 2019 International Conference on Field-Programmable Technology (ICFPT). IEEE, 2019.