Execution monitoring enforcement under memory-limitation constraints

Information and Computation

Volumn 206, Issue 2-4, 2008, Pages 158-184

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

^a UNIVERSITÉ LAVAL   (Canada)

^b Concordia University ^*  (Canada)

Author keywords

Bounded history automata; Edit automata; Execution monitoring; Locally testable properties; Security policies

Indexed keywords

AUTOMATA THEORY; CONSTRAINT THEORY; DATA STORAGE EQUIPMENT; PROBLEM SOLVING; TAXONOMIES;

BOUNDED HISTORY AUTOMATA; EDIT AUTOMATA; EXECUTION MONITORING; LOCALLY TESTABLE PROPERTIES; SECURITY POLICIES;

SECURITY OF DATA;

EID: 40149091526     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2007.07.009     Document Type: Article

References (32)

1. L. Bauer, J. Ligatti, D. Walker, More enforceable security policies, in: Foundations of Computer Security, Copenhagen, Denmark, 2002, pp. 95-104.
2. Bauer L., Ligatti J., and Walker D. Composing security policies with polymer. SIGPLAN Not 40 6 (2005) 305-314
3. Beauquier D., and Pin J.E. Languages and scanners. Theor. Comput. Sci. 84 (1991) 3-21
4. K. Biba, Integrity considerations for secure computer systems, Technical Report 76-372, US Air Force Electronic Systems Division, 1977.
5. W.E. Boebert, R.Y. Kain, A practical alternative to hierarchical integrity policies, in: Proceedings of the 8th National Computer Security Conference, 1985, pp. 18-27.
6. D.F.C. Brewer, M.J. Nash, The Chinese wall security policy, in: IEEE Symposium on Security and Privacy, 1989, pp. 206-214.
7. Caron P. Families of locally testable languages. Theor. Comput. Sci. 242 1-2 (2000) 361-376
8. G. Edjladi, A. Acharya, V. Chaudhary, History-based access control for mobile code, in: 5th ACM Conference on Computer and Communications Security, San Francisco, CA, USA, 1998, pp. 38-48.
9. P.W.L. Fong, Access control by tracking shallow execution history, in: Proceedings of the 2004 IEEE Symposium on Security and Privacy, Berkeley, CA, 2004.
10. C. Fournet, A.D. Gordon, Stack inspection: theory and variants, in: Proceedings of the 29th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, ACM Press, 2002, pp. 307-318.
11. Gligor V.D. A note on denial-of-service in operating systems. IEEE Trans. Software Eng. 10 3 (1984) 320-324
12. Hamlen K.W., Morrisett G., and Schneider F.B. Computability classes for enforcement mechanisms. ACM Trans. Program. Lang. Syst. 28 1 (2006) 175-205
13. Kim S., McNaughton R., and McCloskey R. A polynomial time algorithm for the local testability problem of deterministic finite automata. IEEE Trans. Comput. 40 (1991) 1087-1093
14. Kim S., and McNaughton R. Computing the order of a locally testable automaton. SIAM J. Comput. 23 (1994) 1193-1215
15. O. Kupferman, Y. Lustig, M.Y. Vardi, On locally checkable properties, in: Proceedings of the 13th International Conference on Logic for Programming Artificial Intelligence and Reasoning (LPAR 2006), 2006.
16. Lamport L. Proving the correctness of multiprocess programs. IEEE Trans. Software Eng. 3 2 (1977) 125-143
17. B. Lampson, Protection, in: Proceedings 5th Symposium on Information Sciences and Systems, Princeton, New Jersey, 1971, pp. 437-443.
18. J. Ligatti, L. Bauer, D. Walker, Edit automata: enforcement mechanisms for run-time security policies, Int. J. Inform. Secur. 4 (1-2) (2005) 2-16 (Published online 26 Oct 2004).
19. J. Ligatti, L. Bauer, D. Walker, Enforcing non-safety security policies with program monitors, Technical Report TR-720-05, Princeton University, January 2005.
20. J. Ligatti, L. Bauer, D. Walker, Enforcing non-safety security policies with program monitors, in: Computer Security-ESORICS 2005: 10th European Symposium on Research in Computer Security, in: Lecture Notes in Computer Science, vol. 3679, 2005, pp. 355-373.
21. A. Magnaghi, H. Tanaka, An efficient algorithm for order evaluation of strict locally testable languages.
22. Paxton W.H. A client-based transaction system to maintain data integrity. Proceedings of the Seventh ACM Symposium on Operating Systems Principles (1979), ACM Press pp. 18-23
23. D. Perrin, J.-E. Pin, Infinite words. Automata, semigroups, logic and games, Pure and Applied Mathematics, vol. 141, Elsevier, 2004.
24. Pin J.E. Finite semigroups and recognizable languages : an introduction. In: Fountain J. (Ed). NATO Advanced Study Institute Semigroups, Formal Languages and Groups (1995), Kluwer academic publishers 1-32
25. Schneider F.B. Enforceable security policies. ACM Trans. Inform. Syst. Secur. 3 1 (2000) 30-50
26. A. Taivalsaari, Java Specification Request 139 J2ME Connected Limited Device Configuration 1.1, March 2003.
27. Trahtman A.N. A polynomial time algorithm for local testability and its level. J. Algebra Comput. 9 1 (1998) 1-2
28. Trahtman A.N. An algorithm to verify local threshold testability of deterministic finite automata. Lecture Notes Comput. Sci. 2214 (2001) 164-171
29. Trahtman A.N. A polynomial time algorithm for left [right] local testability. Lecture Notes Comput. Sci. 2608 (2003) 203-212
30. M. Viswanathan, Foundations for the Run-time Analysis of Software Systems, Ph.D. thesis, University of Pennsylvania, 2000.
31. W.D. Young, P.A. Telega, W.E. Boebert, A verified labler for the secure ada target, in: In Proceedings of the 9th National Computer Security Conference, 1986, pp. 55-61.
32. A Package TESTAS for Checking Some Kinds of Testability.