Formally verifying exceptions for low-level code with separation logic
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1841809 (Why is no real title available?)
- A very modal model of a modern, major, general type system
- BI as an assertion language for mutable data structures
- Certifying low-level programs with hardware interrupts and preemptive threads
- Charge! A framework for higher-order separation logic in Coq
- Correctness of data representations involving heap data structures
- First steps in synthetic guarded domain theory: step-indexing in the topos of trees
- High-level separation logic for low-level code
- Hoare Logic for Realistically Modelled Machine Code
- Impredicative concurrent abstract predicates
- Program logic and equivalence in the presence of garbage collection.
- Program logics for certified compilers
- Toward compositional verification of interruptible OS kernels and device drivers
- Verifying object-oriented programs with higher-order separation logic in Coq
This page was built for publication: Formally verifying exceptions for low-level code with separation logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1683698)