SMT-based modeling and verification of spiking neural networks: a case study

DOI10.1007/978-3-031-24950-1_2zbMATH Open1529.68151OpenAlexW4316662741MaRDI QIDQ6132487FDOQ6132487

Authors Soham Banerjee, Sumana Ghosh, Ansuman Banerjee, Swarup K. Mohalik

Publication date 17 August 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-24950-1_2

zbMATH Keywords

verificationsatisfiability modulo theoryspiking neural networksadversarial robustness

Mathematics Subject Classification ID

Neural networks for/in biological studies, artificial life and related topics (92B20) Specification and verification (program logics, model checking, etc.) (68Q60) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Recommendations

• Modelling and verification of weighted spiking neural systems
• Formal verification for quantized neural networks
• The convergence analysis of spikeprop algorithm with smoothing \(L_{1/2}\) regularization
• Challenging SMT solvers to verify neural networks
• An SMT-based approach for verifying binarized neural networks

Cites work

• scientific article; zbMATH DE number 2102690 (Why is no real title available?)
• An abstraction-based framework for neural network verification
• Modelling and verification of weighted spiking neural systems
• Reluplex: an efficient SMT solver for verifying deep neural networks
• Verification of temporal properties of neuronal archetypes modeled as synchronous reactive systems

Cited in

(2)

• On neural network equivalence checking using SMT solvers
• Challenging SMT solvers to verify neural networks

This page was built for publication: SMT-based modeling and verification of spiking neural networks: a case study

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6132487)