Geodesic
The search for bridges in Take-Grant security model
Prikladnaya Diskretnaya Matematika. Supplement, no. 5 (2012), pp. 63-65.

Voir la notice de l'article provenant de la source Math-Net.Ru

An algorithm for searching bridges in protection graph for Take-Grant protection model is described. The proof of its correctness is given. 
@article{PDMA_2012_5_a32,
     author = {D. M. Brechka},
     title = {The search for bridges in {Take-Grant} security model},
     journal = {Prikladnaya Diskretnaya Matematika. Supplement},
     pages = {63--65},
     publisher = {mathdoc},
     number = {5},
     year = {2012},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDMA_2012_5_a32/}
}
TY  - JOUR
AU  - D. M. Brechka
TI  - The search for bridges in Take-Grant security model
JO  - Prikladnaya Diskretnaya Matematika. Supplement
PY  - 2012
SP  - 63
EP  - 65
IS  - 5
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDMA_2012_5_a32/
LA  - ru
ID  - PDMA_2012_5_a32
ER  - 
%0 Journal Article
%A D. M. Brechka
%T The search for bridges in Take-Grant security model
%J Prikladnaya Diskretnaya Matematika. Supplement
%D 2012
%P 63-65
%N 5
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDMA_2012_5_a32/
%G ru
%F PDMA_2012_5_a32
D. M. Brechka. The search for bridges in Take-Grant security model. Prikladnaya Diskretnaya Matematika. Supplement, no. 5 (2012), pp. 63-65. http://geodesic.mathdoc.fr/item/PDMA_2012_5_a32/

[1] Lipton R. J., Richard J., “A Linear Time Algorithm for Deciding Subject Security”, J. ACM, 24:3 (1977), 455–464 | DOI | MR | Zbl

[2] Devyanin P. N., Modeli bezopasnosti kompyuternykh sistem, ucheb. posobie dlya studentov vysshikh uchebnykh zavedenii, Akademiya, M., 2005, 144 pp.

[3] Gaidamakin N. A., Razgranicheniya dostupa k informatsii v kompyuternykh sistemakh, Izd-vo Ural. un-ta, Ekaterinburg, 2003, 328 pp.

[4] Kormen T., Leizerson Ch., Rivest R., Shtain K., Algoritmy: postroenie i analiz, MTsNMO, M., 2000, 960 pp.