Research proof index

The verifyNeverMatches analysis is complete: if the assertions verifyNeverMatches p εnv are satisfiable for the policy p and the strongly well-formed symbolic environment εnv, then there exists a strongly well-formed concrete environment env ∈ᵢ εnv such that the evaluator will return .ok true when applied to p and env.

Alternate definition of completeness for neverMatches: For a singleton policyset, if symcc says the policy does not neverMatch, then there exists a concrete environment where the policy appears in determiningPolicies.

Alternate definition of soundness for neverMatches: For a singleton policyset, if symcc says the policy neverMatches, then the spec authorizer should say it never appears in determiningPolicies.