A formally-verified alias analysis
From MaRDI portal
Recommendations
Cited in
(17)- ALIAS: a modular tool for finding backdoors for SAT
- CompCertS: a memory-aware verified C compiler using pointer as integer semantics
- A formal C memory model for separation logic
- System-level non-interference of constant-time cryptography. II: Verified static analysis and stealth memory
- \textsc{CompCertS}: a memory-aware verified C compiler using a pointer as integer semantics
- scientific article; zbMATH DE number 1693485 (Why is no real title available?)
- A generic framework for heap and value analyses of object-oriented programming languages
- Verified abstract interpretation techniques for disassembling low-level self-modifying code
- A logical analysis of aliasing in imperative higher-order functions
- Aliasing restrictions of C11 formalized in Coq
- Expression-Based Aliasing for OO–languages
- Pointer Analysis, Conditional Soundness, and Proving the Absence of Errors
- A logical analysis of aliasing in imperative higher-order functions
- Compiler Construction
- Evaluating the effectiveness of pointer alias analyses
- Uniqueness types for efficient and verifiable aliasing-free embedded systems programming
- Transformational derivation of an improved alias analysis algorithm
This page was built for publication: A formally-verified alias analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4916050)