The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
TAJ: effective taint analysis of web applications
Abstract
Taint analysis, a form of information-flow analysis, establishes whether values from untrusted methods and parameters may flow into security-sensitive operations. Taint analysis can detect many common vulnerabilities in Web applications, and so has attracted much attention from both the research community and industry. However, most static taint-analysis tools do not address critical requirements for an industrial-strength tool. Specifically, an industrial-strength tool must scale to large industrial Web applications, model essential Web-application code artifacts, and generate consumable reports for a wide range of attack vectors.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Efficiently computing static single assignment form and the control dependence graph
Cytron, R., Ferrante, J., Rosen, B. K., Wegman, M. N., & Zadeck, F. K. (1991) · ACM Transactions on Programming Languages and Systems · doi:10.1145/115372.115320 · Cited by 2,267
Security Policies and Security Models
Goguen, J. A., & Meseguer, J. (1982) · 1982 IEEE Symposium on Security and Privacy · doi:10.1109/sp.1982.10014 · Cited by 2,119
A lattice model of secure information flow
Denning, D. E. (1976) · Communications of the ACM · doi:10.1145/360051.360056 · Cited by 1,907
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
JFlow: practical mostly-static information flow control
Myers, A. C. (1999) · Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/292540.292561 · Cited by 1,034
Certification of programs for secure information flow
Denning, D. E., & Denning, P. J. (1977) · Communications of the ACM · doi:10.1145/359636.359712 · Cited by 1,029
A sound type system for secure flow analysis
Volpano, D., Irvine, C., & Smith, G. (1996) · Journal of Computer Security · doi:10.3233/jcs-1996-42-304 · Cited by 969
Program Analysis and Specialization for the C Programming Language
Andersen, L. O., & Lee, P. (2005) · Cited by 899
Wall, L., & Loukides, M. (1991) · Cited by 783
Finding security vulnerabilities in java applications with static analysis
Livshits, V. B., & Lam, M. S. (2005) · USENIX Security Symposium · Cited by 773
Cloning-based context-sensitive pointer alias analysis using binary decision diagrams
Whaley, J., & Lam, M. S. (2004) · Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementation · doi:10.1145/996841.996859 · Cited by 582
A decentralized model for information flow control
Myers, A. C., & Liskov, B. (1997) · Proceedings of the sixteenth ACM symposium on Operating systems principles · doi:10.1145/268998.266669 · Cited by 536
Static detection of cross-site scripting vulnerabilities
Wassermann, G., & Su, Z. (2008) · Proceedings of the 13th international conference on Software engineering - ICSE '08 · doi:10.1145/1368088.1368112 · Cited by 382
Flow-sensitive type qualifiers
Foster, J. S., Terauchi, T., & Aiken, A. (2002) · Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/512529.512531 · Cited by 375
Interprocedural slicing using dependence graphs
Horwitz, S., Reps, T., & Binkley, D. (2004) · ACM SIGPLAN Notices · doi:10.1145/989393.989419 · Cited by 372
Detecting format string vulnerabilities with type qualifiers
Shankar, U., Talwar, K., Foster, J. S., & Wagner, D. (2001) · Cited by 353
Sridharan, M., Fink, S. J., & Bodik, R. (2007) · Proceedings of the 28th ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/1250734.1250748 · Cited by 243
Self-citationRefinement-based context-sensitive points-to analysis for Java
Sridharan, M., & Bodík, R. (2006) · ACM SIGPLAN Notices · doi:10.1145/1133255.1134027 · Cited by 240
Self-citationABCD: eliminating array bounds checks on demand
Bodík, R., Gupta, R., & Sarkar, V. (2000) · Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation · doi:10.1145/349299.349342 · Cited by 234
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
Quantitative information flow as network flow capacity
McCamant, S., & Ernst, M. D. (2008) · Proceedings of the 29th ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/1375581.1375606 · Cited by 171
Modular Static Program Analysis
Cousot, P., & Cousot, R. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45937-5_13 · Cited by 163
Efficient path conditions in dependence graphs for software safety analysis
Snelting, G., Robschink, T., & Krinke, J. (2006) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/1178625.1178628 · Cited by 141
Dimensions of Precision in Reference Analysis of Object-Oriented Programming Languages
Ryder, B. G. (2003) · Lecture notes in computer science · doi:10.1007/3-540-36579-6_10 · Cited by 134
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
Information flow control for Java based on path conditions in dependence graphs
Hammer, C., Krinke, J., & Snelting, G. (2006) · Cited by 97
Interprocedural Analysis for Privileged Code Placement and Tainted Variable Detection
Pistoia, M., Flynn, R. J., Koved, L., & Sreedhar, V. C. (2005) · Lecture notes in computer science · doi:10.1007/11531142_16 · Cited by 54
Self-citation
Cited by
SmartCheck: static analysis of ethereum smart contracts
Tikhomirov, S., Voskresenskaya, E., Ivanitskiy, I., Takhaviev, R., Marchenko, E., & Alexandrov, Y. (2018) · Proceedings of the 1st International Workshop on Emerging Trends in Software Engineering for Blockchain · doi:10.1145/3194113.3194115 · Cited by 672
IccTA: Detecting Inter-Component Privacy Leaks in Android Apps
Li, L., Bartel, A., Bissyande, T. F., Klein, J., Le Traon, Y., Arzt, S., Rasthofer, S., Bodden, E., Octeau, D., & McDaniel, P. (2015) · 2015 IEEE/ACM 37th IEEE International Conference on Software Engineering · doi:10.1109/icse.2015.48 · Cited by 608
Gibler, C., Crussell, J., Erickson, J., & Chen, H. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-30921-2_17 · Cited by 488
Information-Flow Analysis of Android Applications in DroidSafe
Gordon, M. I., Kim, D., Perkins, J., Gilham, L., Nguyen, N., & Rinard, M. (2015) · Proceedings 2015 Network and Distributed System Security Symposium · doi:10.14722/ndss.2015.23089 · Cited by 429
AppIntent: analyzing sensitive data transmission in android for privacy leakage detection
Yang, Z., Yang, M., Zhang, Y., Gu, G., Ning, P., & Wang, X. S. (2013) · Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security - CCS '13 · doi:10.1145/2508859.2516676 · Cited by 348
Metadata
- Authors
- Tripp, O., Pistoia, M., Fink, S. J., Sridharan, M., & Weisman, O.
- Venue
- Proceedings of the 30th ACM SIGPLAN Conference on Programming Language Design and Implementation
- Publisher
- ACM
- Published
- 2009-06-15
- Pages
- 87-97
- ISSN
- 1531-7102 (ISSN-L)
- OpenAlex
- W2125357166
- Cited by
- 308
- References
- 27
- FWCI
- 14.94
- Type
- conference paper
- 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.