On the Decidability of the Safety Problem for Access Control Policies

DOI10.1016/j.entcs.2007.05.032zbMath1335.68141OpenAlexW1995511026MaRDI QIDQ5178997

Tom Newcomb, Eldar Kleiner

Publication date: 18 March 2015

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2007.05.032

zbMATH Keywords

model checkingtemporal logicCSPaccess control

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25) Temporal logic (03B44)

Uses Software

• FDR2

Cites Work

• Beyond proof-of-compliance: security analysis in trust management
• Protection in operating systems
• On model checking data-independent systems with arrays without reset
• Information Security
• Information Security

This page was built for publication: On the Decidability of the Safety Problem for Access Control Policies