Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Hamlen et al. (2006) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: