Prikladnaya Diskretnaya Matematika. Supplement
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Prikl. Diskr. Mat. Suppl.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Prikladnaya Diskretnaya Matematika. Supplement, 2017, Issue 10, Pages 122–123
DOI: https://doi.org/10.17223/2226308X/10/47
(Mi pdma365)
 

Mathematical Foundations of Computer Security

Identification method for function calling conventions in binary applications

M. A. Stanchin, N. V. Sorokovikov

Tomsk State University, Tomsk
References:
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.
Document Type: Article
UDC: 004.94
Language: Russian
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
Citation in format AMSBIB
\Bibitem{StaSor17}
\by M.~A.~Stanchin, N.~V.~Sorokovikov
\paper Identification method for function calling conventions in binary applications
\jour Prikl. Diskr. Mat. Suppl.
\yr 2017
\issue 10
\pages 122--123
\mathnet{http://mi.mathnet.ru/pdma365}
\crossref{https://doi.org/10.17223/2226308X/10/47}
Linking options:
  • https://www.mathnet.ru/eng/pdma365
  • https://www.mathnet.ru/eng/pdma/y2017/i10/p122
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Prikladnaya Diskretnaya Matematika. Supplement
    Statistics & downloads:
    Abstract page:135
    Full-text PDF :41
    References:43
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024