A method for optimization of a program stored in non-transitory storage media includes generating traces for a programmed formula using a hardware processing system and selecting a subset of the traces. One or more substitute formulae are inferred from a plurality of formulae that yield a similar set of traces to the subset of traces. The programmed formula is transformed with a best matched substitute formula to reduce computational complexity.
Please help me write a proper abstract based on the patent claims. CLAIM: 1. A method for optimization of a program stored in non-transitory storage media, comprising: generating traces for a programmed formula using a hardware processing system; selecting a subset of the traces; inferring one or more substitute formulae from a plurality of formulae that yield a similar set of traces to the subset of traces; and transforming the programmed formula with a best matched substitute formula in the program to reduce computational complexity. 2. The method as recited in claim 1, wherein generating traces includes generating traces at different depths where larger depth provides greater detail for the traces. 3. The method as recited in claim 1, wherein selecting the subset of the traces includes: employing an iteration counter N; and selecting the subset of traces based on a plurality of values of N. 4. The method as recited in claim 1, wherein the traces include a series of numbers or a group of numbers computed by the programmed formula. 5. The method as recited in claim 1, wherein transforming the programmed formula with the best matched substitute formula includes conducting one or more mathematical operations on the best matched substitute formula to match the programmed formula. 6. The method as recited in claim 1, wherein inferring the one or more substitute formulae includes searching a database for replacement formulas based on the subset of traces. 7. The method as recited in claim 1, further comprising verifying that the best matched substitute formula matches the programmed formula. 8. A hardware processing system configured to reduce computation complexity of a programmed formula stored in non-transitory storage media, comprising: a processor configured to generate a selection of traces for a programmed formula; an inferring device coupled to the processor to search for one or more substitute formulae from a plurality of stored formulae to determine a similar set of traces to the selection of traces; and a transformed program generated using the processor that matches the programmed formula with a best matched substitute formula to reduce computational complexity. 9. The system as recited in claim 8, wherein the traces includes a depth where larger depth provides greater detail for the traces. 10. The system as recited in claim 8, wherein the processor selects a subset of the traces based on a plurality of values of an iteration counter N. 11. The system as recited in claim 8, wherein the traces include a series of numbers or a group of numbers computed by the programmed formula. 12. The system as recited in claim 8, wherein the transformed program includes one or more additional mathematical operations on the best matched substitute formula to match the programmed formula. 13. The system as recited in claim 8, wherein the inferring device searches a database for replacement formulas based on the subset of traces. 14. The system as recited in claim 8, wherein the system verifies that the best matched substitute formula matches the programmed formula. 15. A non-transitory computer readable storage medium comprising a computer readable program for optimization of a formula in a program, wherein the computer readable program when executed on a computer causes the computer to perform the steps of: generating traces for a programmed formula using a hardware processing system; selecting a subset of the traces; inferring one or more substitute formulae from a plurality of formulae that yields a similar set of traces to the subset of traces; and transforming the programmed formula with a best matched substitute formula to reduce computational complexity. 16. The non-transitory computer readable storage medium as recited in claim 15, wherein generating traces includes generating traces at different depths where larger depth provides greater detail for the traces. 17. The non-transitory computer readable storage medium as recited in claim 15, wherein selecting the subset of the traces includes: employing an iteration counter N; and selecting the subset of traces based on a plurality of values of N. 18. The non-transitory computer readable storage medium as recited in claim 15, wherein inferring the one or more substitute formulae includes searching a database for replacement formulas based on the subset of traces. 19. The non-transitory computer readable storage medium as recited in claim 15, further comprising verifying that the best matched substitute formula matches the programmed formula. 20. The non-transitory computer readable storage medium as recited in claim 15, wherein transforming the programmed formula with the best matched substitute formula includes conducting one or more mathematical operations on the best matched substitute formula to match the programmed formula.