Pages that link to "Item:Q3189788"

The following pages link to Types, bytes, and separation logic (Q3189788):

Displaying 24 items.

• Function extraction (Q436372) (← links)
• Establishing flight software reliability: testing, model checking, constraint-solving, monitoring and learning (Q457250) (← links)
• Formal verification of C systems code. Structured types, separation logic and theorem proving (Q835768) (← links)
• Formal memory models for the verification of low-level operating-system code (Q835773) (← links)
• Formalizing non-interference for a simple bytecode language in Coq (Q931434) (← links)
• Formal verification of a C-like memory model and its uses for verifying program transformations (Q945054) (← links)
• Operating system verification---an overview (Q1040002) (← links)
• A formal C memory model for separation logic (Q1694027) (← links)
• A verified CompCert front-end for a memory model supporting pointer arithmetic and uninitialised data (Q1739908) (← links)
• HOL-Boogie -- an interactive prover-backend for the verifying C compiler (Q2655335) (← links)
• A Framework for the Automatic Formal Verification of Refinement from Cogent to C (Q2829268) (← links)
• Aliasing Restrictions of C11 Formalized in Coq (Q2938039) (← links)
• A Concrete Memory Model for CompCert (Q2945624) (← links)
• From a Proven Correct Microkernel to Trustworthy Large Systems (Q3067529) (← links)
• A Machine-Checked Framework for Relational Separation Logic (Q3095237) (← links)
• Types, Maps and Separation Logic (Q3183535) (← links)
• Practical Tactics for Separation Logic (Q3183539) (← links)
• A Formalisation of Smallfoot in HOL (Q3183546) (← links)
• The Isabelle Framework (Q3543647) (← links)
• Imperative Functional Programming with Isabelle/HOL (Q3543655) (← links)
• Secure Microkernels, State Monads and Scalable Refinement (Q3543657) (← links)
• Lightweight Separation (Q3543659) (← links)
• Cogent: uniqueness types and certifying compilation (Q5019022) (← links)
• Separation Logic Tutorial (Q5504642) (← links)