首页> 外文期刊>Journal of Automated Reasoning >Formal Memory Models for the Verification of Low-Level Operating-System Code
【24h】

Formal Memory Models for the Verification of Low-Level Operating-System Code

机译:用于验证底层操作系统代码的形式化内存模型

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

摘要

This article contributes to the field of operating-systems verification. It presents a formalization of virtual memory that extends to memory-mapped devices. Our formalization consists of a stack of three detailed formal memory models: physical memory (i.e., RAM), physically-addressable memory-mapped devices (including their respective side effects, access and alignment requirements), and page-table based virtual memory. Each model is formally shown to satisfy the plain-memory specification, a memory abstraction that enables efficient reasoning for type-correct programs. This stack of memory models was developed in an attempt to verify Nova, the Robin micro-hypervisor. It is a key component of our verification environment for operating-system kernels based on the interactive theorem prover PVS.
机译:本文对操作系统验证领域做出了贡献。它提出了一种虚拟内存的形式化,扩展到了内存映射的设备。我们的形式化包含三个详细的形式化内存模型的堆栈:物理内存(即RAM),可物理寻址的内存映射设备(包括它们各自的副作用,访问和对齐要求)以及基于页表的虚拟内存。正式显示了每种模型都满足纯内存规范,即一种内存抽象,可以对类型正确的程序进行有效的推理。开发这种内存模型栈是为了验证Robin超级管理程序Nova。它是我们基于交互式定理证明者PVS的操作系统内核验证环境的关键组件。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号