Minimum Time Maximum Fault Coverage Testing of Spiking Neural Networks

We present a novel test generation algorithm for hardware accelerators of Spiking Neural Networks (SNNs). The algorithm is based on advanced optimization tailored for the spiking domain. It adaptively crafts input samples towards high coverage of hardware-level faults. Time-consuming fault simulation during test generation is circumvented by defining loss functions targeting the maximization of fault sensitisation and fault effect propagation to the output. Comparing the proposed algorithm to the existing ones on three benchmarks, it scales up for large SNN models, and it drastically reduces the test generation runtime from days to hours and the test duration from minutes to seconds. The resultant test input shows near perfect fault coverage and has a duration equivalent to a few dataset samples, thus, besides post-manufacturing testing, it is also suited for in-field testing.

Authors

Institutions

Publication Details

Published
2025-03-31
DOI
https://doi.org/10.23919/date64628.2025.10993048
Citations
2
Primary Topic
Advanced Memory and Neural Computing
Type
article
Field-Weighted Citation Impact
1.46
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Minimum Time Maximum Fault Coverage Testing of Spiking Neural Networks

Haralampos‐G. Stratigopoulos, Spyridon Raptis
2 citations
Advanced Memory and Neural Computing
1.46
article

Minimum Time Maximum Fault Coverage Testing of Spiking Neural Networks

Haralampos‐G. Stratigopoulos, Spyridon Raptis
article en
2 citations

Abstract

We present a novel test generation algorithm for hardware accelerators of Spiking Neural Networks (SNNs). The algorithm is based on advanced optimization tailored for the spiking domain. It adaptively crafts input samples towards high coverage of hardware-level faults. Time-consuming fault simulation during test generation is circumvented by defining loss functions targeting the maximization of fault sensitisation and fault effect propagation to the output. Comparing the proposed algorithm to the existing ones on three benchmarks, it scales up for large SNN models, and it drastically reduces the test generation runtime from days to hours and the test duration from minutes to seconds. The resultant test input shows near perfect fault coverage and has a duration equivalent to a few dataset samples, thus, besides post-manufacturing testing, it is also suited for in-field testing.

Centre National de la Recherche Scientifique (FR), Sorbonne Université (FR), LIP6 (FR)
Climate action
Openalex Percentile: Top 20%
Advanced Memory and Neural Computing
1.46
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Minimum Time Maximum Fault Coverage Testing of Spiking Neural Networks — Haralampos‐G. Stratigopoulos, Spyridon Raptis · (2025) | TGRS Research Map | TGRS