Fetching the paper…
Reading the bibliography…
Concolic testing combines program execution and symbolic analysis to explore the execution paths of a software program.
T. Roubicek, Relaxation in Optimization Theory and Variational Calculus . Berlin: Walter de Gruyter, 1997
1997
Earlier work this paper cites.
K. Hayhurst, D. Veerhusen, J. Chilenski, and L. Rierson, “A practical tutorial on modified condition/decision coverage,” NASA, Tech. Rep., 2001
2001
Earlier work this paper cites.
Z. Wang, E. P. Simoncelli, and A. C. Bovik, “Multiscale structural similarity for image quality assessment,” in Signals, Systems and Computers, Conference Record of the Thirty-Seventh Asilomar Conference on , 2003
2003
Earlier work this paper cites.
W. Visser, C. S. Pasareanu, and S. Khurshid, “Test input generation with Java PathFinder,” ACM SIGSOFT Software Engineering Notes , vol. 29, no. 4, pp. 97–107, 2004
2004
Earlier work this paper cites.
P. Godefroid, N. Klarlund, and K. Sen, “DART: directed automated random testing,” in Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation , 2005, pp. 213–223
2005
Earlier work this paper cites.
K. Sen, D. Marinov, and G. Agha, “CUTE: A concolic unit testing engine for C,” ACM SIGSOFT Software Engineering Notes , vol. 30, no. 5, pp. 263–272, 2005
2005
Earlier work this paper cites.
T. Xie, D. Marinov, W. Schulte, and D. Notkin, “Symstra: A framework for generating object-oriented unit tests using symbolic execution,” in International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS , ser. LNCS, vol. 3440. Springer, 2005, pp. 365–381
2005
Earlier work this paper cites.
C. Kaner, “Exploratory testing,” in Quality Assurance Institute Worldwide Annual Software Testing Conference , 2006
2006
Earlier work this paper cites.
C. Cadar, D. Dunbar, and D. R. Engler, “KLEE: Unassisted and automatic generation of high-coverage tests for complex systems programs,” in OSDI , vol. 8, 2008, pp. 209–224
2008
Earlier work this paper cites.
J. Burnim and K. Sen, “Heuristics for scalable dynamic test generation,” in Automated Software Engineering, ASE. 23rd International Conference on . IEEE, 2008, pp. 443–446
2008
Earlier work this paper cites.
P. Godefroid, M. Y. Levin, D. A. Molnar et al. , “Automated whitebox fuzz testing,” in NDSS , vol. 8, 2008, pp. 151–166
2008
Earlier work this paper cites.
V. Nair and G. E. Hinton, “Rectified linear units improve restricted Boltzmann machines,” in International Conference on Machine Learning , 2010, pp. 807–814
2010
Cited alongside, same era.
C. Szegedy, W. Zaremba, I. Sutskever, J. Bruna, D. Erhan, I. Goodfellow, and R. Fergus, “Intriguing properties of neural networks,” in International Conference on Learning Representations (ICLR) , 2014
2014
Cited alongside, same era.
R. Kannavara, C. J. Havlicek, B. Chen, M. R. Tuttle, K. Cong, S. Ray, and F. Xie, “Challenges and opportunities with concolic testing,” in Aerospace and Electronics Conference (NAECON), 2015 National . IEEE, 2015, pp. 374–378
2015
Cited alongside, same era.
K. Pei, Y. Cao, J. Yang, and S. Jana, “DeepXplore: Automated whitebox testing of deep learning systems,” in Proceedings of the 26th Symposium on Operating Systems Principles . ACM, 2017, pp. 1–18
2017
Cited alongside, same era.
2018
Closest in time.
2018
Closest in time.
T. Wiatowski and H. Bölcskei, “A mathematical theory of deep convolutional neural networks for feature extraction,” IEEE Transactions on Information Theory , vol. 64, no. 3, pp. 1845–1866, 2018
2018
Closest in time.
W. Ruan, X. Huang, and M. Kwiatkowska, “Reachability analysis of deep neural networks with provable guarantees,” in The 27th International Joint Conference on Artificial Intelligence, IJCAI , 2018, pp. 2651–2659
2018
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2017
Cited alongside, same era.
2017
Cited alongside, same era.
X. Huang, M. Kwiatkowska, S. Wang, and M. Wu, “Safety verification of deep neural networks,” in International Conference on Computer Aided Verification, CAV . Springer, 2017, pp. 3–29
2017
Cited alongside, same era.
G. Katz, C. Barrett, D. L. Dill, K. Julian, and M. J. Kochenderfer, “Reluplex: An efficient SMT solver for verifying deep neural networks,” in International Conference on Computer Aided Verification . Springer, 2017, pp. 97–117
2017
Cited alongside, same era.
C. Audet and W. Hare, Derivative-Free and Blackbox Optimization . Springer, 2017
2017
Cited alongside, same era.
M. Wicker, X. Huang, and M. Kwiatkowska, “Feature-guided black-box safety testing of deep neural networks,” in International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS . Springer, 2018, pp. 408–426
2018
Cited alongside, same era.
Y. Tian, K. Pei, S. Jana, and B. Ray, “DeepTest: Automated testing of deep-neural-network-driven autonomous cars,” in Proceedings of the 40th International Conference on Software Engineering . ACM, 2018, pp. 303–314
2018
Cited alongside, same era.
T. Gehr, M. Mirman, D. Drachsler-Cohen, P. Tsankov, S. Chaudhuri, and M. Vechev, “Ai2: Safety and robustness certification of neural networks with abstract interpretation,” in Security and Privacy (SP), 2018 IEEE Symposium on , 2018
2018
Closest in time.
M. Mirman, T. Gehr, and M. Vechev, “Differentiable abstract interpretation for provably robust neural networks,” in International Conference on Machine Learning , 2018, pp. 3575–3583
2018
Closest in time.
X. Wang, J. Sun, Z. Chen, P. Zhang, J. Wang, and Y. Lin, “Towards optimal concolic testing,” in Proceedings of the 40th International Conference on Software Engineering . ACM, 2018, pp. 291–302
2018
Closest in time.
S. Cha, S. Hong, J. Lee, and H. Oh, “Automatically generating search heuristics for concolic testing,” in Proceedings of the 40th International Conference on Software Engineering, ICSE . ACM, 2018, pp. 1244–1254
2018
Closest in time.
2018
Closest in time.