The Dynamics of Software Composition Analysis

Abstract

Developers today use significant amounts of open source code, surfacing the need for ways to automatically audit and upgrade library dependencies, and giving rise to the subfield of Software Composition Analysis (SCA). SCA products are concerned with three tasks: discovering dependencies, checking the reachability of vulnerable code for false positive elimination, and automated remediation. The latter two tasks rely on call graphs of application and library code to check whether vulnerability-specific sinks identified in libraries are used by applications. However, statically-constructed call graphs introduce both false positives and false negatives on real-world projects. In this paper, we develop a novel, modular means of combining call graphs derived from both static and dynamic analysis to improve the performance of false positive elimination. Our experiments indicate significant performance improvements.

ASE 2019, LBR

References in corpus (5)

• Continuous Integration, Delivery and Deployment: A Systematic Review on Approaches, Tools, Challenges and Practices
• Do Developers Update Their Library Dependencies? An Empirical Study on the Impact of Security Advisories on Library Migration
• Thou Shalt Not Depend on Me: Analysing the Use of Outdated JavaScript Libraries on the Web
• Beyond Metadata: Code-centric and Usage-based Analysis of Known Vulnerabilities in Open-source Software
• A Practical Approach to the Automatic Classification of Security-Relevant Commits