IEEE Transactions on Software Engineering · 1987 · 116 citations · 1 references
ComputingComputer ScienceComputer SecurityFormal MethodsSecurity PolicyDeductive VerificationSecurity RequirementsAbstract Model CheckingAbstract Model ConstructionPolicy Expressiveness
A noninterference formulation of MLS applicable to the Secure Ada® Target (SAT) Abstract Model is developed. An analogous formulation is developed to handle the SAT type enforcement policy. Unwinding theorems are presented for both MLS and Multidomain Security (MDS) and the SAT Abstract Model is shown to satisfy both MLS and MDS. Generalizations and extensions are also considered.
1
Unwinding and Inference Control
Joseph A. Goguen, José Meseguer · 1984 · 426 citations