Computability classes for enforcement mechanisms
Top Cited Papers
- 1 January 2006
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Programming Languages and Systems
- Vol. 28 (1) , 175-205
- https://doi.org/10.1145/1111596.1111601
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.Keywords
This publication has 9 references indexed in Scilit:
- Enforceable security policiesACM Transactions on Information and System Security, 2000
- From system F to typed assembly languageACM Transactions on Programming Languages and Systems, 1999
- Non-Functional PoliciesPublished by Springer Nature ,1999
- Aspect-oriented programmingPublished by Springer Nature ,1997
- Computer virus-antivirus coevolutionCommunications of the ACM, 1997
- Revised 4 report on the algorithmic language schemeACM SIGPLAN Lisp Pointers, 1991
- Proving the Correctness of Multiprocess ProgramsIEEE Transactions on Software Engineering, 1977
- Protection in operating systemsCommunications of the ACM, 1976
- Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme IMonatshefte für Mathematik, 1931