Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/154605
Title: An integrated approach for effective injection vulnerability analysis of web applications through security slicing and hybrid constraint solving
Authors: Thome, Julian
Shar, Lwin Khin
Bianculli, Domenico
Briand, Lionel
Keywords: Engineering::Computer science and engineering
Issue Date: 2020
Source: Thome, J., Shar, L. K., Bianculli, D. & Briand, L. (2020). An integrated approach for effective injection vulnerability analysis of web applications through security slicing and hybrid constraint solving. IEEE Transactions On Software Engineering, 46(2), 163-195. https://dx.doi.org/10.1109/TSE.2018.2844343
Journal: IEEE Transactions on Software Engineering
Abstract: Malicious users can attack Web applications by exploiting injection vulnerabilities in the source code. This work addresses the challenge of detecting injection vulnerabilities in the server-side code of Java Web applications in a scalable and effective way. We propose an integrated approach that seamlessly combines security slicing with hybrid constraint solving; the latter orchestrates automata-based solving with meta-heuristic search. We use static analysis to extract minimal program slices relevant to security from Web programs and to generate attack conditions. We then apply hybrid constraint solving to determine the satisfiability of attack conditions and thus detect vulnerabilities. The experimental results, using a benchmark comprising a set of diverse and representative Web applications/services as well as security benchmark applications, show that our approach (implemented in the JOACO tool) is significantly more effective at detecting injection vulnerabilities than state-of-the-art approaches, achieving 98 percent recall, without producing any false alarm. We also compared the constraint solving module of our approach with state-of-the-art constraint solvers, using six different benchmark suites; our approach correctly solved the highest number of constraints (665 out of 672), without producing any incorrect result, and was the one with the least number of time-out/failing cases. In both scenarios, the execution time was practically acceptable, given the offline nature of vulnerability detection.
URI: https://hdl.handle.net/10356/154605
ISSN: 0098-5589
DOI: 10.1109/TSE.2018.2844343
Rights: © 2018 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission.
Fulltext Permission: none
Fulltext Availability: No Fulltext
Appears in Collections:SCSE Journal Articles

Page view(s)

26
Updated on May 19, 2022

Google ScholarTM

Check

Altmetric


Plumx

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.