Protected procedure

In computer science, the concept of protected procedure, first introduced as protected service routine in 1965,[1] is necessary when two computations A and B use the same routine S; a protected procedure is such if makes not possible for a malfunction of one of the two computation to cause incorrect execution to the other.[2]

One of the most important aspects of Dennis and Van Horn (hypothetical) system "supervisor"[2] was the inclusion of a description of protected procedure.[3]

In a global environment system (where there's some shared variable), the protected procedure mechanism allows the enforcement of the principle of least privilege and the avoidance of side effects in resources management (see Denning principles).

Footnotes
  1. Dennis 65
  2. Dennis 66
  3. Levy 84, pp.46-6
gollark: Well, oops. I'm sure there are lots of unofficial ones floating about anyway.
gollark: Some offense, but I don't think it'll take off.
gollark: <@175505406800560141> Turtlegistics isn't very server-friendly. There are caching variants, various complete rewrites and other stuff floating about.
gollark: CLNinja: you could possibly have a limited-use out of game relay which handles the auth for you.
gollark: I quite like Ramda for JS.

References
  • Dennis, J. B., and Glasee, E. The structure of on-line information processing systems. Information Systems Sciences: Proc. Second Cong., Spartan Books, Baltimore, 1965, pp. 1–11
  • J. B. Dennis and E. C. Van Horn. Programming Semantics for Multiprogrammed Computations. Communications of the ACM 9(3), March 1966.
  • Levy, Henry M. (1984). "3". Capability-based computer systems. Maynard, Mass: Digital Press. ISBN 0-932376-22-3.


This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.