A scalable segmented decision tree abstract domain
From MaRDI portal
Publication:3587252
Recommendations
Cites work
- scientific article; zbMATH DE number 3485178 (Why is no real title available?)
- scientific article; zbMATH DE number 3610766 (Why is no real title available?)
- scientific article; zbMATH DE number 1487852 (Why is no real title available?)
- A lattice-theoretical fixpoint theorem and its applications
- A parametric segmentation functor for fully automatic and scalable array content analysis
- Abstract Interpretation Frameworks
- Abstract interpretation and application to logic programs
- Abstract interpretation using typed decision graphs
- Graph-Based Algorithms for Boolean Function Manipulation
- Programming Languages and Systems
- Static analysis of arithmetical congruences
- Systematic design of program transformation frameworks by abstract interpretation
- The octagon abstract domain
- Verification by abstract interpretation
Cited in
(12)- Access-based localization for octagons
- Range and set abstraction using SAT
- A decision tree lifted domain for analyzing program families with numerical features
- \textsf{TreeKs}: a functor to make numerical abstract domains scalable
- Partitioned memory models for program analysis
- Quadtrees as an abstract domain
- Finding suitable variability abstractions for lifted analysis
- A parametric segmentation functor for fully automatic and scalable array content analysis
- scientific article; zbMATH DE number 7559486 (Why is no real title available?)
- String abstract domains and their combination
- Why does Astrée scale up?
- Quantitative program sketching using lifted static analysis
This page was built for publication: A scalable segmented decision tree abstract domain
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3587252)