Execution monitoring enforcement under memory-limitation constraints

DOI10.1016/J.IC.2007.07.009zbMath1146.68356OpenAlexW1976635413MaRDI QIDQ2482440

Nadia Tawbi, Mourad Debbabi, Chamseddine Talhi

Publication date: 16 April 2008

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2007.07.009

zbMATH Keywords

security policiesexecution monitoringbounded history automataedit automatalocally testable properties

Mathematics Subject Classification ID

Theory of software (68N99)

Related Items (2)

Which security policies are enforceable by runtime monitors? A survey ⋮ Security Policies Enforcement Using Finite Edit Automata

Uses Software

• LANGAGE
• TESTAS

Cites Work

• Languages and scanners
• Families of locally testable languages
• A POLYNOMIAL TIME ALGORITHM FOR LOCAL TESTABILITY AND ITS LEVEL
• Proving the Correctness of Multiprocess Programs
• Computing the Order of a Locally Testable Automaton
• Stack inspection
• A polynomial time algorithm for the local testability problem of deterministic finite automata
• On Locally Checkable Properties
• Enforcing Non-safety Security Policies with Program Monitors
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Execution monitoring enforcement under memory-limitation constraints