Fast polyhedra abstract domain
From MaRDI portal
Recommendations
- An efficient abstract domain for not necessarily closed polyhedra
- Fast computation of the modality of polygons
- scientific article; zbMATH DE number 3943560
- scientific article; zbMATH DE number 999656
- Polyhedral approaches
- scientific article; zbMATH DE number 4083375
- Fast detection of polyhedral intersection
- Separation and approximation of polyhedral objects
Cited in
(36)- Refinement to certify abstract interpretations: illustrated on linearization for polyhedra
- Improving neural network verification through spurious region guided refinement
- On the efficiency of convex polyhedra
- PPLite: zero-overhead encoding of NNC polyhedra
- A two-phase approach for conditional floating-point verification
- Memory-efficient fixpoint computation
- Static analysis of binary code with memory indirections using polyhedra
- scientific article; zbMATH DE number 1615255 (Why is no real title available?)
- Polyhedral approximation of multivariate polynomials using Handelman's theorem
- Speeding up polyhedral analysis by identifying common constraints
- Donut domains: efficient non-convex domains for abstract interpretation
- Sound bit-precise numerical domains
- Generalizing the template polyhedral domain
- ELINA
- Interval Polyhedra: An Abstract Domain to Infer Interval Linear Relationships
- Inferring Min and Max Invariants Using Max-Plus Polyhedra
- A scalable segmented decision tree abstract domain
- SubPolyhedra: A (More) Scalable Approach to Infer Linear Inequalities
- Static Analysis in Disjunctive Numerical Domains
- Lifting CDCL to template-based abstract domains for program verification
- The abstract domain of parallelotopes
- \textsf{TreeKs}: a functor to make numerical abstract domains scalable
- Property directed polyhedral abstraction
- Extending constraint-only representation of polyhedra with Boolean constraints
- An efficient abstract domain for not necessarily closed polyhedra
- Fast numerical program analysis with reinforcement learning
- Volume-based merge heuristics for disjunctive numeric domains
- Symbolic analysis of linear hybrid automata -- 25 years later
- Decoupling the ascending and descending phases in abstract interpretation
- Clustered relational thread-modular abstract interpretation with local traces
- Revisiting polyhedral analysis for hybrid systems
- Probabilistic counterexample guidance for safer reinforcement learning
- Broadening the applicability of local completeness analysis with intensional and extensional guarantees
- Memory-efficient fixpoint computation
- Scalable polyhedral verification of recurrent neural networks
- Pentagons: a weakly relational abstract domain for the efficient validation of array accesses
This page was built for publication: Fast polyhedra abstract domain
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5370845)
