Name
Abstract | ||
|---|---|---|
We present StarChild and Lazuli, two libraries which leverage refinement types to verify neural networks, implemented in F∗ and Liquid Haskell. Refinement types are types augmented, or refined, with assertions about values of that type, e.g., \"integers greater than five\", which are checked by an SMT solver. Crucially, these assertions are written in the language itself. A user of our library can refine the type of neural networks, e.g., \"neural networks which are robust against adversarial attacks\", and expect F∗ to handle the verification of this claim for any specific network, without having to change the representation of the network, or even having to learn about SMT solvers. Our initial experiments indicate that our approach could greatly reduce the burden of verifying neural networks. Unfortunately, they also show that SMT solvers do not scale to the sizes required for neural network verification. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1007/978-3-030-64437-6_4 | APLAS |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
0 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wen Kokke | 1 | 0 | 0.34 |
| Ekaterina Komendantskaya | 2 | 0 | 0.34 |
| Daniel Windheiser | 3 | 129 | 24.82 |
| Robert Atkey | 4 | 289 | 19.16 |
| David Aspinall | 5 | 2 | 1.73 |