Execution monitoring enforcement for limited-memory systems

ACM International Conference Proceeding Series

Volumn , Issue , 2006, Pages

  Talhi, Chamseddine ^a   Tawbi, Nadia ^a   Debbabi, Mourad ^b  

^a UNIVERSITÉ LAVAL   (Canada)

^b Gina Cody School of Engineering and Computer Science   (Canada)

Author keywords

bounded history automata; edit automata; enforcement mechanisms; execution monitoring; locally testable properties; security policies

Indexed keywords

AUTOMATA THEORY; NETWORK SECURITY; SECURITY SYSTEMS;

BOUNDED HISTORY AUTOMATON; EDIT AUTOMATON; ENFORCEMENT MECHANISMS; EXECUTION MONITORING; EXECUTION MONITORS; LOCALLY-TESTABLE PROPERTY; PROPERTY; RESEARCH PROBLEMS; SECURITY ENFORCEMENT; SECURITY POLICY;

ABSTRACTING;

EID: 85133871088     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1501434.1501480     Document Type: Conference Paper

References (37)

1. L. Bauer, J. Ligatti, and D. Walker. More enforceable security policies. In Foundations of Computer Security, pages 95-104, Copenhagen, Denmark, 25-26 July 2002. DIKU Technical Report.
2. L. Bauer, J. Ligatti, and D. Walker. Edit automata: Enforcement mechanisms for run-time security policies. Tech. Rep TR-681-03, Princeton University, May, 2003.
3. L. Bauer, J. Ligatti, and D. Walker. Composing security policies with polymer. SIGPLAN Not., 40(6):305-314, 2005.
4. D. Beauquier and J. E. Pin. Languages and scanners. Theoretical Comput. Sci., 84:3-21, 1991.
5. J. Berstel and J. E. Pin. Local languages and the berry-sethi algorithm. Theoretical Comput. Sci., 155:439-446, 1996.
6. K. Biba. Integrity considerations for secure computer systems. Technical Report 76372, US Air Force Electronic Systems Division, 1977.
7. W. E. Boebert and R. Y. Kain. A practical alternative to hierarchical integrity policies. In In Proceedings of the 8th National Computer Security Conference, page 1827, October 1985.
8. D. F. C. Brewer and M. J. Nash. The chinese wall security policy. In IEEE Symposium on Security and Privacy, pages 206-214, May 1989.
9. P. Caron. Families of locally testable languages. Theor. Comput. Sci., 242(1-2):361-376, 2000.
10. Erlingsson and F. B. Schneider. Irm enforcement of java stack inspection. In Proceedings of the IEEE Symposium on Security and Privacy (S&P 2000), pages 246-255. IEEE Computer Society, 2000.
11. U. Erlingsson and F. B. Schneider. Sasi enforcement of security policies: a retrospective. In Proceedings of the New Security Paradigms Workshop, pages 87-95. Caledon Hills, Ontario, Canada, ACM Press, 2000.
12. P. L. Fong. Access control by tracking shallow execution history. In In Proceedings of the 2004 IEEE Symposium on Security and Privacy. Berkeley, California, May 2004.
13. C. Fournet and A. D. Gordon. Stack inspection: theory and variants. In Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pages 307-318. ACM Press, 2002.
14. V. D. Gligor. A note on denial-of-service in operating systems. IEEE Trans. Softw. Eng., 10(3):320-324, 1984.
15. A. A. G. Edjladi and V. Chaudhary. History-based access control for mobile code. In 5th ACM Conference on Computer and Communications Security, pages 38-48, San Francisco, CA, USA, November 1998.
16. K. W. Hamlen, G. Morrisett, and F. B. Schneider. Computability classes for enforcement mechanisms. ACM Trans. Program. Lang. Syst., 28(1):175-205, 2006.
17. K. Hamlen, G. Morrisett, and F. Schneider. Computability classes for enforcement mechanisms. Technical Report TR2003-1908, Cornell University, 2003. To appear in ACM Transactions on Programming Languages and Systems.
18. M. Kim, S. Kannan, I. Lee, S. Sokolsky, and M. Viswanathan. Computational analysis of run-time monitoring. In K. Havelund and G. Roşu, editors, Runtime Verification, volume 70 of Electronic Notes in Theoretical Computer Science, pages 81-95. Elsevier Science, July 26 2002.
19. L. Lamport. Proving the correctness of multiprocess programs. IEEE Transactions of Software Engineering, 3(2):125-143, 1977.
20. J. Levy, H. Saidi, and T. E. Uribe. Combining monitors for runtime system verification. In K. Havelund and G. Rosu, editors, Electronic Notes in Theoretical Computer Science, volume 70. Elsevier, 2002.
21. J. Ligatti, L. Bauer, and D. Walker. Edit automata: Enforcement mechanisms for run-time security policies. International Journal of Information Security, 4(1-2):2-16, Feb. 2005. (Published online 26 Oct 2004.).
22. J. Ligatti, L. Bauer, and D. Walker. Enforcing non-safety security policies with program monitors. Technical Report TR-720-05, Princeton University, Jan. 2005.
23. A. Magnaghi and H. Tanaka. An efficient algorithm for order evaluation of strict locally testable languages.
24. W. H. Paxton. A client-based transaction system to maintain data integrity. In Proceedings of the seventh ACM symposium on Operating systems principles, pages 18-23. ACM Press, 1979.
25. D. Perrin and J. E. Pin. Infinite Words. Automata, Semigroups, Logic and Games, volume 141 of Pure and Applied Mathematics. Elsevier, 1004.
26. D. Perrin and J. Pin. Semigroups and automata on infinite words, 1995.
27. J.-E. Pin. Logic, semigroups and automata on words., 1994.
28. J. E. Pin. Finite semigroups and recognizable languages: an introduction. In J. Fountain, editor, NATO Advanced Study Institute Semigroups, Formal Languages and Groups, pages 1-32. Kluwer academic publishers, 1995.
29. A. Sabelfeld and A. C. Myers. Language-based information-flow security. IEEE Journal on Selected Areas in Communications, 21(1):5-19, Jan. 2003.
30. F. B. Schneider, G. Morrisett, and R. Harper. A language-based approach to security. Lecture Notes in Computer Science, 2000.
31. F. B. Schneider. Enforceable security policies. ACM Transactions on Information and Systems Security, 3(1):30-50, 2000.
32. R. M. S. Kim, R. McNaughton. A polynomial time algorithm for the local testability problem of deterministic finite automata. IEEE Trans. Comput, 40:1087-1093, 1991.
33. R. M. S. Kim. Computing the order of a locally testable automaton. SIAM Journal of Computing, 23:1193-1215, 1994.
34. A. Taivalsaari. JSR 139 J2ME Connected Limited Device Configuration 1.1, March 2003.
35. A. N. Trahtman. An algorithm to verify local threshold testability of deterministic finite automata. Lecture Notes in Computer Science, 2214:164+, 2001.
36. M. Viswanathan. Foundations for the Run-time Analysis of Software Systems. PhD thesis, University of Pennsylvania, 2000.
37. P. A. T. W. D. Young and W. E. Boebert. A verified labler for the secure ada target. In In Proceedings of the 9th National Computer Security Conference, page 5561, September 1986.