Security Policies Enforcement Using Finite Edit Automata

DOI10.1016/j.entcs.2009.06.037zbMath1291.68279OpenAlexW2043466180MaRDI QIDQ5166611

Ruggero Lanotte, Joëlle Cohen, Danièle Beauquier

Publication date: 27 June 2014

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2009.06.037

zbMATH Keywords

securitycontrollerfinite edit automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (1)

Which security policies are enforceable by runtime monitors? A survey

Cites Work

• Unnamed Item
• Unnamed Item
• Execution monitoring enforcement under memory-limitation constraints
• Enforcing Non-safety Security Policies with Program Monitors

This page was built for publication: Security Policies Enforcement Using Finite Edit Automata