{'fraction_non_alphanumeric': 0.0189873417721519, 'fraction_numerical': 0.0, 'mean_word_length': 5.436046511627907, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Dynamic and Scalable Deep Neural Network Verification Algorithm

Deep neural networks have widely used for dealing with complex real-world problems. However, a major concern in applying them to safety-critical systems is the great difficulty in providing formal guarantees about their behavior. Verifying its behavior means study the evolution of its outputs depending on the variation of its inputs. This verification is crucial in an uncertain environment where neural network inputs are noisy. In this paper, we propose an efficient technique for verifying feed-forward neural networks properties. In order to quantify the behavior of the proposed algorithm, we introduce different neural network scenarios to highlight the robustness according to predefined metrics and constraints. The proposed technique is based on the linearization of the non-convex Rectified Linear Unit (ReLU) activation function using the Big-M optimization approach. Moreover, we contribute by an iterative process to find the largest input range verifying (and then defining) the neural network proprieties of neural networks.