Heuristics for Safety and Security Constraints | Zendy

Flemming Nielson | Zendy; Hanne Riis Nielson | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Heuristics for Safety and Security Constraints

Author(s) -

Flemming Nielson,

Hanne Riis Nielson

Publication year - 2007

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2007.02.018

Subject(s) - heuristics , computer science , security policy , concrete security , access control , computer security model , theoretical computer science , computer security , operating system

The flow logic approach to static analysis amounts to specifying the admissibility of solutions to analysis problems; when specified using formulae in stratified alternation-free least fixed point logic one may use efficient algorithms for computing the least admissible solutions. We extend this scenario to validate the fulfilment of safety and security constraints on admissible solutions; the modified development produces a least solution together with a boolean value indicating whether or not the constraints are validated or violated.The main contribution is the development of a deterministic heuristics for obtaining a solution that is close to the least solution while enforcing the safety or security constraints. We illustrate it on the Bell-LaPadula mandatory access control policy where the heuristics is used to suggest modifications to the security annotations of entities in order for the security policy to hold

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research