HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Algorithm Recognition based on Demand-Driven Dataflow Analysis

Abstract : Algorithm recognition is an important problem in program analysis, optimization, and more particularly program comprehension. Basically, one would like to submit a piece of code, and get an answer like " Lines 10 to 23 are an implementation of Gauss-Jordan elimination ". Existing approaches often perform a bottom-up recognition, using a database describing many implementation variations of a given algorithm, in a format making them difficult to maintain. In this paper, we present a new method to recognize algorithm templates in a program. We perform a top-down recognition, stopping at template variables and thus limiting the need for many program variations. The code to analyze is given in SSA form, and the-functions are computed on-demand, when computation is possible, along the candidate slices.
Document type :
Conference papers
Complete list of metadata

Cited literature [25 references]  Display  Hide  Download

Contributor : Christophe Alias Connect in order to contact the contributor
Submitted on : Thursday, December 14, 2017 - 12:00:54 PM
Last modification on : Friday, February 4, 2022 - 3:11:43 AM


Files produced by the author(s)


  • HAL Id : ensl-01663748, version 1



Christophe Alias, Denis Barthou. Algorithm Recognition based on Demand-Driven Dataflow Analysis. 10th Working Conference on Reverse Engineering (WCRE 2003), Nov 2003, Victoria, Canada. ⟨ensl-01663748⟩



Record views


Files downloads