Concolic testing combines program execution and symbolic analysis to explore the execution paths of a software program. In this paper, we develop the first concolic testing approach for Deep Neural Networks (DNNs). More specifically, we utilise quantified linear arithmetic over rationals to express test requirements that have been studied in the literature, and then develop a coherent method to perform concolic testing with the aim of better coverage. Our experimental results show the effectiveness of the concolic testing approach in both achieving high coverage and finding adversarial examples.
|Title of host publication||Proceedings of the 33rd ACM/IEEE International Conference on Automated Software Engineering|
|Publisher||Association for Computing Machinery (ACM)|
|Number of pages||11|
|Publication status||Published - 03 Sep 2018|