arXiv (All)
open access
Dense Interprocedural Dominance in Acyclic Graphs: Context Bounds and Compact Queries
Interprocedural dominance asks which program points every matched call-and-return execution must pass on its way to a target. An analysis that writes out immediate dominance pays for the transitive reduction of this order, the minimal dominator graph. Measured instances of that graph look near-linea
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Associativity and Commutativity in Equality Saturation#1156470
- The 11/6 supremum of the Wang-Sitters rounding scheme for graph balancing#998384
- Tight Energy Lower Bounds for Distributed Graph Algorithms#467099
- Transience Bounds for Distributed Algorithms#629689
- 42 U.S.C. § 16277 — High-performance computation and supportive research#589012
Record · ID 1064362
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive