Pith. sign in

REVIEW 1 cited by

Fast Falsification of Neural Networks using Property Directed Testing

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2104.12418 v1 pith:VQ2RFBJ3 submitted 2021-04-26 cs.AI cs.LG

classification cs.AIcs.LG
keywords falsificationnetworksneuralunsafeverificationalgorithminstancessafety
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Neural networks are now extensively used in perception, prediction and control of autonomous systems. Their deployment in safety-critical systems brings forth the need for verification techniques for such networks. As an alternative to exhaustive and costly verification algorithms, lightweight falsification algorithms have been heavily used to search for an input to the system that produces an unsafe output, i.e., a counterexample to the safety of the system. In this work, we propose a falsification algorithm for neural networks that directs the search for a counterexample, guided by a safety property specification. Our algorithm uses a derivative-free sampling-based optimization method. We evaluate our algorithm on 45 trained neural network benchmarks of the ACAS Xu system against 10 safety properties. We show that our falsification procedure detects all the unsafe instances that other verification tools also report as unsafe. Moreover, in terms of performance, our falsification procedure identifies most of the unsafe instances faster, in comparison to the state-of-the-art verification tools for feed-forward neural networks such as NNENUM and Neurify and in many instances, by orders of magnitude.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees

    cs.LG 2025-07 conditional novelty 4.0 of 10

    Reordering branch-and-bound sub-problems by a counterexample-potentiality heuristic accelerates neural network verification, especially for falsified instances.

Pith tools