LAYERED REACHABILITY ANALYSIS
Authors/Creators
Description
When a CVE is published against a transitive dependency — a dependency of one of your
dependencies — the urgent question is rarely “do we use this library?” It is “is the vulnerable code
path actually reachable from our application?” Most software composition analysis (SCA) tooling
answers a much weaker question: it confirms that a vulnerable artifact is present on the classpath.
Presence is necessary for exploitability, but it is far from sufficient.
This paper describes a pragmatic, three-layer method for answering the reachability question with
progressively stronger evidence. Layer 1 establishes that the vulnerable artifact is genuinely on
the classpath and identifies the transitive path that pulled it in. Layer 2 determines whether the
application’s own code, or the intermediate dependency, actually references the vulnerable
component at the source level. Layer 3 settles the matter empirically: a lightweight runtime agent
built with Byte Buddy instruments the vulnerable method and records whether it is ever invoked
while the system runs under representative workloads.
The result is a triage process that converts a wall of undifferentiated “vulnerable” findings into a
ranked, evidence-backed list — letting teams remediate what is genuinely exploitable, defer what
is not, and document the reasoning behind every decision.
Files
Layered_Reachability_Analysis_White_Paper.pdf
Files
(354.6 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:972057d6e5d329baf9fda20378a54f45
|
354.6 kB | Preview Download |
Additional details
Dates
- Submitted
-
2026-06-11First submission
Software
- Development Status
- Active