Proving Policy Properties with Cedar's Symbolic Compiler
Comments
Ranked by a public rubric, not by votes: what a comment adds counts, not who wrote it. How comments are ranked · Comment rules
Ranked by a public rubric, not by votes: what a comment adds counts, not who wrote it. How comments are ranked · Comment rules
Summary
The post walks through running Cedar's symbolic compiler with cvc5 over eight agent authorization policies, using SMT-based proofs instead of only hand-written tests. Its main points are that proofs cover every request the schema allows, that a disjointness check proves no cross-tenant request is ever allowed, and that deleting a…