The search of $\operatorname{tg}$-paths and islands for Take-Grant security model
Prikladnaâ diskretnaâ matematika, no. 12 (2010), pp. 46-47
Cet article a éte moissonné depuis la source Math-Net.Ru
The methods for detecting tg-paths and islands in Take-Grant protection model are described.
@article{PDM_2010_12_a21,
author = {D. M. Brechka},
title = {The search of $\operatorname{tg}$-paths and islands for {Take-Grant} security model},
journal = {Prikladna\^a diskretna\^a matematika},
pages = {46--47},
year = {2010},
number = {12},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/PDM_2010_12_a21/}
}
D. M. Brechka. The search of $\operatorname{tg}$-paths and islands for Take-Grant security model. Prikladnaâ diskretnaâ matematika, no. 12 (2010), pp. 46-47. http://geodesic.mathdoc.fr/item/PDM_2010_12_a21/
[1] DoD 5200.28 – std., Department of Defense Trusted Computer System Evaluation Criteria, 1985
[2] Lipton, Richard J., “A Linear Time Algorithm for Deciding Subject Security”, J. ACM, 24:3 (1977), 455–464 | DOI | MR | Zbl
[3] Devyanin P. N., Modeli bezopasnosti kompyuternykh sistem, Uchebnoe posobie dlya studentov vysshikh uchebnykh zavedenii, Akademiya, M., 2005, 144 pp.
[4] Gaidamakin N. A., Razgranicheniya dostupa k informatsii v kompyuternykh sistemakh, Izd-vo Ural. un-ta, Ekaterinburg, 2003, 328 pp.
[5] Mainika E., Algoritmy optimizatsii na setyakh i grafakh, Mir, M., 1981, 324 pp. | MR
[6] Kormen T., Leizerson Ch., Algoritmy: postroenie i analiz, MTsNMO, M., 2000, 960 pp.