Su, Zhendong
ETH Zurich
7 papers on CoChatORCID 0000-0002-2970-1391
Most cited papers
- Verified
DECKARD: Scalable and Accurate Tree-Based Detection of Code Clones
Jiang, L., Misherghi, G., Su, Z., & Glondu, S. (2007) · 29th International Conference on Software Engineering (ICSE'07)
Software Engineering ResearchData Quality and Management
Cited by 1,039
- Verified
The essence of command injection attacks in web applications
Su, Z., & Wassermann, G. (2006) · Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Web Application Security VulnerabilitiesSecurity and Verification in Computing
Cited by 515
- Verified
On the naturalness of software
Hindle, A., Barr, E. T., Su, Z., Gabel, M., & Devanbu, P. (2012) · 2012 34th International Conference on Software Engineering (ICSE)
Software Engineering ResearchNatural Language Processing Techniques
Cited by 425
- Verified
Compiler validation via equivalence modulo inputs
Le, V., Afshari, M., & Su, Z. (2014) · Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and Implementation
Software Testing and Debugging TechniquesLogic, programming, and type systems
Cited by 388
- Verified
On the naturalness of software
Hindle, A., Barr, E. T., Gabel, M., Su, Z., & Devanbu, P. (2016) · Communications of the ACM
Software Engineering ResearchNatural Language Processing Techniques
Cited by 307
- Verified
On the localness of software
Tu, Z., Su, Z., & Devanbu, P. (2014) · Proceedings of the 22nd ACM SIGSOFT International Symposium on Foundations of Software Engineering
Software Engineering ResearchNatural Language Processing Techniques
Cited by 238
- Verified
Validating SMT solvers via semantic fusion
Winterer, D., Zhang, C., & Su, Z. (2020) · Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation
Formal Methods in VerificationLogic, programming, and type systems
Cited by 82
Go further with a free account
Verify every reference, keep papers in a library, and ask questions across them.
Sign up - it is free