Enforcing reactive noninterference with reachability analysis | |
Sun, Cong ; Tang, Liyong ; Chen, Zhong | |
2010 | |
英文摘要 | The reactive computational model is pervasively used as a proper abstraction of web-based applications which receive inputs and generate outputs throughout execution. The present static enforcements of information flow security on reactive program are either based on type system or abstract interpretation. In this work we first propose an approach using automated verification to check conformance with information flow policy for reactive program. This approach utilizes our previous idea to incorporate self-composition with reach ability analysis. In order to reduce the state space of model, we propose the Store-Match Self-Composition (SMSC) to avoid duplicating the low channels. The result of preliminary experiments shows that our approach is more precise and efficient than existing work and also more efficient than our previous reach ability analysis. ? 2011 IEEE.; EI; 0 |
语种 | 英语 |
DOI标识 | 10.1109/ITNG.2011.63 |
内容类型 | 其他 |
源URL | [http://ir.pku.edu.cn/handle/20.500.11897/295464] |
专题 | 信息科学技术学院 |
推荐引用方式 GB/T 7714 | Sun, Cong,Tang, Liyong,Chen, Zhong. Enforcing reactive noninterference with reachability analysis. 2010-01-01. |
个性服务 |
查看访问统计 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论