{"uid":"cap_BRoticPBvnNHQHxNzok5e","slug":"ssa-phi-placement-validator-minimal-ssa-control-flow-graph-e029dd14","name":"SSA Phi Placement Validator (Minimal SSA, Control-Flow Graph)","description":"An agent that hands over a workflow compiler needs its claimed unpruned SSA phi placements checked against iterated dominance frontiers in the supplied control-flow graph.","url":"https://detect.halowerk.com/v1/workflow/workflow-minimal-ssa-phi-placement?utm_source=zero.xyz","method":"POST","headers":{},"bodySchema":{"type":"object","properties":{"artifact":{"type":"object","required":["nodes","variables","edges","definitions","claimed_phi"],"properties":{"edges":{"type":"array","items":{"type":"array","items":{"type":"integer","maximum":31,"minimum":0},"maxItems":2,"minItems":2},"maxItems":256,"minItems":0},"nodes":{"type":"integer","maximum":32,"minimum":1},"variables":{"type":"integer","maximum":16,"minimum":1},"claimed_phi":{"type":"array","items":{"type":"object","required":["node","variable"],"properties":{"node":{"type":"integer","maximum":31,"minimum":0},"variable":{"type":"integer","maximum":15,"minimum":0}},"additionalProperties":false},"maxItems":512,"minItems":0},"definitions":{"type":"array","items":{"type":"object","required":["node","variable"],"properties":{"node":{"type":"integer","maximum":31,"minimum":0},"variable":{"type":"integer","maximum":15,"minimum":0}},"additionalProperties":false},"maxItems":256,"minItems":0}},"additionalProperties":false}}},"responseSchema":null,"example":null,"exampleRequest":null,"tags":["x402"],"displayCostAmount":"0.002","displayCostAsset":"USDC","priceDynamic":false,"priceHint":null,"priceStatus":"priced","priceSource":"probe","requiresHandshake":false,"reviewCount":0,"rating":{"score":"0.00","successRate":"0.00","reviews":0,"stars":null,"state":"unrated"},"availabilityStatus":"unknown","priceObserved":null,"sessionDeposit":null,"pricing":{"kind":"static","summary":"$0.002/call","primary":{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.002","per":"call","confidence":"exact"},"accepted":[{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.002","per":"call","confidence":"exact"}]},"paymentMethods":[{"uid":"pm_uPfjxSeP7lGgzQXK6IWH8","protocol":"x402","methodType":"crypto","chain":"base","mode":"charge","costAmount":"0.002","costPer":"request","priority":0,"asset":"0x833589fCD6eDb6E08f4c7C32D4f71b54bdA02913","unit":"request","depositMicros":null,"planRef":null}],"brandName":null,"brandSlug":null,"brandBaseUrl":null,"brandDocsUrl":null,"whatItDoes":"Verifies that claimed SSA phi-function placements in a control-flow graph are correct according to iterated dominance frontier analysis.","exampleAgentPrompt":"Check whether my claimed phi placements are correct for a 6-node CFG with 3 variables: edges [[0,1],[0,2],[1,3],[2,3],[3,4],[4,5]], definitions at node 0 for variable 0 and node 2 for variable 1, and claimed phi placements of variable 0 at node 3 and variable 1 at node 3.","exampleUseCases":[{"title":"Compiler pass SSA correctness audit","prompt":"I have a compiler workflow that generates SSA form — can you verify that the phi placements it claims are actually correct for my CFG? It has 8 nodes, edges [[0,1],[0,2],[1,3],[2,3],[3,4],[3,5],[4,6],[5,6]], 4 variables defined at various nodes, and the compiler claims phi nodes for variable 2 at node 3 and variable 0 at node 6."},{"title":"Student SSA assignment verification","prompt":"I'm working through an SSA phi placement exercise by hand on a 5-node CFG with edges [[0,1],[0,2],[1,3],[2,3],[3,4]] and 2 variables defined at nodes 0 and 1. Can you check if my claimed phi placements — variable 0 at node 3, variable 1 at node 3 — are correct according to iterated dominance frontiers?"},{"title":"Automated CFG phi-placement regression test","prompt":"My IR optimizer transforms CFGs and I want to catch regressions in phi placement: here's a 10-node graph with edges [[0,1],[1,2],[1,3],[2,4],[3,4],[4,5],[5,6],[5,7],[6,8],[7,8]], 5 variables with definitions scattered across nodes, and a set of claimed phi placements — please tell me which ones are wrong or missing."}],"resultDescription":"The endpoint returns a determination of whether each claimed phi placement is valid per iterated dominance frontier rules — identifying any incorrectly placed phi nodes (false positives), any missing phi nodes required by the dominance frontier (false negatives), and an overall pass/fail verdict for the claimed SSA phi placement set.","failureModes":["Invalid edge references (node indices out of range for declared node count)","Disconnected CFG with no reachable path from entry node","Claimed phi placements referencing undefined variables","Input exceeds schema limits (>32 nodes, >16 variables, >256 edges)","Malformed artifact object missing required fields (nodes, variables, edges, definitions, claimed_phi)"],"whenToPreferThis":"Use this endpoint when you need to formally verify SSA phi placement correctness against iterated dominance frontier theory, especially in compiler or program analysis pipelines where phi node accuracy is critical. Prefer this over manual calculation when CFGs have complex branching or many variables. This is specifically suited for checking claimed placements rather than generating them from scratch.","instructions":null,"reviewSummary":null,"reviewSummaryHighlights":null,"reviewSummaryConcerns":null,"reviewSummaryGeneratedAt":null,"activationCount":0,"lastUsedAt":null,"lastSuccessfullyRanAt":null,"lastHealthCheckAt":"2026-11-04T06:39:59.940Z","isFirstParty":false,"canonicalSlug":"ssa-phi-placement-validator-minimal-ssa-control-flow-graph-e029dd14"}