Computability classes for enforcement mechanisms
ACM Transactions on Programming Languages and Systems (TOPLAS), 2006•dl.acm.org
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.
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.
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.
ACM Digital Library以上显示的是最相近的搜索结果。 查看全部搜索结果