Model checking and abstraction
ACM Transactions on Programming Languages and Systems (TOPLAS)
Reasoning about knowledge
Tree-Like Counterexamples in Model Checking
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Counterexample-Guided Abstraction Refinement
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Distributed Computing
The complexity of model checking concurrent programs against CTLK specifications
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Synthesising verified access control systems through model checking
Journal of Computer Security
Abstraction in model checking multi-agent systems
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Specification and Analysis of Dynamic Authorisation Policies
CSF '09 Proceedings of the 2009 22nd IEEE Computer Security Foundations Symposium
A symmetry reduction technique for model checking temporal-epistemic logic
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Privacy policies with modal logic: the dynamic turn
DEON'10 Proceedings of the 10th international conference on Deontic logic in computer science
Abstraction for model checking multi-agent systems
Frontiers of Computer Science in China
A knowledge-based verification method for dynamic access control policies
ICFEM'11 Proceedings of the 13th international conference on Formal methods and software engineering
Specifying and reasoning about dynamic access-control policies
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
MCMAS: a model checker for multi-agent systems
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
| Hi-index | 0.00 |
In this paper, we develop a modeling technique based on interpreted systems in order to verify temporal-epistemic properties over access control policies. This approach enables us to detect information flow vulnerabilities in dynamic policies by verifying the knowledge of the agents gained by both reading and reasoning about system information. To overcome the practical limitations of state explosion in model-checking temporal-epistemic properties, we introduce a novel abstraction and refinement technique for temporal-epistemic safety properties in ACTLK (ACTL with knowledge modality K) and a class of interesting properties that does fall in this category.