The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
Static Analysis of Executables to Detect Malicious Patterns
Abstract
Abstract Malicious code detection is a crucial component of any defense mechanism. In this paper, we present a uniqueviewpoint on malicious code detection. We regard malicious code detection as an obfuscation-deobfuscation game between malicious code writers and researchers working on malicious code detection. Malicious code writers attemptto obfuscate the malicious code to subvert the malicious code detectors, such as anti-virus software. We tested the resilience of three commercial virus scanners against code obfuscation attacks. The results were surprising: the threecommercial virus scanners could be subverted by very simple obfuscation transformations! We present an architecture for detecting malicious patterns in executables that is resilient to common obfuscation transformations. Experimentalresults demonstrate the efficacy of our prototype tool, SAFE (a static analyzer for executables). 1 Introduction In the interconnected world of computers, malicious code has become an omnipresent and dangerous threat. Maliciouscode can infiltrate hosts using a variety of methods such as attacks against known software flaws, hidden functionality in regular programs, and social engineering. Given the devastating effect malicious code has on our cyber infrastruc-ture, identifying malicious programs is an important goal. Detecting the presence of malicious code on a given host is a crucial component of any defense mechanism. Malicious code is usually classified [28] according to its propagation method and goal into the following categories:*
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Introduction to automata theory, languages and computation
(1981) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(81)90068-9 · Cited by 10,699
Advanced Compiler Design and Implementation
Muchnick, S. S. (1997) · Cited by 2,312
Automatic discovery of linear restraints among variables of a program
Cousot, P., & Halbwachs, N. (1978) · Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '78 · doi:10.1145/512760.512770 · Cited by 1,614
Precise interprocedural dataflow analysis via graph reachability
Reps, T., Horwitz, S., & Sagiv, M. (1995) · Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '95 · doi:10.1145/199448.199462 · Cited by 1,170
How to Own the Internet in Your Spare Time
Staniford, S., Paxson, V., & Weaver, N. C. (2002) · USENIX Security Symposium · Cited by 1,169
Bandera: extracting finite-state models from Java source code
Corbett, J. C., Dwyer, M. B., Hatcliff, J., Laubach, S., Păsăreanu, C. S., Robby, & Zheng, H. (2000) · Proceedings of the 22nd international conference on Software engineering - ICSE '00 · doi:10.1145/337180.337234 · Cited by 1,059
First-Order Logic and Automated Theorem Proving
Fitting, M. (1996) · Springer eBooks · doi:10.1007/978-1-4612-2360-3 · Cited by 950
A Taxonomy of Obfuscating Transformations
Collberg, C. S., Thomborson, C. D., & Low, D. (1997) · Cited by 852
Cohen, F. (1987) · Computers & Security · doi:10.1016/0167-4048(87)90122-2 · Cited by 754
Intrusion detection via static analysis
Wagner, D., & Dean, R. (2002) · Proceedings 2001 IEEE Symposium on Security and Privacy. S&P 2001 · doi:10.1109/secpri.2001.924296 · Cited by 647
Automatically Validating Temporal Safety Properties of Interfaces
Ball, T., & Rajamani, S. K. (2001) · Cited by 599
On the (im)possibility of obfuscating programs
Barak, B., Goldreich, O., Impagliazzo, R., Rudich, S., Sahai, A., Vadhan, S., & Yang, K. (2012) · Journal of the ACM · doi:10.1145/2160158.2160159 · Cited by 595
From system F to typed assembly language
Morrisett, G., Walker, D., Crary, K., & Glew, N. (1999) · ACM Transactions on Programming Languages and Systems · doi:10.1145/319301.319345 · Cited by 584
Computer viruses—theory and experiments
Cohen, F. (1990) · Van Nostrand Reinhold eBooks · Cited by 566
Manufacturing cheap, resilient, and stealthy opaque constructs
Collberg, C., Thomborson, C., & Low, D. (1998) · Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '98 · doi:10.1145/268946.268962 · Cited by 535
Translation validation for an optimizing compiler
Necula, G. C. (2000) · Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation · doi:10.1145/349299.349314 · Cited by 488
Undecidability of static analysis
Landi, W. A. (1992) · ACM Letters on Programming Languages and Systems · doi:10.1145/161494.161501 · Cited by 407
IRM enforcement of Java stack inspection
Erlingsson, Ú., & Schneider, F. B. (2002) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/secpri.2000.848461 · Cited by 290
Checking for Race Conditions in File Accesses
Bishop, M., & Dilger, M. (1996) · Cited by 241
Attacking Malicious Code: A Report to the Infosec Research Council
McGraw, G., & Morrisett, G. (2000) · IEEE Software · doi:10.1109/52.877857 · Cited by 230
A precise inter-procedural data flow algorithm
Myers, E. M. (1981) · Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '81 · doi:10.1145/567532.567556 · Cited by 211
Using programmer-written compiler extensions to catch security holes
Ashcraft, K., & Engler, D. (2005) · Proceedings 2002 IEEE Symposium on Security and Privacy · doi:10.1109/secpri.2002.1004368 · Cited by 204
Detecting Manipulated Remote Call Streams
Giffin, J. T., Jha, S., & Miller, B. P. (2002) · Cited by 128
Self-citationVerification of control flow based security properties
Jensen, T. W., Métayer, D. L., & Thorn, T. (2003) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/secpri.1999.766902 · Cited by 120
An Undetectable Computer Virus
Chess, D. M., & White, S. R. (2000) · Cited by 104
Stack-based typed assembly language
Morrisett, G., Crary, K., Glew, N., & Walker, D. (2002) · Journal of Functional Programming · doi:10.1017/s0956796801004178 · Cited by 101
Improving computer security using extended static checking
Chess, B. (2005) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/secpri.2002.1004369 · Cited by 84
Safety checking of machine code
Xu, Z., Miller, B. P., & Reps, T. (2000) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/349299.349313 · Cited by 73
Chandra, S., & Reps, T. (1999) · ACM SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering (PASTE) · doi:10.1145/316158.316183 · Cited by 61
Typestate Checking of Machine Code
Xu, Z., Reps, T., & Miller, B. P. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45309-1_22 · Cited by 27
From System F to Typed Assembly Language (Extended Version)
Morrisett, G., Walker, D., Crary, K., & Glew, N. (1997) · eCommons (Cornell University) · Cited by 11
Cited by
Crowdroid: behavior-based malware detection system for Android
Burguera, I., Zurutuza, U., & Nadjm-Tehrani, S. (2011) · Proceedings of the 1st ACM workshop on Security and privacy in smartphones and mobile devices · doi:10.1145/2046614.2046619 · Cited by 910
Limits of Static Analysis for Malware Detection
Moser, A., Kruegel, C., & Kirda, E. (2007) · Twenty-Third Annual Computer Security Applications Conference (ACSAC 2007) · doi:10.1109/acsac.2007.21 · Cited by 813
Automatic analysis of malware behavior using machine learning
Rieck, K., Trinius, P., Willems, C., & Holz, T. (2011) · Journal of Computer Security · doi:10.3233/jcs-2010-0410 · Cited by 729
A Survey on Malware Detection Using Data Mining Techniques
Ye, Y., Li, T., Adjeroh, D., & Iyengar, S. S. (2018) · ACM Computing Surveys · doi:10.1145/3073559 · Cited by 623
Malware Obfuscation Techniques: A Brief Survey
You, I., & Yim, K. (2010) · 2010 International Conference on Broadband, Wireless Computing, Communication and Applications · doi:10.1109/bwcca.2010.85 · Cited by 607
Metadata
- Authors
- Christodorescu, M., & Jha, S.
- Publisher
- Defense Technical Information Center
- Published
- 2006-01-01
- OpenAlex
- W1544837488
- Cited by
- 600
- References
- 31
- Type
- report
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.