In pursuit of punctuality: Computability classes for enforcement mechanisms
ACM Transactions on Programming Languages and Systems（2002）
摘要
AbstractA 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.
更多查看译文
关键词
inlined reference monitoring,computability class,computational complexity theory,enforceable security policy,security policies enforceable,precise characterization,prior work,edit automata,known class,reference monitors,better characterization,rectifies problem,security automata,execution monitoring,additional key words and phrases: program rewriting,enforcement mechanism,computational complexity,security policy,computer science,technical report
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要