Fast polyhedra abstract domain
From MaRDI portal
Publication:5370845
DOI10.1145/3009837.3009885zbMath1380.68131OpenAlexW2566919497MaRDI QIDQ5370845
Markus Püschel, Martin Vechev, Gagandeep Singh
Publication date: 20 October 2017
Published in: Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3009837.3009885
partitionsperformance optimizationabstract interpretationnumerical program analysispolyhedra decomposition
Related Items (9)
On the efficiency of convex polyhedra ⋮ Scalable polyhedral verification of recurrent neural networks ⋮ Symbolic analysis of linear hybrid automata -- 25 years later ⋮ Decoupling the ascending and descending phases in abstract interpretation ⋮ PPLite: zero-overhead encoding of NNC polyhedra ⋮ A two-phase approach for conditional floating-point verification ⋮ Memory-efficient fixpoint computation ⋮ Improving neural network verification through spurious region guided refinement ⋮ ELINA
Uses Software
This page was built for publication: Fast polyhedra abstract domain