.png){kind=icon}
.png){kind=icon}
Return
Debloating Software Through Enhanced Static Analysis and Constraint Rules
.png){kind=icon}
PRE
AI
DOI：10.1002/spe.70003.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Java applications often bloat, consuming more resources than necessary. Existing bytecode debloating techniques have several limitations, such as compromised correctness caused by incomplete code collection, which leads to false positives. The debloating process is resource-intensive because it relies significantly on the test coverage to identify unnecessary code. This method is particularly problematic for large-enterprise applications, where executing a single test case can take hours or days. In addition, most available debloating tools are standalone utilities that require manual configuration to be integrated with the project-building process.
Keywords:
debloating
dynamic binding
Java bytecode
Java reflection
Journal
S
IF:
2.7
Papers:
84
Citations:
3.2K