Verifying shadow page table algorithms

Authors:
Eyad Alkassar;Ernie Cohen;Mark Hillebrand;Mikhail Kovalev;Wolfgang J. Paul
Affiliations:
Saarland University, Saarbrücken, Germany;European Microsoft Innovation Center (EMIC GmbH), Aachen, Germany;European Microsoft Innovation Center (EMIC GmbH), Aachen, Germany;Saarland University, Saarbrücken, Germany;Saarland University, Saarbrücken, Germany
Venue:
Proceedings of the 2010 Conference on Formal Methods in Computer-Aided Design
Year:
2010

Citing 0
Cited 6

Formally verifying isolation and availability in an idealized model of virtualization

FM'11 Proceedings of the 17th international conference on Formal methods
Verification of TLB virtualization implemented in c

VSTTE'12 Proceedings of the 4th international conference on Verified Software: theories, tools, experiments
Parametric verification of address space separation

POST'12 Proceedings of the First international conference on Principles of Security and Trust
Memory virtualization for MIPS processor based cloud server

GPC'12 Proceedings of the 7th international conference on Advances in Grid and Pervasive Computing
Completing the automated verification of a small hypervisor - assembler code verification

SEFM'12 Proceedings of the 10th international conference on Software Engineering and Formal Methods
Comprehensive formal verification of an OS microkernel

ACM Transactions on Computer Systems (TOCS)

Quantified Score

Hi-index	0.00

Visualization

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.