Expand description
Deterministic, located dataflow graphs.
Structs§
- Admitted
Transfer - A transfer policy that passed the public dataflow law suite.
- Causal
Predecessor - One causal predecessor retained for a changed node state.
- Dataflow
Completion Proof - An immutable witness that a precise set of dataflow inputs reached a fixpoint.
- Dataflow
Continuation - A content-bound snapshot of an incomplete deterministic worklist solve.
- Dataflow
Explanation - A bounded explanation that cannot masquerade as complete after truncation.
- Dataflow
Graph - Immutable, canonically ordered, content-identified dataflow structure.
- Dataflow
Solution - A converged, fully accounted dataflow solution.
- Dataflow
Usage - Exact resources consumed by a completed run.
- Edge
- One immutable graph edge.
- Edge
Spec - An edge supplied to checked graph construction.
- Fixpoint
Engine - Deterministic worklist solver for admitted monotone analyses.
- LawSuite
- Public reusable law suite for lattice and transfer admission.
- LawViolation
- A precise admission refusal.
- Node
- One immutable graph node.
- Node
Spec - A node supplied to checked graph construction.
Enums§
- Boundary
- A node’s declared relationship to the graph boundary.
- Completion
Proof Mismatch - Why a completion proof cannot be presented for the supplied inputs.
- Continuation
Fingerprint - Content identity checked before a suspended solve may resume.
- Dataflow
Error - A located fixpoint refusal.
- Dataflow
Event - A stable observation from one fixpoint run.
- Dataflow
Failure - The operation whose contract failed while solving a graph.
- Dataflow
Law - A law whose failure makes a lattice or transfer policy inadmissible.
- Dataflow
Progress - Outcome of a resumable solve step.
- Edge
Class - The semantic class of an edge.
- Graph
Build Error - A checked graph-construction refusal.
- Graph
Direction - The direction in which an edge propagates.
Constants§
- DATAFLOW_
PROOF_ SCHEMA_ REVISION - Schema revision mixed into every completion-proof identity.
Traits§
- Join
Semilattice - A join semilattice with a least element.
- Located
Graph Adapter - Projects an external located representation into neutral graph declarations.
- State
Size - State that can report the memory it contributes to a dataflow solution.
- Transfer
Policy - A deterministic, inflationary dataflow transfer with stable proof identity.
Type Aliases§
- Adapted
Graph - The neutral graph produced by a particular located adapter.
- Adapter
Build Result - The checked construction result produced by a located adapter.
- Completion
Proof Result - Result of a clean or incremental proof-producing fixpoint solve.
- Dataflow
Progress Result - Result of one resumable fixpoint step.
- Dataflow
Result - Result of one fixpoint solve.