Temporal Mode-Checking for Runtime Monitoring of Privacy Policies
Temporal Mode-Checking for Runtime Monitoring of Privacy Policies
复制标题
用于隐私策略运行时监控的时间模式检查
DOI:
--
复制
发表时间:
2014
期刊:
影响因子:
--
通讯作者:
Anupam Datta
中科院分区:
文献类型:
--
作者:
Omar Chowdhury;Limin Jia;D. Garg;Anupam Datta
Fragments of first-order temporal logic are useful for representing many practical privacy and security policies. Past work has proposed two strategies for checking event trace (audit log) compliance with policies: online monitoring and offline audit. Although online monitoring is spaceand timeefficient, existing techniques insist that satisfying instances of all subformulas of the policy be amenable to caching, which limits expressiveness when some subformulas have infinite support. In contrast, offline audit is brute force and can handle more policies but is not as efficient. This paper proposes a new online monitoring algorithm that caches satisfying instances when it can, and falls back to the brute force search when it cannot. Our key technical insight is a new flowand time-sensitive static check of variable groundedness, called the temporal mode check, which determines subformulas for which such caching is feasible and those for which it is not and, hence, guides our algorithm. We prove the correctness of our algorithm and evaluate its performance over synthetic traces and realistic policies. z This is the extended version of the paper titled “Temporal Mode-Checking for Runtime Monitoring of Privacy Policies” that appears in the 26th International Conference on Computer Aided Verification (CAV) 2014. All the opinions expressed in this paper represent only the authors’ views.
影响因子:
1.2
作者:
Krukow K
通讯作者:
Krukow K