The DOI matches its Crossref record; 54 of the 54 references it cites were found in a registry or an index.
All You Ever Wanted to Know about Dynamic Taint Analysis and Forward Symbolic Execution (but Might Have Been Afraid to Ask)
Open accessAbstract
Dynamic taint analysis and forward symbolic execution are quickly becoming staple techniques in security analyses. Example applications of dynamic taint analysis and forward symbolic execution include malware analysis, input filter generation, test case generation, and vulnerability discovery. Despite the widespread usage of these two techniques, there has been little effort to formally define the algorithms and summarize the critical issues that arise when these techniques are used in typical security contexts. The contributions of this paper are two-fold. First, we precisely describe the algorithms for dynamic taint analysis and forward symbolic execution as extensions to the run-time semantics of a general language. Second, we highlight important implementation choices, common pitfalls, and considerations when using these techniques in a security context.
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
Dijkstra, E. W. (1976) · CERN Document Server (European Organization for Nuclear Research) · Cited by 4,733
The program dependence graph and its use in optimization
Ferrante, J., Ottenstein, K. J., & Warren, J. D. (1987) · ACM Transactions on Programming Languages and Systems · doi:10.1145/24039.24041 · Cited by 2,755
KLEE: unassisted and automatic generation of high-coverage tests for complex systems programs
Cadar, C., Dunbar, D., & Engler, D. (2008) · doi:10.5555/1855741.1855756 · Cited by 2,620
DART: directed automated random testing
Godefroid, P., Klarlund, N., & Sen, K. (2005) · ACM SIGPLAN Notices · doi:10.1145/1064978.1065036 · Cited by 2,067
Language-based information-flow security
Sabelfeld, A., & Myers, A. C. (2003) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2002.806121 · Cited by 1,907
CUTE: a concolic unit testing engine for C
Sen, K., Marinov, D., & Agha, G. (2005) · Proceedings of the 10th European software engineering conference held jointly with 13th ACM SIGSOFT international symposium on Foundations of software engineering · doi:10.1145/1081706.1081750 · Cited by 1,651
DART: directed automated random testing
Godefroid, P., Klarlund, N., & Sen, K. (2005) · Proceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation · doi:10.1145/1065010.1065036 · Cited by 1,570
Schneider, F. B. (2000) · ACM Transactions on Information and System Security · doi:10.1145/353323.353382 · Cited by 1,289
Newsome, J., & Song, D. X. (2018) · Figshare · doi:10.1184/r1/6468716 · Cited by 1,270
Automated Whitebox Fuzz Testing.
Godefroid, P., Levin, M. Y., & Molnar, D. A. (2008) · Cited by 1,095
EXE: automatically generating inputs of death
Cadar, C., Ganesh, V., Pawlowski, P. M., Dill, D. L., & Engler, D. R. (2006) · Proceedings of the 13th ACM conference on Computer and communications security · doi:10.1145/1180405.1180445 · Cited by 788
Secure program execution via dynamic information flow tracking
Suh, G. E., Lee, J. W., Zhang, D., & Devadas, S. (2004) · Proceedings of the 11th international conference on Architectural support for programming languages and operating systems · doi:10.1145/1024393.1024404 · Cited by 740
Panorama: capturing system-wide information flow for malware detection and analysis
Yin, H., Song, D., Egele, M., Kruegel, C., & Kirda, E. (2007) · Proceedings of the 14th ACM conference on Computer and communications security · doi:10.1145/1315245.1315261 · Cited by 683
Polygraph: Automatically Generating Signatures for Polymorphic Worms
Newsome, J., Karp, B., & Song, D. (2005) · 2005 IEEE Symposium on Security and Privacy (S&P'05) · doi:10.1109/sp.2005.15 · Cited by 670
Scalable, behavior-based malware clustering
Bayer, U. (2009) · Cited by 603
A Decision Procedure for Bit-Vectors and Arrays
Ganesh, V., & Dill, D. L. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-73368-3_52 · Cited by 585
Securing web application code by static analysis and runtime protection
Huang, Y.-W., Yu, F., Hang, C., Tsai, C.-H., Lee, D.-T., & Kuo, S.-Y. (2004) · Proceedings of the 13th international conference on World Wide Web · doi:10.1145/988672.988679 · Cited by 567
Clause, J., Li, W., & Orso, A. (2007) · International Symposium on Software Testing and Analysis · doi:10.1145/1273463.1273490 · Cited by 539
Necula, G. C., McPeak, S., & Weimer, W. R. (2012) · ACM SIGPLAN Notices · doi:10.1145/2442776.2442786 · Cited by 502
Exploring Multiple Execution Paths for Malware Analysis
Moser, A., Kruegel, C., & Kirda, E. (2007) · 2007 IEEE Symposium on Security and Privacy (SP '07) · doi:10.1109/sp.2007.17 · Cited by 488
Cross Site Scripting Prevention with Dynamic Data Tainting and Static Analysis.
Vogt, P.-S., Nentwich, F., Jovanovic, N. M., Kirda, E., Krügel, C., & Vigna, G. (2007) · Network and Distributed System Security Symposium · Cited by 483
Grammar-based whitebox fuzzing
Godefroid, P., Kiezun, A., & Levin, M. Y. (2008) · Proceedings of the 29th ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/1375581.1375607 · Cited by 462
Vigilante: end-to-end containment of internet worms
Costa, M., Crowcroft, J., Castro, M., Rowstron, A., Zhou, L., Zhang, L., & Barham, P. (2005) · ACM SIGOPS Operating Systems Review · doi:10.1145/1095809.1095824 · Cited by 441
LIFT: A Low-Overhead Practical Information Flow Tracking System for Detecting Security Attacks
Qin, F., Wang, C., Li, Z., Kim, H.-S., Zhou, Y., & Wu, Y. (2006) · 2006 39th Annual IEEE/ACM International Symposium on Microarchitecture (MICRO'06) · doi:10.1109/micro.2006.29 · Cited by 422
Compositional dynamic test generation
Godefroid, P. (2007) · ACM SIGPLAN Notices · doi:10.1145/1190215.1190226 · Cited by 408
Automatically Hardening Web Applications Using Precise Tainting
Nguyen-Tuong, A., Guarnieri, S., Greene, D., Shirley, J., & Evans, D. (2005) · IFIP Advances in Information and Communication Technology · doi:10.1007/0-387-25660-1_20 · Cited by 387
Necula, G. C., McPeak, S., & Weimer, W. R. (2002) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/503272.503286 · Cited by 375
Polyglot: automatic extraction of protocol message format using dynamic binary analysis
Caballero, J., Yin, H., Liang, Z., & Song, D. (2007) · Proceedings of the 14th ACM conference on Computer and communications security · doi:10.1145/1315245.1315286 · Cited by 372
Taint-enhanced policy enforcement: a practical approach to defeat a wide range of attacks
Xu, W., Bhatkar, S., & Sekar, R. (2006) · Cited by 339
Compositional dynamic test generation
Godefroid, P. (2007) · Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/1190216.1190226 · Cited by 314
Dynamic Analysis of Malicious Code
Bayer, U., Moser, A., Kruegel, C., & Kirda, E. (2006) · Journal in Computer Virology · doi:10.1007/s11416-006-0012-2 · Cited by 295
Towards automatic generation of vulnerability-based signatures
Brumley, D., Newsome, J., Song, D. X., Wang, H., & Jha, S. (2006) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp.2006.41 · Cited by 292
Self-citationCVC Lite: A New Implementation of the Cooperating Validity Checker
Barrett, C., & Berezin, S. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-27813-9_49 · Cited by 275
Vigilante: end-to-end containment of internet worms
Costa, M., Crowcroft, J., Castro, M., Rowstron, A., Zhou, L., Zhang, L., & Barham, P. (2005) · Proceedings of the twentieth ACM symposium on Operating systems principles · doi:10.1145/1095810.1095824 · Cited by 273
Foster, J. S., Fähndrich, M., & Aiken, A. (1999) · Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation · doi:10.1145/301618.301665 · Cited by 261
Execution Generated Test Cases: How to Make Systems Code Crash Itself
Cadar, C., & Engler, D. (2005) · Lecture Notes in Computer Science · doi:10.1007/11537328_2 · Cited by 254
RWset: Attacking Path Explosion in Constraint-Based Test Generation
Boonstoppel, P., Cadar, C., & Engler, D. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-78800-3_27 · Cited by 234
Dynamic Taint Propagation for Java
Haldar, V., Chandra, D., & Franz, M. (2006) · 21st Annual Computer Security Applications Conference (ACSAC'05) · doi:10.1109/csac.2005.21 · Cited by 225
Egele, M., Kruegel, C., Kirda, E., Yin, H., & Song, D. X. (2018) · Figshare · doi:10.1184/r1/6468713 · Cited by 221
Avoiding exponential explosion: generating compact verification conditions
Flanagan, C., & Saxe, J. B. (2001) · Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/360204.360220 · Cited by 220
Using positive tainting and syntax-aware evaluation to counter SQL injection attacks
Halfond, W. G. J., Orso, A., & Manolios, P. (2006) · Proceedings of the 14th ACM SIGSOFT international symposium on Foundations of software engineering · doi:10.1145/1181775.1181797 · Cited by 211
Automatic Reverse Engineering of Malware Emulators
Sharif, M., Lanzi, A., Giffin, J., & Lee, W. (2009) · 2009 30th IEEE Symposium on Security and Privacy · doi:10.1109/sp.2009.27 · Cited by 204
Automatic network protocol analysis
Wondracek, G. (2008) · Cited by 183
On deriving unknown vulnerabilities from zero-day polymorphic and metamorphic worm exploits
Crandall, J. R., Su, Z., Wu, S. F., & Chong, F. T. (2005) · Proceedings of the 12th ACM conference on Computer and communications security · doi:10.1145/1102120.1102152 · Cited by 171
WYSINWYX: What You See Is Not What You eXecute
Balakrishnan, G., Reps, T., Melski, D., & Teitelbaum, T. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-69149-5_22 · Cited by 157
Efficient and extensible security enforcement using dynamic data flow analysis
Chang, W., Streiff, B., & Lin, C. (2008) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/1455770.1455778 · Cited by 132
A General Dynamic Information Flow Tracking Framework for Security Applications
Lam, L. C., & Chiueh, T. (2006) · Annual Computer Security Applications Conference · doi:10.1109/acsac.2006.6 · Cited by 119
FLAX: Systematic Discovery of Client-side Validation Vulnerabilities in Rich Web Applications.
Saxena, P., Hanna, S., Poosankam, P., & Song, D. X. (2010) · Cited by 117
Vulnerability-Specific Execution Filtering for Exploit Prevention on Commodity Software
Newsome, J., Brumley, D., & Song, D. X. (2018) · Figshare · doi:10.1184/r1/6469526 · Cited by 102
Self-citationBrumley, D., Caballero, J., Liang, Z., Newsome, J., & Song, D. X. (2018) · doi:10.1184/r1/6469484 · Cited by 97
Self-citationCreating Vulnerability Signatures Using Weakest Preconditions
Brumley, D., Wang, H., Jha, S., & Song, D. X. (2007) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csf.2007.17 · Cited by 90
Self-citationMeasuring channel capacity to distinguish undue influence
Newsome, J., McCamant, S., & Song, D. X. (2009) · ACM Workshop on Programming Languages and Analysis for Security · doi:10.1145/1554339.1554349 · Cited by 84
Limits of Learning-Based Signature Generation with Adversaries
Venkataraman, S., Blum, A. L., & Song, D. X. (2018) · Figshare · doi:10.1184/r1/6468965 · Cited by 48
Efficient Directionless Weakest Preconditions
Brumley, D., & Jager, I. (2011) · Cited by 18
Self-citation
Cited by
TaintDroid: an information-flow tracking system for realtime privacy monitoring on smartphones
Enck, W., Gilbert, P., Chun, B.-G., Cox, L. P., Jung, J., McDaniel, P. D., & Sheth, A. N. (2010) · doi:10.5555/1924943.1924971 · Cited by 2,238
Enck (2014) · doi:10.1145/2619091 · Cited by 1,203
SOK: (State of) The Art of War: Offensive Techniques in Binary Analysis
Shoshitaishvili, Y., Wang, R., Salls, C., Stephens, N., Polino, M., Dutcher, A., Grosen, J., Feng, S., Hauser, C., Kruegel, C., et al. (2016) · 2016 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp.2016.17 · Cited by 957
Symbolic execution for software testing: three decades later
Cadar, C., & Sen, K. (2013) · Communications of the ACM · doi:10.1145/2408776.2408795 · Cited by 776
A survey of symbolic execution techniques
Baldoni, R., Coppa, E., D’elia, D. C., Demetrescu, C., & Finocchi, I. (2019) · ACM Computing Surveys · doi:10.1145/3182657 · Cited by 708
Metadata
- Authors
- Schwartz, E. J., Avgerinos, T., & Brumley, D.
- Venue
- 2010 IEEE Symposium on Security and Privacy
- Publisher
- IEEE
- Published
- 2010
- Pages
- 317-331
- ISSN
- 1081-6011 (ISSN-L)
- OpenAlex
- W2138788987
- Cited by
- 717
- References
- 54
- FWCI
- 23.13
- Type
- conference paper
- Language
- en
- Open access
- green
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.