验证影子页表算法

2016 Formal Methods in Computer-Aided Design (FMCAD) Pub Date : 2010-10-20 DOI:10.5555/1998496.1998543

Eyad Alkassar, Ernie Cohen, Mark A. Hillebrand, Mikhail Kovalev, W. Paul

{"title":"验证影子页表算法","authors":"Eyad Alkassar, Ernie Cohen, Mark A. Hillebrand, Mikhail Kovalev, W. Paul","doi":"10.5555/1998496.1998543","DOIUrl":null,"url":null,"abstract":"Efficient virtualization of translation lookaside buffers (TLBs), a core component of modern hypervisors, is complicated by the concurrent, speculative walking of page tables in hardware. We give a formal model of an x64-like TLB, criteria for its correct virtualization, and outline the verification of a virtualization algorithm using shadow page tables. The verification is being carried out in VCC, a verifier for concurrent C code.","PeriodicalId":6479,"journal":{"name":"2016 Formal Methods in Computer-Aided Design (FMCAD)","volume":"1 1","pages":"267-270"},"PeriodicalIF":0.0000,"publicationDate":"2010-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"35","resultStr":"{\"title\":\"Verifying shadow page table algorithms\",\"authors\":\"Eyad Alkassar, Ernie Cohen, Mark A. Hillebrand, Mikhail Kovalev, W. Paul\",\"doi\":\"10.5555/1998496.1998543\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Efficient virtualization of translation lookaside buffers (TLBs), a core component of modern hypervisors, is complicated by the concurrent, speculative walking of page tables in hardware. We give a formal model of an x64-like TLB, criteria for its correct virtualization, and outline the verification of a virtualization algorithm using shadow page tables. The verification is being carried out in VCC, a verifier for concurrent C code.\",\"PeriodicalId\":6479,\"journal\":{\"name\":\"2016 Formal Methods in Computer-Aided Design (FMCAD)\",\"volume\":\"1 1\",\"pages\":\"267-270\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-10-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"35\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 Formal Methods in Computer-Aided Design (FMCAD)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.5555/1998496.1998543\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 Formal Methods in Computer-Aided Design (FMCAD)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5555/1998496.1998543","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 35

摘要

翻译暂置缓冲区(tlb)是现代管理程序的核心组件，它的高效虚拟化由于硬件中页表的并发、推测式遍历而变得复杂。我们给出了类似x64的TLB的形式化模型、正确虚拟化的标准，并概述了使用影子页表对虚拟化算法的验证。验证是在VCC中进行的，VCC是并发C代码的验证器。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Verifying shadow page table algorithms

Efficient virtualization of translation lookaside buffers (TLBs), a core component of modern hypervisors, is complicated by the concurrent, speculative walking of page tables in hardware. We give a formal model of an x64-like TLB, criteria for its correct virtualization, and outline the verification of a virtualization algorithm using shadow page tables. The verification is being carried out in VCC, a verifier for concurrent C code.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2016 Formal Methods in Computer-Aided Design (FMCAD)

自引率

0.00%

发文量