Communications of the ACM · 1977 · 1K citations · 28 references
ComputingComputer EngineeringComputer ScienceCompilersComputer SecurityFormal MethodsControl-flow AnalysisData-flow AnalysisDeductive VerificationSystem SecuritySecure Information Flow
ertification mechanism for verifying the secure flow of information through a program. Because it exploits the properties of a lattice structure among security classes, the procedure is sufficiently simple that it can easily be included in the analysis phase of most existing compilers. Appropriate semantics are presented and proved correct. An important application is the confinement problem: The mechanism can prove that a program cannot cause supposedly nonconfidential results to depend on confidential input data.
28
Computation: Finite and Infinite Machines.
D. A. Clarke, Marvin Minsky · American Mathematical Monthly · 1968 · 2.6K citations
A lattice model of secure information flow
Dorothy E. Denning · Communications of the ACM · 1976 · 1.9K citations · Full text
A note on the confinement problem
Butler Lampson · Communications of the ACM · 1973 · 1.4K citations · Full text
Frances Allen · ACM SIGPLAN Notices · 1970 · 720 citations