Input splitting for cloud-based static application security testing platforms
Open accessThe DOI matches its Crossref record; 44 of the 44 references it cites were found in a registry or an index.
Abstract
As software development teams adopt DevSecOps practices, application security is increasingly the responsibility of development teams, who are required to set up their own Static Application Security Testing (SAST) infrastructure.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cites
Knapsack problems, algorithms and computer implementations
De Kort, J. (1991) · European Journal of Operational Research · doi:10.1016/0377-2217(91)90159-s · Cited by 1,402
Extended static checking for Java
Flanagan, C., Leino, K. R. M., Lillibridge, M., Nelson, G., Saxe, J. B., & Stata, R. (2002) · Proceedings of the ACM SIGPLAN 2002 conference on Programming language design and implementation · doi:10.1145/512529.512558 · Cited by 1,340
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
A Survey of Community Detection Approaches: From Statistical Modeling to Deep Learning
Jin, D., Yu, Z., Jiao, P., Pan, S., He, D., Wu, J., Yu, P., & Zhang, W. (2021) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2021.3104155 · Cited by 397
Moving Fast with Software Verification
Calcagno, C., Distefano, D., Dubreil, J., Gabi, D., Hooimeijer, P., Luca, M., O’Hearn, P., Papakonstantinou, I., Purbrick, J., & Rodriguez, D. (2015) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-17524-9_1 · Cited by 261
Extraction of Microservices from Monolithic Software Architectures
Mazlami, G., Cito, J., & Leitner, P. (2017) · 2017 IEEE International Conference on Web Services (ICWS) · doi:10.1109/icws.2017.61 · Cited by 255
From Monolith to Microservices: A Classification of Refactoring Approaches
Fritzsch, J., Bogner, J., Zimmermann, A., & Wagner, S. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-06019-0_10 · Cited by 218
Demand-driven alias analysis for C
Zheng, X., & Rugina, R. (2008) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/1328438.1328464 · Cited by 181
Balachandran, V. (2013) · 2013 35th International Conference on Software Engineering (ICSE) · doi:10.1109/icse.2013.6606642 · Cited by 178
Tricorder: Building a Program Analysis Ecosystem
Sadowski, C., Van Gogh, J., Jaspan, C., Soderberg, E., & Winter, C. (2015) · 2015 IEEE/ACM 37th IEEE International Conference on Software Engineering · doi:10.1109/icse.2015.76 · Cited by 145
Arzt, S., & Bodden, E. (2014) · ACM/IEEE International Conference on Software Engineering: Companion Proceedings (ICSE-Companion) · doi:10.1145/2568225.2568243 · Cited by 116
Graph Neural Network to Dilute Outliers for Refactoring Monolith Application
Desai, U., Bandyopadhyay, S., & Tamilselvam, S. (2021) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v35i1.16079 · Cited by 115
StubDroid: automatic inference of precise data-flow summaries for the android framework
Arzt, S., & Bodden, E. (2016) · ACM/IEEE International Conference on Software Engineering: Companion Proceedings (ICSE-Companion) · doi:10.1145/2884781.2884816 · Cited by 109
Trabish, D., Mattavelli, A., Rinetzky, N., & Cadar, C. (2018) · ACM/IEEE International Conference on Software Engineering: Companion Proceedings (ICSE-Companion) · doi:10.1145/3180155.3180251 · Cited by 108
The set constraint/CFL reachability connection in practice
Kodumal, J., & Aiken, A. (2004) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/996841.996867 · Cited by 98
Accurate Interprocedural Null-Dereference Analysis for Java
Nanda, M. G., & Sinha, S. K. (2009) · ACM/IEEE International Conference on Software Engineering: Companion Proceedings (ICSE-Companion) · doi:10.1109/icse.2009.5070515 · Cited by 95
Wang, K., Hussain, A., Zuo, Z., Xu, G. H., & Sani, A. A. (2017) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/3037697.3037744 · Cited by 92
An Incremental Points-to Analysis with CFL-Reachability
Lu, Y. B., Shang, L., Xie, X., & Xue, J. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-37051-9_4 · Cited by 91
Kalia, A. K., Xiao, J., Krishna, R., Sinha, S., Vukovic, M., & Banerjee, D. (2021) · Proceedings of the 29th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering · doi:10.1145/3468264.3473915 · Cited by 90
Fast polyhedra abstract domain
Singh, G., Püschel, M., & Vechev, M. (2016) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/3009837.3009885 · Cited by 87
Parallel inclusion-based points-to analysis
Méndez-Lojo, M., Mathew, A., & Pingali, K. K. (2010) · Conference on Object-Oriented Programming Systems, Languages, and Applications · doi:10.1145/1869459.1869495 · Cited by 85
CFA2: A Context-Free Approach to Control-Flow Analysis
Vardoulakis, D., & Shivers, O. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-11957-6_30 · Cited by 76
On the cubic bottleneck in subtyping and flow analysis
Heintze, N., & McAllester, D. (2002) · ACM/IEEE Symposium on Logic in Computer Science (LICS) · doi:10.1109/lics.1997.614960 · Cited by 75
Incremental Algorithms for Inter-procedural Analysis of Safety Properties
Conway, C. L., Namjoshi, K. S., Dams, D. R., & Edwards, S. A. (2005) · Lecture notes in computer science · doi:10.1007/11513988_45 · Cited by 73
Distributed LTL model-checking in SPIN
Barnat, J., Brim, L., & Stříbrná, J. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45139-0_13 · Cited by 73
Load Balancing Parallel Explicit State Model Checking
Kumar, R., & Mercer, E. G. (2005) · Electronic Notes in Theoretical Computer Science · doi:10.1016/j.entcs.2004.10.016 · Cited by 64
Quang, L. N., Ali, K., Livshits, B., Bodden, E., Smith, J., & Murphy-Hill, E. R. (2017) · ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA) · doi:10.1145/3092703.3092705 · Cited by 64
Program Analysis via Graph Reachability
Reps, T. (1997) · The MIT Press eBooks · doi:10.7551/mitpress/4283.003.0008 · Cited by 60
A Tight Asymptotic Bound for Next-Fit-Decreasing Bin-Packing
Baker, B. S., & Coffman, Jr. (1981) · SIAM Journal on Algebraic Discrete Methods · doi:10.1137/0602019 · Cited by 59
Specification Inference Using Context-Free Language Reachability
Bastani, O., Anand, S., & Aiken, A. (2015) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/2676726.2676977 · Cited by 53
IDE Dataflow Analysis in the Presence of Large Object-Oriented Libraries
Rountev, A., Sharp, M., & Xu, G. H. (2008) · Springer eBooks · doi:10.1007/978-3-540-78791-4_4 · Cited by 53
Parallel Pointer Analysis with CFL-Reachability
Su, Y., Ye, D., & Xue, J. (2014) · Proceedings of the International Conference on Parallel Processing · doi:10.1109/icpp.2014.54 · Cited by 50
Achieving Speedups in Distributed Symbolic Reachability Analysis Through Asynchronous Computation
Grümberg, O., Heyman, T., Ifergan, N., & Schuster, A. (2005) · Lecture notes in computer science · doi:10.1007/11560548_12 · Cited by 41
Parallelizing top-down interprocedural analyses
Albarghouthi, A., Kumar, R., Nori, A. V., & Rajamani, S. K. (2012) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/2254064.2254091 · Cited by 37
Making defect-finding tools work for you
Nanda, M. G., Gupta, M., Sinha, S. K., Chandra, S., Schmidt, D. A., & Balachandran, P. (2010) · ACM/IEEE International Conference on Software Engineering: Companion Proceedings (ICSE-Companion) · doi:10.1145/1810295.1810310 · Cited by 34
Grapple: A Graph System for Static Finite-State Property Checking of Large-Scale Systems Code
Zuo, Z., Thorpe, J., Wang, Y., Pan, Q., Lu, S., Wang, K., Xu, G. H., Wang, L., & Li, X. (2019) · European Conference on Computer Systems · doi:10.1145/3302424.3303972 · Cited by 31
Actor-Based Parallel Dataflow Analysis
Rodriguez, J., & Lhoták, O. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-19861-8_11 · Cited by 29
Toward full elasticity in distributed static analysis: the case of callgraph analysis
Garbervetsky, D., Zoppi, E., & Livshits, B. (2017) · ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering (ESEC/FSE) · doi:10.1145/3106237.3106261 · Cited by 27
An Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees
Yuan, H., & Eugster, P. T. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-00590-9_13 · Cited by 24
Incremental Flow Analysis through Computational Dependency Reification
der Plas, J. V., Stiévenart, Q., Es, N. V., & Roover, C. D. (2020) · IEEE International Working Conference on Source Code Analysis and Manipulation (SCAM) · doi:10.1109/scam51674.2020.00008 · Cited by 24
RAPID: checking API usage for the cloud in the cloud
Emmi, M., Hadarean, L., Jhala, R., Pike, L., Rosner, N., Schäf, M., Sengupta, A., & Visser, W. (2021) · ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering (ESEC/FSE) · doi:10.1145/3468264.3473934 · Cited by 21
Self-citationContinuous code-quality assurance with SAFE
Geay, E., Yahav, E., & Fink, S. J. (2006) · ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation (PEPM) · doi:10.1145/1111542.1111567 · Cited by 15
BigSpa: An Efficient Interprocedural Static Analysis Engine in the Cloud
Zuo, Z., Gu, R., Jiang, X., Wang, Z., Huang, Y., Wang, L., & Li, X. (2019) · IEEE International Parallel and Distributed Processing Symposium (IPDPS) · doi:10.1109/ipdps.2019.00086 · Cited by 14
From continuous integration to continuous assurance
Kupsch, J. A., Miller, B. P., Basupalli, V., & Burger, J. (2017) · IEEE Annual Software Technology Conference (STC) · doi:10.1109/stc.2017.8234450 · Cited by 8
Research works printed but not linked: 2
- SonarSource S.A.. 2008. Sonarqube: a Static Application Security Testing (SAST) solution to detect security issues in code review. https://www.sonarqube.org/features/security/ SonarSource S.A.. 2008. Sonarqube: a Static Application Security Testing (SAST) solution to detect security issues in code review. https://www.sonarqube.org/features/security/
- 10.1145/1328438.1328464 · DOI
Cited by
Prates, L., & Pereira, R. (2025) · International Journal of Information Security · doi:10.1007/s10207-024-00914-z · Cited by 49
“SAST is a practice that involves analyzing the source code, bytecode, or binary code of an application to identify and assess potential security vulnerabilities, such as code-level issues and design flaws [52] [54] [39].”
Saleh, S. M., Madhavji, N. H., & Steinbacher, J. (2024) · International Conference on Web Information Systems and Technologies · doi:10.5220/0013018500003825 · Cited by 44
BigDataflow: A Distributed Interprocedural Dataflow Analysis Framework
Sun, Z., Xu, D., Zhang, Y., Qi, Y. F., Wang, Y., Zuo, Z., Wang, Z., Li, Y., Li, X., Lu, Q., et al. (2023) · ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering (ESEC/FSE) · doi:10.1145/3611643.3616348 · Cited by 16
Compositional Taint Analysis for Enforcing Security Policies at Scale
Banerjee, S., Cui, S., Emmi, M., Filieri, A., Hadarean, L., Li, P., Luo, L., Piskachev, G., Rosner, N., Sengupta, A., et al. (2023) · ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering (ESEC/FSE) · doi:10.1145/3611643.3613889 · Cited by 14
Self-citationXie, X., Fan, G., Lin, X., Zhou, A., Li, S., Zheng, X., Liang, Y., Zhang, Y., Yu, N., Li, H., et al. (2026) · IEEE/ACM International Conference on Software Engineering: Software Engineering in Practice (ICSE-SEIP) · doi:10.1145/3786583.3786907 · Cited by 5
Metadata
- Authors
- Christakis, M., Cottenier, T., Filieri, A., Luo, L., Mansur, M. N., Pike, L., Rosner, N., Schäf, M., Sengupta, A., & Visser, W.
- Affiliations
- Max Planck Institute for Software Systems (DE)
- Amazon (United States) (US)
- Amazon (Germany) (DE)
- ORCID
- Venue
- Proceedings of the 30th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering
- Publisher
- ACM
- Published
- 2022-11-07
- Pages
- 1367-1378
- OpenAlex
- W4308643060
- Cited by
- 4
- References
- 44
- Citations by year
- 2026: 1 · 2025: 1 · 2024: 1 · 2023: 1
- FWCI
- 0.57
- Type
- conference paper
- Language
- en
- Open access
- bronze
- doi.org
- Locations
- ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering (ESEC/FSE) (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Software › Software Testing and Debugging Techniques
- Physical Sciences › Computer Science › Information Systems › Web Application Security Vulnerabilities
- Physical Sciences › Computer Science › Information Systems › Software Engineering Research
- Keywords
- static application security testing, DevSecOps, software security
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.