Documentation

Cedar.Thm.WellTypedVerification

This file connects soundness theorems in Cedar.Thm.Verification with policy validation.

We prove that if validation of a policy (set) succeeds in the sense of wellTypedPolicy/wellTypedPolicies), then various verification tasks would produce a symbolic encoding without errors, and is sound with respect to concrete Envs.

Concrete version of verifyNeverErrors_is_sound.

NOTE: This theorem and many of the following soundness theorems use env.StronglyWellFormedForPolicy p' in the conclusion rather than env.StronglyWellFormedForPolicy p.

One can obtain a weaker version with env.StronglyWellFormedForPolicy p, using the lemma wellTypedPolicy_preserves_StronglyWellFormedForPolicy.

Concrete version of verifyEquivalent_is_sound.

Concrete version of verifyDisjoint_is_sound.

Concrete version of verifyImplies_is_sound.

Concrete version of verifyAlwaysDenies_is_sound.

Concrete version of verifyAlwaysAllows_is_sound.