| dc.contributor | Universidade Estadual Paulista (UNESP) | |
| dc.creator | Lakhotia, Arun | |
| dc.creator | Boccardo, Davidson R. | |
| dc.creator | Singh, Anshuman | |
| dc.creator | Manacero Jr., Aleardo | |
| dc.date | 2014-05-27T11:24:47Z | |
| dc.date | 2016-10-25T18:29:02Z | |
| dc.date | 2014-05-27T11:24:47Z | |
| dc.date | 2016-10-25T18:29:02Z | |
| dc.date | 2010-09-01 | |
| dc.date.accessioned | 2017-04-06T01:42:41Z | |
| dc.date.available | 2017-04-06T01:42:41Z | |
| dc.identifier | Higher-Order and Symbolic Computation, v. 23, n. 3, p. 275-313, 2010. | |
| dc.identifier | 1388-3690 | |
| dc.identifier | http://hdl.handle.net/11449/71846 | |
| dc.identifier | http://acervodigital.unesp.br/handle/11449/71846 | |
| dc.identifier | 10.1007/s10990-011-9080-1 | |
| dc.identifier | 2-s2.0-84855665553 | |
| dc.identifier | http://dx.doi.org/10.1007/s10990-011-9080-1 | |
| dc.identifier.uri | http://repositorioslatinoamericanos.uchile.cl/handle/2250/892777 | |
| dc.description | Since Sharir and Pnueli, algorithms for context-sensitivity have been defined in terms of 'valid' paths in an interprocedural flow graph. The definition of valid paths requires atomic call and ret statements, and encapsulated procedures. Thus, the resulting algorithms are not directly applicable when behavior similar to call and ret instructions may be realized using non-atomic statements, or when procedures do not have rigid boundaries, such as with programs in low level languages like assembly or RTL. We present a framework for context-sensitive analysis that requires neither atomic call and ret instructions, nor encapsulated procedures. The framework presented decouples the transfer of control semantics and the context manipulation semantics of statements. A new definition of context-sensitivity, called stack contexts, is developed. A stack context, which is defined using trace semantics, is more general than Sharir and Pnueli's interprocedural path based calling-context. An abstract interpretation based framework is developed to reason about stack-contexts and to derive analogues of calling-context based algorithms using stack-context. The framework presented is suitable for deriving algorithms for analyzing binary programs, such as malware, that employ obfuscations with the deliberate intent of defeating automated analysis. The framework is used to create a context-sensitive version of Venable et al.'s algorithm for analyzing x86 binaries without requiring that a binary conforms to a standard compilation model for maintaining procedures, calls, and returns. Experimental results show that a context-sensitive analysis using stack-context performs just as well for programs where the use of Sharir and Pnueli's calling-context produces correct approximations. However, if those programs are transformed to use call obfuscations, a contextsensitive analysis using stack-context still provides the same, correct results and without any additional overhead. © Springer Science+Business Media, LLC 2011. | |
| dc.language | eng | |
| dc.relation | Higher-Order and Symbolic Computation | |
| dc.rights | info:eu-repo/semantics/closedAccess | |
| dc.subject | Analysis of binaries | |
| dc.subject | Context-sensitive analysis | |
| dc.subject | Deobfuscation | |
| dc.subject | Obfuscation | |
| dc.subject | Abstract interpretations | |
| dc.subject | Automated analysis | |
| dc.subject | Binary programs | |
| dc.subject | Context sensitivity | |
| dc.subject | Context-sensitive | |
| dc.subject | Flow graph | |
| dc.subject | Inter-procedural | |
| dc.subject | Malwares | |
| dc.subject | Path-based | |
| dc.subject | Rigid boundaries | |
| dc.subject | Trace semantics | |
| dc.subject | Abstracting | |
| dc.subject | Algorithms | |
| dc.subject | Atoms | |
| dc.subject | Semantics | |
| dc.subject | Java programming language | |
| dc.title | Context-sensitive analysis without calling-context | |
| dc.type | Otro | |
