首页> 外文会议>2018 Design, Automation amp; Test in Europe Conference amp; Exhibition >Verification of tree-based hierarchical read-copy update in the Linux kernel
【24h】

Verification of tree-based hierarchical read-copy update in the Linux kernel

机译:验证Linux内核中基于树的分层只读副本更新

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

Read-Copy Update (RCU) is a scalable, high-performance Linux-kernel synchronization mechanism that runs low-overhead readers concurrently with updaters. Production-quality RCU implementations are decidedly non-trivial and their stringent validation is mandatory. This suggests use of formal verification. Previous formal verification efforts for RCU either focus on simple implementations or use modeling languages. In this paper, we construct a model directly from the source code of Tree RCU in the Linux kernel, and use the CBMC program analyzer to verify its safety and liveness properties. To the best of our knowledge, this is the first verification of a significant part of RCU's source code - an important step towards integration of formal verification into the Linux kernel's regression test suite.
机译:读写复制(RCU)是一种可扩展的高性能Linux内核同步机制,该机制与更新程序同时运行低开销的读取器。生产质量的RCU实现绝对是不平凡的,并且必须进行严格的验证。这建议使用形式验证。以前RCU的正式验证工作要么集中在简单的实现上,要么使用建模语言。在本文中,我们直接从Linux内核中的Tree RCU的源代码构建模型,并使用CBMC程序分析器来验证其安全性和活动性。据我们所知,这是对RCU源代码的重要部分的首次验证,这是将正式验证集成到Linux内核的回归测试套件中的重要一步。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号