Theorem Catalog
93 proved · 0 sorry · 93 total
Condition Key Evaluation (IamExplainer.Condition)
| Status | Name | Description |
|---|---|---|
| 🟢 proved | evalCond_noContext_T_imp | |
| 🟢 proved | evalCond_noContext_tu |
IamExplainer.Ghost.XAGhost
| Status | Name | Description |
|---|---|---|
| 🟢 proved | critical_is_top | |
| 🟢 proved | xaTrust_ghost_conservative |
SCPs, Permission Boundaries, and RCPs (IamExplainer.Layers)
| Status | Name | Description |
|---|---|---|
| 🟢 proved | evalLayers_blocked_noContext_empty | |
| 🟢 proved | evalLayers_noLayers_blocked |
End-to-End IAM Authorization Proofs (IamExplainer.Proofs)
| Status | Name | Description |
|---|---|---|
| 🟢 proved | allows_nocontext_conservative | |
| 🟢 proved | allows_replaceAllow_mono | |
| 🟢 proved | allows_replace_stmt_mono | Generalized statement replacement mono |
| 🟢 proved | emitFixed_narrows | |
| 🟢 proved | grants_complete | Grants completeness and no-context conservatism |
| 🟢 proved | layer_add_monotone | |
| 🟢 proved | layered_nocontext_conservative | |
| 🟢 proved | layers_narrow | Layer theorems: layered evaluation only narrows access. |
| 🟢 proved | matchPattern_ci_congr | |
| 🟢 proved | narrowActions_narrows | |
| 🟢 proved | narrowResources_narrows | NEW: narrowResources_narrows (T3) |
| 🟢 proved | removeAllow_narrows | |
| 🟢 proved | stmtGrantsAction_ci_congr | |
| 🟢 proved | stmtGrantsAction_narrow |
Seclib.Compose.Coverage
| Status | Name | Description |
|---|---|---|
| 🟢 proved | allPass_no_fire | Coverage claims: if all controls pass, chains cannot fire. Go source: chain_engi |
| 🟢 proved | coverage_soundness | |
| 🟢 proved | empty_failing_no_fire |
Seclib.Compose.Dependencies
| Status | Name | Description |
|---|---|---|
| 🟢 proved | failClosed_diagnoses_notRun | Go source: chain_engine.go:494-500 — fail_closed diagnoses on notRun. |
| 🟢 proved | failClosed_diagnoses_unknown | Go source: chain_engine.go:494-500 — fail_closed diagnoses on unknown. |
| 🟢 proved | failOpen_never_diagnoses | Go source: chain_engine.go:505-506 — fail_open never annotates. |
| 🟢 proved | ranOK_never_diagnoses | Go source: chain_engine.go:494-506 — ranOK never triggers any fallback. |
Seclib.Compose.Distance
| Status | Name | Description |
|---|---|---|
| 🟢 proved | chainDistance_mono | |
| 🟢 proved | classify_exploitable_of_fires | |
| 🟢 proved | classify_mono_via_distance | Adding failures can only move exploitability toward exploitable (never away from |
| 🟢 proved | fires_of_classify_exploitable | |
| 🟢 proved | no_nearMiss_threshold_one |
Seclib.Compose.Monotonicity
| Status | Name | Description |
|---|---|---|
| 🟢 proved | chainFires_add_one | |
| 🟢 proved | chainFires_mono | |
| 🟢 proved | failingCount_le_length | failingCount is bounded by the chain’s control count. |
| 🟢 proved | failingCount_mono | |
| 🟢 proved | firingSet_mono | Set-level monotonicity: the set of firing chains never shrinks when the failing |
Seclib.CrossAccount.Monotonicity
| Status | Name | Description |
|---|---|---|
| 🟢 proved | chain_step_necessary | Removing a failing step from a chain at threshold breaks it. |
| 🟢 proved | condition_blocks_wildcard | |
| 🟢 proved | coverage_monotone | Monotonicity and soundness proofs for cross-account trust model. |
| 🟢 proved | externalId_blocks_wildcard | |
| 🟢 proved | orgCondition_blocks_wildcard | |
| 🟢 proved | partition_complete | |
| 🟢 proved | wildcard_complete |
Policy Evaluation Semantics (Seclib.Domain.PolicySem)
| Status | Name | Description |
|---|---|---|
| 🟢 proved | filterMap_narrows | |
| 🟢 proved | grants_complete | grants_complete: if allowed, an Allow statement exists that matches |
| 🟢 proved | narrow_narrows | narrow_narrows: replacing a statement with one that matches fewer requests narro |
| 🟢 proved | nocontext_conservative | nocontext_conservative: if allowed under any context, allowed under noCtx |
| 🟢 proved | removeAllow | removeAllow: removing an Allow statement narrows access |
Seclib.Ghost
| Status | Name | Description |
|---|---|---|
| 🟢 proved | ghost_composition | When scope B resolves a ghost from scope A, the conservative finding from A is s |
| 🟢 proved | ghost_contradiction_detected | Two controls with incompatible ghost assumptions on the same reference cannot co |
Seclib.IAM.Monotonicity
| Status | Name | Description |
|---|---|---|
| 🟢 proved | barrier_demotes | A blocked escalation path is not distance-0 (not exploitable). Barriers demote e |
| 🟢 proved | iam_exploitable_matches_compose | An exploitable IAM escalation maps to Compose’s .exploitable classification. Go |
| 🟢 proved | iam_oneaway_matches_compose | A one-away IAM escalation maps to Compose’s .oneAway classification. |
| 🟢 proved | perm_boundary_monotone | Adding a permission boundary action to a graph that has no escalation path canno |
| 🟢 proved | priv_transitive | If A can reach B and B can reach C, then A can reach C. Soufflé source: rules.dl |
| 🟢 proved | scp_deny_monotone | Adding an SCP deny statement to a graph that has no escalation path cannot creat |
Seclib.Network.Monotonicity
| Status | Name | Description |
|---|---|---|
| 🟢 proved | List.any_of_any_append_left | If any holds on a list, it holds on a superset (append). Go source: reachabili |
| 🟢 proved | canReach_mono_abstract | If membership is preserved, any is preserved. Go source: reachability.go:36-51 |
| 🟢 proved | gated_not_unsat | If a gated egress path exists and no sink path exists, transitiveEgressVerdict r |
| 🟢 proved | isolation_sound | If a host is tagged isolated and no host in the graph can reach it on any port ( |
| 🟢 proved | rule_check_mono | Abstract monotonicity: if a predicate holds when checking any over a set of ru |
| 🟢 proved | transitiveEgress_decomposition | Transitive egress decomposes into two reachability queries: (1) isolated → servi |
| 🟢 proved | unsat_no_gated | Contrapositive: if verdict is UNSAT, no gated path exists. Go source: proof.go:4 |
Action and Resource Pattern Matching (Seclib.Prim.Glob)
| Status | Name | Description |
|---|---|---|
| 🟢 proved | ciEq_toLowerStr | |
| 🟢 proved | matchPatternGo_literal_eq | |
| 🟢 proved | matchPattern_cs_literal_eq | |
| 🟢 proved | matchPattern_literal_mp | |
| 🟢 proved | toLower_eq_question | |
| 🟢 proved | toLower_eq_star |
Statement Combining — Deny Overrides (Seclib.Prim.Rule)
| Status | Name | Description |
|---|---|---|
| 🟢 proved | appliesOf_unknown_conservative | Lemma 4: Unknown applicability is conservative |
| 🟢 proved | conj_narrows | Lemma 3: Conjunction of evaluation gates never widens access |
| 🟢 proved | denyOverrides_add_deny_narrows | Lemma 2: Adding a deny narrows |
| 🟢 proved | denyOverrides_remove_allow_narrows | Lemma 1: Removing an allow rule narrows access |
Seclib.Schema.Capability
| Status | Name | Description |
|---|---|---|
| 🟢 proved | builtinCapabilities_length |
Seclib.Schema.Properties
| Status | Name | Description |
|---|---|---|
| 🟢 proved | appliesToAssetType_contains | |
| 🟢 proved | appliesToAssetType_empty_means_all | ### Theorem 3: Catalog-schema coupling For every control in a catalog, if it dec |
| 🟢 proved | builtin_nonempty | ### Theorem 5: Capability liveness Every capability in the builtin set is a stri |
| 🟢 proved | capability_membership | |
| 🟢 proved | cel_validation_types | ### CEL validation type coverage requiresCELValidation is true exactly for unsaf |
| 🟢 proved | contains_requires_value | |
| 🟢 proved | embed_set_equality | ### Theorem 4: Embed invariant If two sorted lists of control IDs are equal, the |
| 🟢 proved | empty_predicate_no_fields | ### Predicate emptiness An empty predicate yields no field paths. |
| 🟢 proved | eq_requires_value | |
| 🟢 proved | fieldPath_strip_properties_cons | ### Theorem 1: Schema-predicate consistency Every field path in a predicate that |
| 🟢 proved | list_empty_no_value | |
| 🟢 proved | missing_no_value | ### Theorem 2: Null safety Operators missing, present, and list_empty do n |
| 🟢 proved | ne_requires_value | |
| 🟢 proved | null_safety_complete | |
| 🟢 proved | operator_count | |
| 🟢 proved | operator_exhaustive | |
| 🟢 proved | present_no_value | |
| 🟢 proved | severity_total_order | ### Severity ordering is total |