|
Mathematical Foundations of Computer Security
Identification method for function calling conventions in binary applications
M. A. Stanchin, N. V. Sorokovikov Tomsk State University, Tomsk
Abstract:
A method for identification of calling conventions for functions in binary applications is proposed. The essence of the method is to determine indications that the calling convention under analysis seems to be specific to a certain type. If there are indications for many different types of calling conventions, then the majority rule is used to determine one of them. In the case of absence of any indications for known calling conventions, it is considered that the calling convention for this function is “user call”.
Keywords:
static analysis, calling convention, binary application.
Citation:
M. A. Stanchin, N. V. Sorokovikov, “Identification method for function calling conventions in binary applications”, Prikl. Diskr. Mat. Suppl., 2017, no. 10, 122–123
Linking options:
https://www.mathnet.ru/eng/pdma365 https://www.mathnet.ru/eng/pdma/y2017/i10/p122
|
Statistics & downloads: |
Abstract page: | 135 | Full-text PDF : | 41 | References: | 43 |
|