nordisk/heimdall

Part 5 of 5 of docs/v2/graph-filter.md (generated; edit the source)

13. Questions for the reviewer

1. Async. Position is per kernel thread, and tasks on one thread give the union. How much precision is left on a real executor, where almost any task can run next?
2. The C boundary. Is a libc function as one unordered node acceptable, or does graph mode need the order inside libc before it says more than static mode?
3. io_uring. For ring-heavy programs, is "syscall position + ring opcode restrictions + LSM hooks" a sound answer, or must Heimdall own the ring to follow its operations?
4. The numbers. Are S, P, S₂, P₂ on next-call pairs the right gates? Would longer windows find analyzer errors that pairs miss?
5. The cost. Which measurements should decide whether the follower is cheap enough: t_follow on a busy server, t_idle on the host's other processes, the size of the deterministic graph? What would make the result unacceptable?

This is the last part of docs/v2/graph-filter.md.