Vx86: x86 Assembler Simulated in C Powered by Automated Theorem Proving
AMAST 2008 Proceedings of the 12th international conference on Algebraic Methodology and Software Technology
Formally verifying isolation and availability in an idealized model of virtualization
FM'11 Proceedings of the 17th international conference on Formal methods
| Hi-index | 0.00 |
Efforts to validate the Microsoft Hypervisor – a low-level program that partitions a real MP machine into a a number of virtual MP pachines – has led to some interesting formal methods developments. We'll survey some of these, including – new algorithms for “optimal” stateless search and symbolic stateless search; – techniques to make stateless search practical for shared memory programs, including efficient shared memory instrumentation and optimal trace replay using breakpoints; – new techniques for model-based test generation, including the use of symbolic execution to eliminate redundancy and methods to handle invisible internal nondeterminism; – formal models of the x86/x64 TLB and cache systems; – verification of algorithms for efficient MP TLB virtualization, which has uncovered subtle design bugs; – formal analyses of memory sharing between mutually distrustful partitions, which has revealed some surprising cache attacks; – techniques for eliminating inductive constructs in first-order verification; – techniques for specifying and reasoning about C code.