Enforcing non-safety security policies with program monitors

DOI10.1007/11555827_21MaRDI QIDQ5862671zbMATH OpenOpenAlexFDO

Authors

Publication date 9 March 2022

Published in Computer Security – ESORICS 2005 (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.71.7657

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Computer security (68M25)

Recommendations

• scientific article; zbMATH DE number 1962746
• Security policies enforcement using finite edit automata
• Which security policies are enforceable by runtime monitors? A survey
• Runtime enforcement monitors: Composition, synthesis, and enforcement abilities
• Enforceable Security Policies Revisited

Cites work

• scientific article; zbMATH DE number 1962746 (Why is no real title available?)
• Defining liveness
• Proving the Correctness of Multiprocess Programs
• Recognizing safety and liveness

Cited in

(11)

• Execution monitoring enforcement under memory-limitation constraints
• Runtime enforcement of security policies on black box reactive programs
• Enforcing trace properties by program transformation
• Provably correct runtime monitoring
• Bidirectional Runtime Enforcement of First-Order Branching-Time Properties
• Which security policies are enforceable by runtime monitors? A survey
• Enforcement and validation (at runtime) of various notions of opacity
• Consistently-detecting monitors
• Real-time policy enforcement with metric first-order temporal logic
• Security policies enforcement using finite edit automata
• scientific article; zbMATH DE number 1962746 (Why is no real title available?)

This page was built for publication: Enforcing non-safety security policies with program monitors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5862671)