On the application of substitution algebra to program unification
Many problems in software engineering such as program refactoring, deobfuscation, vulnerability detection, require an efficient toolset for detecting pieces of code that have similar behavior. Current state of art in software clone detection makes it possible to find out only those pieces of code wh...
Main Authors: | V. A. Zakharov, T. A. Novikova |
---|---|
Format: | Article |
Language: | English |
Published: |
Ivannikov Institute for System Programming of the Russian Academy of Sciences
2018-10-01
|
Series: | Труды Института системного программирования РАН |
Subjects: | |
Online Access: | https://ispranproceedings.elpub.ru/jour/article/view/1035 |
Similar Items
-
Polynomial time algorithm for checking strong equivalence of program
by: V. A. Zakharov, et al.
Published: (2018-10-01) -
Polynomial time algorithm for checking strong equivalence of program
by: T. A. Novikova, et al.
Published: (2018-10-01) -
Двусторонняя унификация программ и ее применение для задач рефакторинга
by: T. A. Novikova, et al.
Published: (2018-10-01) -
Tree Slicing in Clone Detection: Syntactic Analysis Made (Semi)-Semantic
by: Marat Akhin, et al.
Published: (2012-01-01) -
On the application of equivalence checking algorithms for program minimization
by: V. A. Zakharov, et al.
Published: (2018-10-01)