dc.contributorUniversidade Estadual Paulista (UNESP)
dc.creatorLakhotia, Arun
dc.creatorBoccardo, Davidson R.
dc.creatorSingh, Anshuman
dc.creatorManacero Jr., Aleardo
dc.date2014-05-27T11:24:40Z
dc.date2016-10-25T18:28:31Z
dc.date2014-05-27T11:24:40Z
dc.date2016-10-25T18:28:31Z
dc.date2010-04-20
dc.date.accessioned2017-04-06T01:41:09Z
dc.date.available2017-04-06T01:41:09Z
dc.identifierProceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, p. 131-140.
dc.identifierhttp://hdl.handle.net/11449/71657
dc.identifierhttp://acervodigital.unesp.br/handle/11449/71657
dc.identifier10.1145/1706356.1706381
dc.identifier2-s2.0-77950882873
dc.identifierhttp://dx.doi.org/10.1145/1706356.1706381
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/892613
dc.descriptionA method for context-sensitive analysis of binaries that may have obfuscated procedure call and return operations is presented. Such binaries may use operators to directly manipulate stack instead of using native call and ret instructions to achieve equivalent behavior. Since definition of context-sensitivity and algorithms for context-sensitive analysis have thus far been based on the specific semantics associated to procedure call and return operations, classic interprocedural analyses cannot be used reliably for analyzing programs in which these operations cannot be discerned. A new notion of context-sensitivity is introduced that is based on the state of the stack at any instruction. While changes in 'calling'-context are associated with transfer of control, and hence can be reasoned in terms of paths in an interprocedural control flow graph (ICFG), the same is not true of changes in 'stack'-context. An abstract interpretation based framework is developed to reason about stack-contexts and to derive analogues of call-strings based methods for the context-sensitive analysis using stack-context. The method presented is used to create a context-sensitive version of Venable et al.'s algorithm for detecting obfuscated calls. Experimental results show that the context-sensitive version of the algorithm generates more precise results and is also computationally more efficient than its context-insensitive counterpart. Copyright © 2010 ACM.
dc.languageeng
dc.relationProceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.subjectAnalysis of bianries
dc.subjectContext-sensitive analysis
dc.subjectDeobfuscation
dc.subjectObfuscation
dc.subjectAbstract interpretations
dc.subjectContext sensitivity
dc.subjectContext-sensitive
dc.subjectControl flow graphs
dc.subjectExecutables
dc.subjectInter-procedural
dc.subjectInter-procedural analysis
dc.subjectProcedure call
dc.subjectSpecific semantics
dc.subjectMathematical operators
dc.subjectProgram interpreters
dc.subjectTechnical presentations
dc.subjectJava programming language
dc.titleContext-sensitive analysis of obfuscated x86 executables
dc.typeOtro


Este ítem pertenece a la siguiente institución