NOMOS: Compiling Written Policies into Statically Verified Tool-Call Gates for LLM Agents

summary

Video file (mp4)

In short

NOMOS is a four-pass compiler that transforms natural language policies into static, verified tool-call gates for LLM agents. It addresses the risk of relying solely on LLM extraction by inserting a rigorous static verification layer. This mechanism significantly reduces policy violations and ensures deterministic, safe execution at microsecond speeds.

Key concepts

Four-Pass Compiler
NOMOS uses four sequential stages: PARSE, EXTRACT (LLM), RESOLVE (static verification), and MATERIALIZE. This structured approach ensures that the natural language policy is systematically converted into a final, executable rule set, moving from unstructured text to verified code.
Static Verification Pass
This crucial intermediate step mechanically checks every candidate rule generated by the LLM extraction against strict criteria like self-blocking reachability and argument consistency. It acts as a safety filter to catch errors that pure LLM generation might miss, ensuring operational correctness before execution.
Tool-Call Gate
The final output is a deterministic gate that dictates exactly when an agent can call a specific tool based on verified conditions. This ensures the enforcement mechanism is predictable and operates at high speed without needing further LLM calls during runtime.
Domain-Dependent Cost
The cost associated with NOMOS operation varies by task complexity and domain. While simple tasks have low costs, complex ones like slack management incur higher costs. This suggests that the operational benefit of the system is tied to the specific nature of the work being performed.

Terminology used across episodes

This episode discusses

The paper

NOMOS: Compiling Written Policies into Statically Verified Tool-Call Gates for LLM Agents · Read on arXiv

Min-Young Yu, Tony Kim, Jang Won Choi

Corners Co., Ltd.

DOI: 10.5281/zenodo.22123420

Transcript

Introduction to the show: ident: Security Radio. Generated commentary on the latest security and cryptography papers.

Nadia: I'm Nadia, and with me are Elias and Priya, guest researcher.

Elias: Today's paper: "NOMOS: Compiling Written Policies into Statically Verified Tool-Call Gates for LLM Agents".

Nadia: Detailed Summary of NOMOS: Compiling Written Policies into Statically Verified Tool-Call Gates for LLM Agents The research presented in the paper "NOMOS:

Elias: First, who's behind it and why it matters.

Paper summary: Elias: So wrapping up this discussion on NOMOS, the authors are essentially pushing for this idea of coupling LLM-driven policy generation with deterministic enforcement through heavyweight formal machinery >

Nadia: They’re arguing that the safety benefit from that verification mechanism is strong enough to hold up even when tested against a second agent model >

Priya: It suggests a general principle: whenever an LLM writes artifacts that a deterministic system will execute, the missing component is this static verifier standing between them >

Elias: So, if you think about how this works in the real world, it’s not just about making the AI behave better on a benchmark; it’s about ensuring that critical tool executions stay within defined boundaries >

Nadia: They are showing that this isn't some abstract theory; they've shown concrete reductions in violations, from sixty-six point three percent down to two point six percent >

Priya: The paper lays out the title NOMOS: Compiling Written Policies into Statically Verified Tool-Call Gates for LLM Agents as a way to formalize this necessity >

Elias: It’s about turning natural language policies into gates that are mechanically checked, so you don't rely solely on the LLM's ability to write something correct >

Conclusion: Nadia: So we’ve gone through how NOMOS actually builds these gates, but now we need to talk about what this whole project really means for our work here on agent safety and control >

Elias: Yeah, looking at the title itself, "NOMOS," it sounds pretty serious, like a system of laws or rules being applied mechanically >

Priya: It’s about taking policies that an LLM writes in plain English and turning them into something that a computer can check rigorously before it ever runs anything >

Nadia: Exactly. The authors are showing how you don't just trust the LLM to write something safe; you need a formal way to verify those rules >

Elias: They’re proposing this four-pass compiler where the static verification step is the core idea, not just a nice add-on >

Priya: The big implication for us is that we don't have to rely on just scaling up the LLM's ability to write good rules anymore >

Nadia: It’s about making sure that even if the LLM hallucinates something dangerous, the verification layer catches it before it becomes an execution problem >

Elias: I think what’s really interesting is how they frame this as a necessary component for safety, not just a convenience >

Priya: They did show that this static check actually makes the system much more robust against those kinds of errors we see in testing >

Nadia: It moves the problem from being purely about LLM instruction following to being about ensuring deterministic execution at the gate level >

Elias: And if you look at their results, it shows that this structural verification really helps cut down on violations when dealing with state-changing calls >

Priya: I mean, they saw a big drop in errors on those airline policies and retail ones when they used this method compared to just letting the LLM do it >

Nadia: It’s not just about getting better scores on benchmarks; it's about building a system where the cost of being wrong is much lower than what we see now >

Elias: So, while this is a specific technique for policy compilation, the underlying idea seems to be that any LLM artifact going into a deterministic execution engine needs this formal check >

Priya: It suggests that for critical agent tasks, the verification layer isn't optional; it’s a structural requirement for reliability >

More episodes

← Home