首页> 外文会议>Tools and Algorithms for the Construction and Analysis of Systems >Formal Pervasive Verification of a Paging Mechanism
【24h】

Formal Pervasive Verification of a Paging Mechanism

机译:寻呼机制的正式普及验证

获取原文
获取原文并翻译 | 示例

摘要

Memory virtualization by means of demand paging is a crucial component of every modern operating system. The formal verification is challenging since reasoning about the page fault handler has to cover two concurrent computational sources: the processor and the hard disk. We accurately model the interleaved executions of devices and the page fault handler, which is written in a high-level programming language with inline assembler portions. We describe how to combine results from sequential Hoare logic style reasoning about the page fault handler on the low-level concurrent machine model. To the best of our knowledge this is the first example of pervasive formal verification of software communicating with devices.
机译:通过需求分页的内存虚拟化是每个现代操作系统的关键组成部分。形式验证非常具有挑战性,因为有关页面错误处理程序的推理必须涵盖两个并发的计算源:处理器和硬盘。我们准确地对设备和页面错误处理程序的交错执行进行建模,这是用高级编程语言和内联汇编程序部分编写的。我们描述了如何在低级并发机器模型上组合有关页面错误处理程序的顺序Hoare逻辑样式推理的结果。据我们所知,这是对与设备通信的软件进行全面形式验证的第一个示例。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号