Memory violation detection method in binary code

In this paper memory violation detection method is considered. This method applied to program binaries, without requiring debug information. It allows to find such memory violations as out-of-bound read or writing in some buffer. The technique is based on dynamic analysis and symbolic execution. We...

Full description

Bibliographic Details
Main Authors: V. V. Kaushan, A. Y.U. Mamontov, V. A. Padaryan, A. N. Fedotov
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/1093
_version_ 1818065175713939456
author V. V. Kaushan
A. Y.U. Mamontov
V. A. Padaryan
A. N. Fedotov
author_facet V. V. Kaushan
A. Y.U. Mamontov
V. A. Padaryan
A. N. Fedotov
author_sort V. V. Kaushan
collection DOAJ
description In this paper memory violation detection method is considered. This method applied to program binaries, without requiring debug information. It allows to find such memory violations as out-of-bound read or writing in some buffer. The technique is based on dynamic analysis and symbolic execution. We present a tool implemented the method. We used this tool to find 11 bugs in both Linux and Windows programs, 7 of which were undocumented at the time this paper was written.
first_indexed 2024-12-10T14:47:43Z
format Article
id doaj.art-0c86da8c4dc94563b83f59f4b4c3bf55
institution Directory Open Access Journal
issn 2079-8156
2220-6426
language English
last_indexed 2024-12-10T14:47:43Z
publishDate 2018-10-01
publisher Ivannikov Institute for System Programming of the Russian Academy of Sciences
record_format Article
series Труды Института системного программирования РАН
spelling doaj.art-0c86da8c4dc94563b83f59f4b4c3bf552022-12-22T01:44:31ZengIvannikov Institute for System Programming of the Russian Academy of SciencesТруды Института системного программирования РАН2079-81562220-64262018-10-0127210512610.15514/ISPRAS-2015-27(2)-71093Memory violation detection method in binary codeV. V. Kaushan0A. Y.U. Mamontov1V. A. Padaryan2A. N. Fedotov3ИСП РАНИСП РАНИСП РАНИСП РАНIn this paper memory violation detection method is considered. This method applied to program binaries, without requiring debug information. It allows to find such memory violations as out-of-bound read or writing in some buffer. The technique is based on dynamic analysis and symbolic execution. We present a tool implemented the method. We used this tool to find 11 bugs in both Linux and Windows programs, 7 of which were undocumented at the time this paper was written.https://ispranproceedings.elpub.ru/jour/article/view/1093выявление уязвимостейбинарный коддинамический анализсимвольное выполнение
spellingShingle V. V. Kaushan
A. Y.U. Mamontov
V. A. Padaryan
A. N. Fedotov
Memory violation detection method in binary code
Труды Института системного программирования РАН
выявление уязвимостей
бинарный код
динамический анализ
символьное выполнение
title Memory violation detection method in binary code
title_full Memory violation detection method in binary code
title_fullStr Memory violation detection method in binary code
title_full_unstemmed Memory violation detection method in binary code
title_short Memory violation detection method in binary code
title_sort memory violation detection method in binary code
topic выявление уязвимостей
бинарный код
динамический анализ
символьное выполнение
url https://ispranproceedings.elpub.ru/jour/article/view/1093
work_keys_str_mv AT vvkaushan memoryviolationdetectionmethodinbinarycode
AT ayumamontov memoryviolationdetectionmethodinbinarycode
AT vapadaryan memoryviolationdetectionmethodinbinarycode
AT anfedotov memoryviolationdetectionmethodinbinarycode