This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Aho, A.V., Hopcroft, J.E. and Ullman, J.D., The Design and Analysis of Computer Algorithms, Addison-Wesley Publishing Co., Reading, Mass., 1974.
Andrews, G.R., COPS — A protection mechanism for computer systems. Ph.D. Thesis and Technical Report 74-07-12, Computer Science, University of Washington, Seattle, Washington, July 1974.
Bell, D.E. and LaPadula, L.J., Secure Computer Systems, Vol. I. Mathematical Foundations, Vol. II. A Mathematical Model. MITRE Corporation Technical Report MTR-2547, 1973.
Davis, R.L., The number of structures of finite relations. Proceedings of the American Mathematical Society, 4 (1953), 486–495.
DeBruijn, N.G., Generalization of Pólya's fundamental theorem in enumerative combinatorial analysis. Konnkl. Ned. Akad. Wetenschap., Ser. A., 62 (1959), 56–79.
Fenton, J.S., Memoryless subsystems. The Computer Journal, 17 (19), 143–146.
Fenton, J.S., An abstract computer model demonstrating directional information flow. Unpublished and undated manuscript.
Graham, G.S. and Denning, P.J., Protection-principles and practice. Proceedings of the AFIPS 1972 Spring Joint Computer Conference, 40 (1972), 417–429.
Graham, R.M., Protection in an information processing utility. Communications of the Association for Computing Machinery, 11 (1968), 365–369.
Harrison, M.A., A census of finite automata. Canadian Journal of Mathematics, 17 (1965), 100–113.
Harrison, M.A., Ruzzo, W.L. and Ullman, J.D., On protection in operating systems. To appear in Communications of the Association for Computing Machinery.
Jones, A.K., Protection in programmed systems. Ph.D. Thesis, Department of Computer Science, Carnegie-Mellon University, Pittsburgh, Penn., June 1973.
Jones, A. and Wulf, W., Towards the design of secure systems. In Protection in Operating Systems, pp. 121–136, 1974. Colloques IRIA, Rocquencourt, France, 1974.
Lampson, B.W., Protection. In Proceedings of the Fifth Princeton Symposium on Information Sciences and Systems, Princeton University, March 1971, pp. 437–443, Reprinted in Operating Systems Review, 8 (January 1974), 18–24.
Lampson, B.W., A note on the confinement problem. Communications of the Association for Computing Machinery, 16 (1973), 613–615.
Needham, R.M., Protection systems and protection implementations. Proceedings of the AFIPS Fall Joint Computer Conference, 41 (1972), 571–578.
Oberschelp, W., Kombinatorische anzahlbestimmungen in relationen. Math. Annalen, 174 (1967), 53–78.
Organick, E.I., The Multics System, An Examination of Its Structure, MIT Press, Cambridge, Mass., 1972.
Pólya, G., Kombinatorische anzahlbestimmungen für gruppen, graphen und chemische verbundungen. Acta Mathematica, 68 (1937), 145–254.
Riordan, J., An Introduction to Combinatorial Analysis, John Wiley & Sons, Inc., New York, 1958.
Ritchie, D.M. and Thompson, K., The UNIX time sharing system. Communications of the Association for Computing Machinery, 17 (1974), 365–375.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1975 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Harrison, M.A. (1975). On models of protection in operating systems. In: Bečvář, J. (eds) Mathematical Foundations of Computer Science 1975 4th Symposium, Mariánské Lázně, September 1–5, 1975. MFCS 1975. Lecture Notes in Computer Science, vol 32. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07389-2_181
Download citation
DOI: https://doi.org/10.1007/3-540-07389-2_181
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07389-5
Online ISBN: 978-3-540-37585-2
eBook Packages: Springer Book Archive