Computability classes for enforcement mechanisms

  • Authors:
  • Kevin W. Hamlen;Greg Morrisett;Fred B. Schneider

  • Affiliations:
  • Cornell University, Ithaca, NY;Harvard University, Cambridge, MA;Cornell University, Ithaca, NY

  • Venue:
  • ACM Transactions on Programming Languages and Systems (TOPLAS)
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

A precise characterization of those security policies enforceable by program rewriting is given. This also exposes and rectifies problems in prior work, yielding a better characterization of those security policies enforceable by execution monitors as well as a taxonomy of enforceable security policies. Some but not all classes can be identified with known classes from computational complexity theory.