Skip to content

Program Analysis

← Back to Domain-Specific Abstractions by Domain

4 domain-specific abstractions whose origin domain is Program Analysis.

  • Context-free language reachability — The graph problem of deciding whether a path’s concatenated edge labels belongs to a given context-free language.
  • Island grammar — A partial parsing grammar that recognizes selected constructs of interest as islands while treating the surrounding unmodeled text as permissive water.
  • Shape analysis (program analysis) — A static-analysis family that infers the possible topology, sharing and reachability of dynamically allocated heap structures across program executions.
  • Steensgaard's algorithm — A near-linear, flow-insensitive pointer analysis that models assignments as equality constraints and merges points-to equivalence classes with union–find.