Computability classes for enforcement mechanisms

ACM Transactions on Programming Languages and Systems

Volumn 28, Issue 1, 2006, Pages 175-205

  Hamlen, Kevin W ^a,c   Morrisett, Greg ^b,d   Schneider, Fred B ^a,c  

^a Department of Obstetrics Gynecology   (United States)

^b HARVARD UNIVERSITY   (United States)

^c Department of Computer Science and School of Operations Research and Information Engineering   (United States)

^d HARVARD UNIVERSITY   (United States)

Author keywords

Edit automata; Execution monitoring; Inlined reference monitoring; Program rewriting; Reference monitors; Security automata

Indexed keywords

EDIT AUTOMATA; EXECUTION MONITORING; INLINED REFERENCE MONITORING; PROGRAM REWRITING; REFERENCE MONITORS; SECURITY AUTOMATA;

COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING; PROBLEM SOLVING;

SECURITY OF DATA;

EID: 33745329295     PISSN: 01640925     EISSN: 01640925     Source Type: Journal    
DOI: 10.1145/1111596.1111601     Document Type: Article

References (32)

1. ANDERSON, J. 1972. Computer security technology planning study vols. I and III. Tech. Rep. ESD-TR-73-51, HQ Electronic Systems Division: Hanscom AFB, MA, Fort Washington, Pennsylvania. October.
2. DEUTSCH, P. AND GRANT, C. 1971. A flexible measurement tool for software systems. In Information Processing (Proceedings of the IFIP Congress). 320-326.
3. ERLINGSSON, Ú. AND SCHNEIDER, F. B. 2000a. IRM enforcement of Java stack inspection. In IEEE Symposium on Security and Privacy. Oakland, California, 246-255.
4. ERLINOSSON, Ú. AND SCHNEIDER, F. B. 2000b. SASI enforcement of security policies: A retrospective. In WNSP: New Security Paradigms Workshop. ACM Press.
5. EVANS, D. AND TWYNMAN, A. 1999. Flexible policy-directed code safety. In IEEE Symposium on Security and Privacy. Oakland, California, 32-45.
6. FONG, P. W. L. 2004. Access control by tracking shallow execution history. In Proceedings of the 2004 IEEE Symposium on Security and Privacy. Berkeley, California, 43-55.
7. GÖDEL, K. 1931. Über formal unentscheidbare sätze der Principia Mathematica und verwandter Systeme. Monatshefte für Mathematik und Physik 38, 173-198.
8. HARRISON, M. A., RUZZO, W. L., AND ULLMAN, J. D. 1976. Protection in operating systems. Comm. ACM 19, 8 (Aug.), 461-471.
9. HOPCROFT, J. E. AND ULLMAN, J. D. 1979. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley.
10. KICZALES, G., LAMPING, J., MEDHDHEKAR, A., MAEDA, C., LOPES, C., LOINGTIER, J.-M., AND IRWIN, J. 1997. Aspect-oriented programming. In European Conference on Object-Oriented Programming, M. Akşit and S. Matsuoka, Eds. Vol. 1241. Springer-Verlag, Berlin, Heidelberg, and New York, 220-242.
11. KIM, M., KANNON, S., LEE., I., AND SOKOLSKY, O. 2001. Java-MaC: A run-time assurance tool for Java. In First International Workshop on Run-time Verification. Paris, France.
12. LAMPORT, L. 1977. Proving the correctness of multiprocess programs. IEEE Trans. Soft. Eng. SE-3 2, 125-143.
13. LAMPSON, B. 1971. Protection. In Proceedings of the 5th Symposium on Information Sciences and Systems. Princeton, New Jersey, 437-443.
14. LIGATTI, J., BAUER, L., AND WALKER, D. 2003. Edit automata: Enforcement mechanisms for runtime security policies. Tech. Rep. TR-681-03, Princeton University, Princeton, New Jersey. May.
15. LIGATTI, J., BAUER, L., AND WALKER, D. 2005. Enforcing non-safety security policies with program monitors. Tech. Rep. TR-720-05, Princeton University, Princeton, New Jersey. January.
16. LINDHOLM, T. AND YELLIN, F. 1999. The Java™ Virtual Machine Specification, second ed. Addison-Wesley.
17. MARCUS, L. Fall 1989. The search for a unifying framework for computer security. IEEE Cipher, 55-63. Invited Panel Discussion Position Paper, Second Franconia Workshop on Foundations of Computer Security, June 11-14, 1989.
18. MORRISETT, G., CRARY, K., AND GLEW, N. 1999. From System F to Typed Assembly Language. ACM Trans. Prog. Lang. Syst. 21, 3 (May), 527-568.
19. MYERS, A. C. 1999. Practical mostly-static information flow control. In Proceedings of the 26th ACM Symposium on Principles of Programming Languages, San Antonio, Texas, 228-241.
20. NACHENBERG, C. 1997. Computer virus-antivirus coevolution. Comm. ACM 40, 1 (Jan.), 46-51.
21. NECULA, G. 1997. Proof-Carrying Code. In 24th ACM Symposium on Principles of Programming Languages. Paris, France, 106-119.
22. NECULA, G. C. AND LEE, P. 1996. Safe kernel extensions without run-time checking. In Second Symposium on Operating Systems Design and Implementation (OSDI '96). USENIX, Berkeley, CA, USA, 229-243.
23. NECULA, G. C. AND LEE, P. 1998. The design and implementation of a certifying compiler. In Proceedings of the 1998 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI). 333-344.
24. PAPADIMITRIOU, C. H. 1995. Computational Complexity. Addison-Wesley.
25. REES, J. AND CLINGER, W. 1991. Revised 4 report on the algorithmic language Scheme. Lisp Pointers 4, 3 (July-Sept.), 1-55.
26. ROBBEN, W., VANHAUTE, B., JOOSEN, W., AND VERBAETEN, P. 1999. Non-functional policies. Lecture Notes in Computer Science 1616, 74-92.
27. SCHNEIDER, F. B. 2000. Enforceable security policies. ACM Trans. Inform. Syst. Secur. 3, 1 (Feb.), 30-50.
28. SMALL, C. 1997. MiSFIT: A tool for constructing safe extensible C++ systems. In Proceedings of the Third USENIX Conference on Object-Oriented Technologies. Portland, Oregon.
29. TURING, A. M. 1936. On computable numbers with an application to the Entscheidungs-problem. In Proceedings of the London Mathematical Society, vol. 2. 42, 230-265.
30. VISWANATHAN, M. 2000. Foundations for the run-time analysis of software systems. Ph.D. thesis, University of Pennsylvania.
31. WAHBE, R., LUCCO, S., ANDERSON, T. E., AND GRAHAM, S. L. 1993. Efficient software-based fault isolation. In Proceedings of the 14th ACM Symposium on Operating Systems Principles, 203-216.
32. WARE, W. 1979. Security controls for computer systems. Tech. Rep. R-609-1, Rand Corp. October.