Which security policies are enforceable by runtime monitors? A survey
From MaRDI portal
Publication:465692
DOI10.1016/j.cosrev.2012.01.001zbMath1298.68064OpenAlexW2099064219MaRDI QIDQ465692
Publication date: 24 October 2014
Published in: Computer Science Review (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cosrev.2012.01.001
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items
Bidirectional Runtime Enforcement of First-Order Branching-Time Properties ⋮ There are Two Sides to Every Question ⋮ Runtime enforcement with reordering, healing, and suppression ⋮ Runtime enforcement of timed properties using games ⋮ On bidirectional runtime enforcement
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Defining liveness
- Recognizing safety and liveness
- Languages and scanners
- Execution monitoring enforcement under memory-limitation constraints
- Proving the Correctness of Multiprocess Programs
- Computing the Order of a Locally Testable Automaton
- Security Policies Enforcement Using Finite Edit Automata
- A polynomial time algorithm for the local testability problem of deterministic finite automata
- Monitoring of Real-Time Properties
- On Locally Checkable Properties
This page was built for publication: Which security policies are enforceable by runtime monitors? A survey