Automatic analysis of pointer aliasing for untyped programs
From MaRDI portal
Publication:1818078
Recommendations
- Evaluating the effectiveness of pointer alias analyses
- A new approach to pointer analysis for assignments
- Static Analysis
- A novel analysis space for pointer analysis and its application for bug finding
- scientific article; zbMATH DE number 1251180
- A Systematic Approach to Probabilistic Pointer Analysis
Cited in
(11)- Alias analysis pointers in Pascal and Fortran 90. I: Dependence analysis between pointer references
- Quantitative static analysis of communication protocols using abstract Markov chains
- Generalised multi-pattern-based verification of programs with linear linked structures
- Alias calculus for a simple imperative language with decidable pointer arithmetic
- Automatic inference of stationary fields, a generalization of Java's final fields
- scientific article; zbMATH DE number 1948387 (Why is no real title available?)
- scientific article; zbMATH DE number 1760024 (Why is no real title available?)
- Abstract cofibered domains: application to the alias analysis of untyped programs
- Evaluating the effectiveness of pointer alias analyses
- Abstract interpretation of graphs
- A novel analysis space for pointer analysis and its application for bug finding
This page was built for publication: Automatic analysis of pointer aliasing for untyped programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1818078)