Abstract: Mechanisms for verifying software are provided, the mechanisms including: identifying a plurality of layers of code of the software including a lowest layer, a middle layer, and a highest layer; generating a low-level specification and an identical refinement proof for each of the plurality of layers using a hardware processor; generating a high-level specification and a lifting refinement proof for each of the plurality of layers; and verifying the software based on the low-level specifications, the identical refinement proofs, the high-level specifications, and the lifting refinement proofs. In some embodiments, one of the low-level specifications is generated using Fixedpoint construction. In some embodiments, one of the high-level specifications is generated by applying a set of transformation rules to one of the low-level specifications.

Abstract: Mechanisms for proving the correctness of software on relaxed memory hardware are provided, the mechanisms comprising: receiving a specification, a hardware model, and an implementation for the software to be executed on the relaxed memory hardware; evaluating the software using a sequentially consistent hardware model; evaluating the software using a relaxed memory hardware model and at least one of the following conditions: a data-race-free (DRF)-kernel condition; a no-barrier-misuse condition; a memory-isolation condition; a transactional-page-table condition; a write-once-kernel-mapping condition; and a weak-memory-isolation condition; and outputting an indication of whether the software is correct based on the evaluating the software using the sequentially consistent hardware model and the evaluating the software using the relaxed memory hardware model.

Abstract: Mechanisms for verifying software on a multi-CPU machine are provided, the mechanisms including: using a hardware processor: reordering, in a shared log, a first local CPU event from a local CPU operating on a shared object to be before at least one first prior oracle query corresponding to a prior event from another CPU based on whether the first local CPU event can be reordered with respect to the prior event without changing the multi-CPU machine's behavior with respect to the shared object; merging first consecutive oracle queries including the at least one first prior oracle query in the shared log; and verifying the software based on the merged first consecutive oracle queries.

Abstract: Systems and methods for formal verification of programs. The systems and methods provide a new game-theoretical, strategy-based compositional semantic model for concurrency, a set of formal linking theorems for composing multithreaded and multicore concurrent layers, and a compiler that supports certified thread-safe compilation and linking. Verification of an overlay interface can include determining an intermediate strategy for a primitive operation running on an underlay interface and refining that intermediate strategy to a strategy running on the overlay interface by applying a vertical and a horizontal composition rule. The refined strategy can then be composed with compatible strategies running on the overlay interface according to a parallel composition rule. Strategies may be compatible when rely conditions imposed by each strategy satisfy guarantees provided by the other strategies. The system and method of formal verification can be applied to formal verification of smart contracts.

Abstract: Systems and methods for formal verification of programs. The systems and methods provide a new game-theoretical, strategy-based compositional semantic model for concurrency, a set of formal linking theorems for composing multithreaded and multicore concurrent layers, and a compiler that supports certified thread-safe compilation and linking. Verification of an overlay interface can include determining an intermediate strategy for a primitive operation running on an underlay interface and refining that intermediate strategy to a strategy running on the overlay interface by applying a vertical and a horizontal composition rule. The refined strategy can then be composed with compatible strategies running on the overlay interface according to a parallel composition rule. Strategies may be compatible when rely conditions imposed by each strategy satisfy guarantees provided by the other strategies. The system and method of formal verification can be applied to formal verification of smart contracts.

Abstract: Systems and methods for formal verification of programs. The systems and methods provide a new game-theoretical, strategy-based compositional semantic model for concurrency, a set of formal linking theorems for composing multithreaded and multicore concurrent layers, and a compiler that supports certified thread-safe compilation and linking. Verification of an overlay interface can include determining an intermediate strategy for a primitive operation running on an underlay interface and refining that intermediate strategy to a strategy running on the overlay interface by applying a vertical and a horizontal composition rule. The refined strategy can then be composed with compatible strategies running on the overlay interface according to a parallel composition rule. Strategies may be compatible when rely conditions imposed by each strategy satisfy guarantees provided by the other strategies. The system and method of formal verification can be applied to formal verification of smart contracts.

Abstract: Mechanisms for proving the correctness of software on relaxed memory hardware are provided, the mechanisms comprising: receiving a specification, a hardware model, and an implementation for the software to be executed on the relaxed memory hardware; evaluating the software using a sequentially consistent hardware model; evaluating the software using a relaxed memory hardware model and at least one of the following conditions: a data-race-free (DRF)-kernel condition; a no-barrier-misuse condition; a memory-isolation condition; a transactional-page-table condition; a write-once-kernel-mapping condition; and a weak-memory-isolation condition; and outputting an indication of whether the software is correct based on the evaluating the software using the sequentially consistent hardware model and the evaluating the software using the relaxed memory hardware model.

Abstract: Systems comprising: a memory; and a hardware processor and configured to: execute a hypervisor having a first portion and a second portion, wherein the first portion of the hypervisor executes at a first exception level that allows the first portion to access data of a virtual machine in the hardware processor and the memory, and wherein the second portion of the hypervisor executes at a second exception level that prevents the second portion from accessing the data of the virtual machine in the hardware processor and the memory. Methods comprising: executing a first portion of a hypervisor at a first exception level that allows the first portion to access data of a virtual machine in a hardware processor and memory; and executing a second portion of a hypervisor at a second exception level that prevents the second portion from accessing the data in the hardware processor and the memory.

Abstract: Systems and methods for formal verification of programs. The systems and methods provide a new game-theoretical, strategy-based compositional semantic model for concurrency, a set of formal linking theorems for composing multithreaded and multicore concurrent layers, and a compiler that supports certified thread-safe compilation and linking. Verification of an overlay interface can include determining an intermediate strategy for a primitive operation running on an underlay interface and refining that intermediate strategy to a strategy running on the overlay interface by applying a vertical and a horizontal composition rule. The refined strategy can then be composed with compatible strategies running on the overlay interface according to a parallel composition rule. Strategies may be compatible when rely conditions imposed by each strategy satisfy guarantees provided by the other strategies. The system and method of formal verification can be applied to formal verification of smart contracts.