Abstract: A method performed by a computing device may comprise receiving a netlist and converting primitive tables and library instances of the netlist to behavioral code. The netlist may be flattened by replacing sub-module instances with respective code. A number of unnecessary variables may be reduced by replacing input and output with corresponding wires from a top-level module of the netlist. The netlist may be parsed to produce an AST. Sequential and combinational graphs may be generated. A list of all sub-modules instantiated within the design may also be generated. The method may further comprise looking for the definitions of the sub-modules within the netlist or a helper library file and determining whether the top-level module contains instances of user-defined primitives. Any user-defined primitives may be converted into equivalent module definitions. Directive graphs may be generated from the AST. Hierarchy may be restored and module reconstruction may be performed.