Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  describes two new algorithms for solving inclusion based points-to analysis. The first algorithm, the Wave Propagation Method, is a modified version of an early technique presented by Pearce et al; hover, it greatly improves on the running time of its predecessor. The second algorithm, the Deep Propagation Method, is a more light-ighted analysis, that requires less memory.  have compared these algorithms with three state-of-the-art techniques by Hardekopf-Lin, Heintze-Tardieu and Pearce-Kelly-Hankin. Our experiments show that Deep Propagation has the best average execution time across a suite of 17 ll-known benchmarks, the lost memory requirements in absolute numbers, and the fastest absolute times for benchmarks under 100,000 lines of code. The memory-hungry Wave Propagation has the fastest absolute running times in a memory rich execution environment, matching the speed of the best known points-to analysis algorithms in large benchmarks.
['Fernando Magno Quintão Pereira', 'Daniel Berlin']
I am writing a research paper on a idea Wave Propagation and Deep Propagation for Pointer Analysis
[{"from": "human", "value": "I am writing a research paper on a idea Wave Propagation and Deep Propagation for Pointer Analysis"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  describes two new algorithms for solving inclusion based points-to analysis. The first algorithm, the Wave Propagation Method, is a modified version of an early technique presented by Pearce et al; hover, it greatly improves on the running time of its predecessor. The second algorithm, the Deep Propagation Method, is a more light-ighted analysis, that requires less memory.  have compared these algorithms with three state-of-the-art techniques by Hardekopf-Lin, Heintze-Tardieu and Pearce-Kelly-Hankin. Our experiments show that Deep Propagation has the best average execution time across a suite of 17 ll-known benchmarks, the lost memory requirements in absolute numbers, and the fastest absolute times for benchmarks under 100,000 lines of code. The memory-hungry Wave Propagation has the fastest absolute running times in a memory rich execution environment, matching the speed of the best known points-to analysis algorithms in large benchmarks."}]