The octatope abstract domain for verification of neural networks
From MaRDI portal
Publication:6174546
DOI10.1007/978-3-031-27481-7_26zbMath1529.68150MaRDI QIDQ6174546
Alvaro Velasquez, Ashutosh Trivedi, K. Subramani and Vahan Mkrtchyan, Stanley Bak, Piotr J. Wojciechowski, Taylor Dohmen
Publication date: 17 August 2023
Published in: Formal Methods (Search for Journal in Brave)
Artificial neural networks and deep learning (68T07) Specification and verification (program logics, model checking, etc.) (68Q60)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Robustness verification of semantic segmentation neural networks using relaxed reachability
- The octagon abstract domain
- A polynomial time primal network simplex algorithm for minimum cost flows
- Reluplex: an efficient SMT solver for verifying deep neural networks
- Verification of deep convolutional neural networks using ImageStars
- Improved geometric path enumeration for verifying ReLU neural networks
- Finding minimum-cost circulations by canceling negative cycles
- Parsimonious, Simulation Based Verification of Linear Systems
- Solving Linear Programs in the Current Matrix Multiplication Time
- Probabilistic Horn Clause Verification
- Subexponential lower bounds for randomized pivoting rules for the simplex algorithm
- Frontiers of Combining Systems
This page was built for publication: The octatope abstract domain for verification of neural networks
