Security Policies Enforcement Using Finite Edit Automata

Electronic Notes in Theoretical Computer Science

Volumn 229, Issue 3, 2009, Pages 19-35

  Beauquier, Danièle ^a   Cohen, Joëlle ^a   Lanotte, Ruggero ^b  

^a UNIVERSITÉ PARIS EST CRÉTEIL   (France)

^b UNIVERSITY OF INSUBRIA   (Italy)

Author keywords

Controller; finite edit automata; security

Indexed keywords

EXECUTION SEQUENCES; FINITE EDIT AUTOMATA; FINITE SET; INTERACTING SYSTEM; NUMBER OF STATE; REGULAR SETS; RUNTIME; SECURITY; SECURITY ENFORCEMENT MECHANISMS; SECURITY POLICY; SECURITY PROPERTIES;

CONTROLLERS; FINITE AUTOMATA; SET THEORY; TRANSLATION (LANGUAGES);

ROBOTS;

EID: 67649909566     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2009.06.037     Document Type: Article

References (8)

1. Berstel J. Transductions and Context-free Languages (1979), Teubner Verlag
2. L. Bauer, J. Ligatti, and D. Walker. More enforceable security policies, 2002
3. Hamlen K.W., Morrisett G., and Schneider F.B. Computability classes for enforcement mechanisms. ACM Transactions on Programming Languages and Systems (TOPLAS) 28 1 (2006) 175-205
4. Ligatti J., Bauer L., and Walker D. Edit automata: Enforcement mechanisms for run-time security policies. International Journal of Information Security 4 (2005) 2-16
5. Ligatti J., Bauer L., and Walker D. Enforcing non-safety security policies with program monitors. Computer Security - ESORICS 2005. Lecture Notes in Computer Sciences volume 3679 (2005) 353-373
6. Perrin D., and Pin J.E. Infinite Words Automata, Semigroups, Logic and Games. Pure and Applied Mathematics volume 141 (2004), Elsevier
7. Schneider F.B. Enforceable security policies. ACM Trans. Inf. Syst. Secur. 3 1 (2000) 30-50
8. Talhia C., Tawbia N., and Debbabib M. Execution monitoring enforcement under memory-limitation constraints. Information and Computation (2008)