Protection System Turing Machine Finite Automaton Computing Machinery Type Checker 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Aho, A.V., Hopcroft, J.E. and Ullman, J.D., The Design and Analysis of Computer Algorithms, Addison-Wesley Publishing Co., Reading, Mass., 1974.Google Scholar
  2. 2.
    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.Google Scholar
  3. 3.
    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.Google Scholar
  4. 4.
    Davis, R.L., The number of structures of finite relations. Proceedings of the American Mathematical Society, 4 (1953), 486–495.Google Scholar
  5. 5.
    DeBruijn, N.G., Generalization of Pólya's fundamental theorem in enumerative combinatorial analysis. Konnkl. Ned. Akad. Wetenschap., Ser. A., 62 (1959), 56–79.Google Scholar
  6. 6.
    Fenton, J.S., Memoryless subsystems. The Computer Journal, 17 (19), 143–146.Google Scholar
  7. 7.
    Fenton, J.S., An abstract computer model demonstrating directional information flow. Unpublished and undated manuscript.Google Scholar
  8. 8.
    Graham, G.S. and Denning, P.J., Protection-principles and practice. Proceedings of the AFIPS 1972 Spring Joint Computer Conference, 40 (1972), 417–429.Google Scholar
  9. 9.
    Graham, R.M., Protection in an information processing utility. Communications of the Association for Computing Machinery, 11 (1968), 365–369.Google Scholar
  10. 10.
    Harrison, M.A., A census of finite automata. Canadian Journal of Mathematics, 17 (1965), 100–113.Google Scholar
  11. 11.
    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.Google Scholar
  12. 12.
    Jones, A.K., Protection in programmed systems. Ph.D. Thesis, Department of Computer Science, Carnegie-Mellon University, Pittsburgh, Penn., June 1973.Google Scholar
  13. 13.
    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.Google Scholar
  14. 14.
    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.Google Scholar
  15. 15.
    Lampson, B.W., A note on the confinement problem. Communications of the Association for Computing Machinery, 16 (1973), 613–615.Google Scholar
  16. 16.
    Needham, R.M., Protection systems and protection implementations. Proceedings of the AFIPS Fall Joint Computer Conference, 41 (1972), 571–578.Google Scholar
  17. 17.
    Oberschelp, W., Kombinatorische anzahlbestimmungen in relationen. Math. Annalen, 174 (1967), 53–78.CrossRefGoogle Scholar
  18. 18.
    Organick, E.I., The Multics System, An Examination of Its Structure, MIT Press, Cambridge, Mass., 1972.Google Scholar
  19. 19.
    Pólya, G., Kombinatorische anzahlbestimmungen für gruppen, graphen und chemische verbundungen. Acta Mathematica, 68 (1937), 145–254.Google Scholar
  20. 20.
    Riordan, J., An Introduction to Combinatorial Analysis, John Wiley & Sons, Inc., New York, 1958.Google Scholar
  21. 21.
    Ritchie, D.M. and Thompson, K., The UNIX time sharing system. Communications of the Association for Computing Machinery, 17 (1974), 365–375.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1975

Authors and Affiliations

  • Michael A. Harrison
    • 1
  1. 1.Computer Science DivisionUniversity of California at BerkeleyUSA

Personalised recommendations