Theorem Proving in Higher Order Logics
From MaRDI portal
Publication:5477643
Recommendations
Cited in
(18)- Certifying low-level programs with hardware interrupts and preemptive threads
- Toward compositional verification of interruptible OS kernels and device drivers
- Proving fairness and implementation correctness of a microkernel scheduler
- Experience report: seL4, formally verifying a high-performance microkernel
- SOME RESULTS ON (PRE)KERNEL CATCHERS AND THE COINCIDENCE OF THE KERNEL WITH PREKERNEL
- Concerned with the unprivileged: user programs in kernel refinement
- Formal refinement for operating systems kernels.
- Modular verification of preemptive OS kernels
- scientific article; zbMATH DE number 1751915 (Why is no real title available?)
- On the correctness of upper layers of automotive systems
- From a proven correct microkernel to trustworthy large systems
- Towards applying the composition principle to verify a microkernel operating system
- Formal models of operating system kernels
- Correct Hardware Design and Verification Methods
- scientific article; zbMATH DE number 3845012 (Why is no real title available?)
- Operating system verification---an overview
- Secure Microkernels, State Monads and Scalable Refinement
- Balancing the load. Leveraging a semantics stack for systems verification
This page was built for publication: Theorem Proving in Higher Order Logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5477643)