safety problem¶
The. (1976). safety problem.
Retired. This entry was not a citation. Our extractor stored an inline prose definition from the article as though it were a bibliographic record, so its title is the name of a concept rather than of a published work. The page is kept because links to it still resolve, but it is withdrawn from the reference list. This entry is kept so the citations that pointed at it still resolve, and so the correction is visible rather than silent.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Mechanisms¶
- Formal Decidability Probe
- In the general access-matrix protection model this safety question — whether a right can ever leak to a subject that should not hold it — is undecidable: no algorithm always halts and answers it for arbitrary policies over unbounded action sequences.
This sourceRestricted models (mono-operational or otherwise bounded systems) regain decidability, which is why a decidability probe pairs the impossibility finding with the fragment that is still checkable.
- In the general access-matrix protection model this safety question — whether a right can ever leak to a subject that should not hold it — is undecidable: no algorithm always halts and answers it for arbitrary policies over unbounded action sequences.
Verification¶
This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.
Registry ID ref:68ac2e05ff35 · see in the full table