InitRech 2015/2016, sujet 16 : Différence entre versions
De Wiki de Projets IMA
(→Article Summary) |
(→Main contribution) |
||
| Ligne 4 : | Ligne 4 : | ||
When we are coding something, we would like that a tool could analyse what we have done and describe it. Many solutions exist already, using regognition of the structure of the code, with specifics grammar and pattern. This article suggest an other way to analyse a program. It is proposed to analyse a program by comparing the source code with library of algorithms. Unfortunately, in the general case, the equivalence between two programs is undecidable. But we will see that find cases for which the equivalence problem is solvable is possible.<br/> | When we are coding something, we would like that a tool could analyse what we have done and describe it. Many solutions exist already, using regognition of the structure of the code, with specifics grammar and pattern. This article suggest an other way to analyse a program. It is proposed to analyse a program by comparing the source code with library of algorithms. Unfortunately, in the general case, the equivalence between two programs is undecidable. But we will see that find cases for which the equivalence problem is solvable is possible.<br/> | ||
| − | =Main contribution = | + | = Main contribution = |
| + | |||
= Application = | = Application = | ||
Version du 4 juin 2016 à 16:05
Article Summary
This article is about algorithm recognition. It is show how we can analyse programs with using comparisons between systems of affine recurrence equations
When we are coding something, we would like that a tool could analyse what we have done and describe it. Many solutions exist already, using regognition of the structure of the code, with specifics grammar and pattern. This article suggest an other way to analyse a program. It is proposed to analyse a program by comparing the source code with library of algorithms. Unfortunately, in the general case, the equivalence between two programs is undecidable. But we will see that find cases for which the equivalence problem is solvable is possible.
