Execution monitoring enforcement under memory-limitation constraints
From MaRDI portal
(Redirected from Publication:2482440)
Recommendations
Cites work
- A POLYNOMIAL TIME ALGORITHM FOR LOCAL TESTABILITY AND ITS LEVEL
- A polynomial time algorithm for the local testability problem of deterministic finite automata
- Computing the Order of a Locally Testable Automaton
- Enforcing non-safety security policies with program monitors
- Families of locally testable languages
- scientific article; zbMATH DE number 988805 (Why is no real title available?)
- scientific article; zbMATH DE number 1962781 (Why is no real title available?)
- scientific article; zbMATH DE number 1962784 (Why is no real title available?)
- scientific article; zbMATH DE number 2081053 (Why is no real title available?)
- scientific article; zbMATH DE number 1472161 (Why is no real title available?)
- scientific article; zbMATH DE number 2206109 (Why is no real title available?)
- Languages and scanners
- On Locally Checkable Properties
- Proving the Correctness of Multiprocess Programs
- Stack inspection
Cited in
(6)- Runtime enforcement of security policies on black box reactive programs
- Policy monitor model based on Mealy automata
- scientific article; zbMATH DE number 1497848 (Why is no real title available?)
- Which security policies are enforceable by runtime monitors? A survey
- Security policies enforcement using finite edit automata
- Bounded-memory runtime enforcement with probabilistic and performance analysis
This page was built for publication: Execution monitoring enforcement under memory-limitation constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2482440)