Analyzing program analyses
From MaRDI portal
Recommendations
Cited in
(18)- Complete abstractions everywhere
- scientific article; zbMATH DE number 1324833 (Why is no real title available?)
- Improving program analyses, by structure untupling
- Maximal incompleteness as obfuscation potency
- Continuity analysis of programs
- Comparing Completeness Properties of Static Analyses and Their Logics
- Analysis of Knoop indentation
- Deciding program properties via complete abstractions on bounded domains
- Property-driven code obfuscations reinterpreting Jones-optimality in abstract interpretation
- Local completeness logic on Kleene algebra with tests
- Logics for extensional, locally complete analysis via domain refinements
- Context-sensitive meta-constraint systems for explainable program analysis
- On the Monniaux problem in abstract interpretation
- Broadening the applicability of local completeness analysis with intensional and extensional guarantees
- On the Monniaux problem in abstract interpretation
- A correctness and incorrectness program logic
- Abstract Lipschitz continuity. Combining semantic and quantitative approximations
- On frequency analysis of sequential program code execution
This page was built for publication: Analyzing program analyses
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2819811)