A CFL-Reachability Formulation of Callsite-Sensitive Pointer Analysis with Built-In On-The-Fly Call Graph Construction

Dongjie He, J. L., & Xue, J. (2024). A CFL-Reachability Formulation of Callsite-Sensitive Pointer Analysis with Built-In On-The-Fly Call Graph Construction.

Type

Unclassified

Intellectual base

Unclassified

Year

2024

DOI

10.4230/lipics.ecoop.2024.18

Link

https://doi.org/10.4230/lipics.ecoop.2024.18

Cited by

1 citation across 1 artifact.

Domain-specific

• Context-free language reachability
  • Given a labeled directed graph, grammar, and endpoint query, CFL reachability asks for a path whose label word is derivable from the grammar, with variants returning pairs or paths.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:15f6dda2c698 · see in the full table