Verifying a Binary Micro-Hypervisor Intercept Handler
نویسندگان
چکیده
Hypervisors provide a security foundation of cloud computing, yet have suffered exploits. Efforts at formal verification have included codevelopment (XMHF) and interactive theorem proving (seL4). A technique that can be quickly applied to existing hypervisors is desirable. We examine binaries by extending the Binary Analysis Platform (BAP) to include the required system mode instructions used by hypervisors. We translate the BAP output to Boogie, a language which is then converted to an SMT formula, and define a security property that the hypervisor response to guest execution does not modify the hypervisor code pages. We use BAP and Boogie to automatically detect one ported and two injected bugs and verify that 1000 random traces through the intercept handler do not violate our property. We identify constructs that are difficult to verify automatically. Our tool should be usable in analyzing other hypervisors.
منابع مشابه
Technical Information on Vulnerabilities of Hypercall Handlers
Modern virtualized service infrastructures expose attack vectors that enable attacks of high severity, such as attacks targeting hypervisors. A malicious user of a guest VM (virtual machine) may execute an attack against the underlying hypervisor via hypercalls, which are software traps from a kernel of a fully or partially paravirtualized guest VM to the hypervisor. The exploitation of a vulne...
متن کاملüberSpark: Enforcing Verifiable Object Abstractions for Automated Compositional Security Analysis of a Hypervisor
We present überSpark (üSpark), an innovative architecture for compositional verification of security properties of extensible hypervisors written in C and Assembly. üSpark comprises two key ideas: (i) endowing low-level system software with abstractions found in higher-level languages (e.g., objects, interfaces, function-call semantics for implementations of interfaces, access control on interf...
متن کاملDeciding First-order Logic with Real and Integer Addition: an Automata-based Approach
Formal verification of complex systems requires efficient decision procedures for logics. In this thesis, we analyze an automata-based approach to decide first-order logic with real and integer addition using a variant of Büchi automata to represent solutions of formulas in the above mentioned logic. We leverage binary decision diagram techniques for representing the automata, and analyze algor...
متن کاملBMDs Can Delay the Use of Theorem Proving for Verifying Arithmetic Assembly Instructions
We address the problem of formally verifying arithmetic instructions of microprocessors implemented by microprograms that contain loops. We try to avoid theorem proving techniques using a new symbolic representation: Binary Moment Diagrams (*BMDs). In order to use *BMDs for verifying sequential circuits as well as micro-programs, we extend this representation and deene several bit-vector level ...
متن کاملFormal Methods in the Robin project: Specification and verification of the Nova microhypervisor
The objective of the Robin project is to develop an open robust computing infrastructure. The Nova micro hypervisor is currently being developed as a basis for this robust infrastructure. One workpackage of Robin concentrates on the application of formal methods to this newly developed micro hypervisor. The goals within Robin are (1) to verify some properties of a selected hypervisor module and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013