Unifying decidability results on protection systems using simulations

Authors:
Constantin Enea
Affiliations:
Faculty of Computer Science, “Al.I.Cuza” University of Iasi, Romania
Venue:
FAST'05 Proceedings of the Third international conference on Formal Aspects in Security and Trust
Year:
2005

Citing 6
Cited 0

The schematic protection model: its definition and analysis for acyclic attenuating schemes

Journal of the ACM (JACM)
A Linear Time Algorithm for Deciding Subject Security

Journal of the ACM (JACM)
Protection in operating systems

Communications of the ACM
Concurrency and Automata on Infinite Sequences

Proceedings of the 5th GI-Conference on Theoretical Computer Science
The Typed Access Matrix Model

SP '92 Proceedings of the 1992 IEEE Symposium on Security and Privacy
An algebraic definition of simulation between programs

IJCAI'71 Proceedings of the 2nd international joint conference on Artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate two possible definitions of simulation between protection systems. The resulting simulation relations are used to unify the proofs of decidability of the safety problem for several classes of protection systems from the literature, notably the take-grant systems ([4]) and the MTAM systems with acyclic creation graphs([9]).