1. A method for producing a non-canonical data flow graph (DFG) structure by symbolic simulation of an input representation, comprising: determining a set of next execution paths to be processed from a set of active execution paths; determining a set of indication points, in the input representation, from the set of next execution paths; determining a next symbolic simulation operation to be performed, for producing the non-canonical DFG structure, using the indication points; and performing the next symbolic simulation operation on the input representation for producing the non-canonical DFG structure.
1. A method for producing a non-canonical data flow graph (DFG) structure by symbolic simulation of an input representation, comprising: determining a set of next execution paths to be processed from a set of active execution paths; determining a set of indication points, in the input representation, from the set of next execution paths; determining a next symbolic simulation operation to be performed, for producing the non-canonical DFG structure, using the indication points; and performing the next symbolic simulation operation on the input representation for producing the non-canonical DFG structure. 36. The method of claim 1 , further comprising: keeping the set of active execution paths sorted.