The following pages link to Fast polyhedra abstract domain (Q5370845):
Displaying 15 items.
- ELINA (Q33544) (← links)
- Scalable polyhedral verification of recurrent neural networks (Q832168) (← links)
- Pentagons: a weakly relational abstract domain for the efficient validation of array accesses (Q988565) (← links)
- Refinement to certify abstract interpretations: illustrated on linearization for polyhedra (Q1739912) (← links)
- Improving neural network verification through spurious region guided refinement (Q2044215) (← links)
- On the efficiency of convex polyhedra (Q2130564) (← links)
- PPLite: zero-overhead encoding of NNC polyhedra (Q2216124) (← links)
- A two-phase approach for conditional floating-point verification (Q2233493) (← links)
- Memory-efficient fixpoint computation (Q2233524) (← links)
- Speeding up polyhedral analysis by identifying common constraints (Q2814112) (← links)
- An efficient abstract domain for not necessarily closed polyhedra (Q6041169) (← links)
- Symbolic analysis of linear hybrid automata -- 25 years later (Q6113970) (← links)
- Clustered relational thread-modular abstract interpretation with local traces (Q6535225) (← links)
- Revisiting polyhedral analysis for hybrid systems (Q6536287) (← links)
- Probabilistic counterexample guidance for safer reinforcement learning (Q6546466) (← links)
