Method for validation of binary code transformations

Abstract

A method of validating binary code transformation in one aspect includes analyzing original program and transform program. Control flow graphs are generated for both programs. The two graphs are traversed to create respective linear invariant representations. The linear representations are compared to identify incorrect transformations.

1 . A program storage device readable by a machine, tangibly embodying a program of instructions executable by the machine to perform a method for validating binary code transformations, comprising:
 analyzing binary code of an executable program to produce a sequence of basic units comprising smallest elements of the executable program that stay intact under every reordering;   generating control flow graph associated with the sequence of basic units;   generating invariant linear fiction representation based on the control flow graph;   analyzing optimized transformation of the executable program to produce a second sequence of basic units;   generating second control flow graph associated with the second sequence of basic units;   generating second invariant linear function representation based on the second control flow graph;   comparing the invariant linear function representation and the second invariant linear function representation; and   identifying one or more incorrect transformations in the optimized transformation,   wherein the invariant linear function representation and the second invariant linear function representation are invariants under a set of predefined optimization transformation and include a sequence of strips comprising a path through a trace of non-branch instructions executing sequentially when the executable program runs.