Fetching the paper…
Reading the bibliography…
Symbolic execution is a powerful technique for program analysis.
Learning polynomials with neural networks. In International Conference on Machine Learning
Alexandr Andoni, Rina Panigrahy, Gregory Valiant, and Li Zhang. 2014 · 1916
Earlier work this paper cites.
Dropout: A simple way to prevent neural networks from overfitting
Nitish Srivastava, Geoffrey Hinton, Alex Krizhevsky, Ilya Sutskever, and Ruslan Salakhutdinov. 2014 · 1958
Earlier work this paper cites.
A machine program for theorem-proving
Martin Davis, George Logemann, and Donald Loveland. 1962 · 1962
Earlier work this paper cites.
On the solution of ill-posed problems and the method of regularization. In Doklady Akademii Nauk
Andrei Nikolaevich Tikhonov. 1963 · 1963
Earlier work this paper cites.
Symbolic Execution and Program Testing
J.C. King. 1976a · 1976
Earlier work this paper cites.
Symbolic execution and program testing
James C King. 1976b · 1976
Earlier work this paper cites.
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Patrick Cousot and Radhia Cousot. 1977 · 1977
Earlier work this paper cites.
Automatic discovery of linear restraints among variables of a program. In Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Patrick Cousot and Nicolas Halbwachs. 1978 · 1978
Earlier work this paper cites.
Formal Program Verification using Symbolic Execution
R.B. Dannenberg and G.W. Ernst. 1982 · 1982
Earlier work this paper cites.
Newton’s method with a model trust region modification
Danny C Sorensen. 1982 · 1982
Earlier work this paper cites.
Breadth-first search
Alan Bundy and Lincoln Wallen. 1984 · 1984
Earlier work this paper cites.
Learning internal representations by error propagation
David E Rumelhart, Geoffrey E Hinton, and Ronald J Williams. 1985 · 1985
Earlier work this paper cites.
On the approximate realization of continuous mappings by neural networks
Ken-Ichi Funahashi. 1989 · 1989
Earlier work this paper cites.
Approximation capabilities of multilayer feedforward networks
Kurt Hornik. 1991 · 1991
Earlier work this paper cites.
GRASP—a new search algorithm for satisfiability. In Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
João P Marques Silva and Karem A Sakallah. 1997 · 1996
Earlier work this paper cites.
Face recognition: A convolutional neural-network approach
Steve Lawrence, C Lee Giles, Ah Chung Tsoi, and Andrew D Back. 1997 · 1997
Earlier work this paper cites.
On the momentum term in gradient descent learning algorithms
Ning Qian. 1999 · 1999
Earlier work this paper cites.
Using symbolic execution for verifying safety-critical systems. In ACM SIGSOFT Software Engineering Notes
Alberto Coen-Porisini, Giovanni Denaro, Carlo Ghezzi, and Mauro Pezzé. 2001 · 2001
Earlier work this paper cites.
Recurrent neural networks
LR Medsker and LC Jain. 2001 · 2001
Earlier work this paper cites.
Chaff: Engineering an efficient SAT solver. In Proceedings of the 38th annual Design Automation Conference
Matthew W Moskewicz, Conor F Madigan, Ying Zhao, Lintao Zhang, and Sharad Malik. 2001 · 2001
Earlier work this paper cites.
Linear invariant generation using non-linear constraint solving. In International Conference on Computer Aided Verification
Michael A Colón, Sriram Sankaranarayanan, and Henny B Sipma. 2003 · 2003
Earlier work this paper cites.
Interpolation and SAT-based Model Checking. In International Conference on Computer Aided Verification
Ken McMillan. 2003 · 2003
Earlier work this paper cites.
Weakly relational numerical abstract domains
Antoine Miné. 2004 · 2004
Earlier work this paper cites.
Testing static analysis tools using exploitable buffer overflows from open source code. In ACM SIGSOFT Software Engineering Notes
Misha Zitser, Richard Lippmann, and Tim Leek. 2004 · 2004
Earlier work this paper cites.
The ASTRÉE analyzer. In European Symposium on Programming
Patrick Cousot, Radhia Cousot, Jérôme Feret, Laurent Mauborgne, Antoine Miné, David Monniaux, and Xavier Rival. 2005 · 2005
Earlier work this paper cites.
DART: Directed Automated Random Testing. In Proceedings of International Symposium on Programming Language Design and Implementation (PLDI)
Patrice Godefroid, Nils Klarlund, and Koushik Sen. 2005 · 2005
Earlier work this paper cites.
EXE: Automatically Generating Inputs of Death. In Proceedings of the 13th ACM Conference on Computer and Communications Security
Cristian Cadar, Vijay Ganesh, Peter M. Pawlowski, David L. Dill, and Dawson R. Engler. 2006 · 2006
Earlier work this paper cites.
A practical and complete approach to predicate refinement. In International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Ranjit Jhala and Kenneth L McMillan. 2006 · 2006
Earlier work this paper cites.
Cubic regularization of Newton method and its global performance
Yurii Nesterov and Boris T Polyak. 2006 · 2006
Earlier work this paper cites.
Type-dependence analysis and program transformation for symbolic execution. In International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Saswat Anand, Alessandro Orso, and Mary Jean Harrold. 2007 · 2007
Earlier work this paper cites.
Path invariants. In Acm Sigplan Notices
Dirk Beyer, Thomas A Henzinger, Rupak Majumdar, and Andrey Rybalchenko. 2007 · 2007
Earlier work this paper cites.
Discoverer: Automatic Protocol Reverse Engineering from Network Traces.. In USENIX Security Symposium
Weidong Cui, Jayanthkumar Kannan, and Helen J Wang. 2007 · 2007
Earlier work this paper cites.
The Daikon system for dynamic detection of likely invariants
Michael D Ernst, Jeff H Perkins, Philip J Guo, Stephen McCamant, Carlos Pacheco, Matthew S Tschantz, and Chen Xiao. 2007 · 2007
Cited alongside, same era.
Compositional Dynamic Test Generation. In Proceedings of 34th Symposium on Principles of Programming Languages (POPL)
Patrice Godefroid. 2007 · 2007
Cited alongside, same era.
Automatic generation of polynomial invariants of bounded degree using abstract interpretation
Enric Rodríguez-Carbonell and Deepak Kapur. 2007a · 2007
Cited alongside, same era.
Generating all polynomial invariants in simple loops
Enric Rodríguez-Carbonell and Deepak Kapur. 2007b · 2007
Cited alongside, same era.
On early stopping in gradient descent learning
Yuan Yao, Lorenzo Rosasco, and Andrea Caponnetto. 2007 · 2007
Cited alongside, same era.
Rectifier nonlinearities improve neural network acoustic models. In Proc. icml
Andrew L Maas, Awni Y Hannun, and Andrew Y Ng. 2013 · 2013
Later among the works it cites.
Semfix: Program repair via semantic analysis. In Proceedings of the 2013 International Conference on Software Engineering
Hoang Duong Thien Nguyen, Dawei Qi, Abhik Roychoudhury, and Satish Chandra. 2013 · 2013
Later among the works it cites.
Path Exploration using Symbolic Output
D. Qi, H.D.T Nguyen, and A. Roychoudhury. 2013 · 2013
Later among the works it cites.
Z3-str: A z3-based string solver for web application analysis. In Proceedings of the 2013 9th Joint Meeting on Foundations of Software Engineering
Yunhui Zheng, Xiangyu Zhang, and Vijay Ganesh. 2013 · 2013
Later among the works it cites.
ICE: A robust framework for learning invariants. In International Conference on Computer Aided Verification
Pranav Garg, Christof Löding, P Madhusudan, and Daniel Neider. 2014 · 2014
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
S. Anand, P. Godefroid, and N. Tillman. 2008 · 2008
Cited alongside, same era.
RWset: Attacking path explosion in constraint-based test generation. In International Conference on Tools and Algortihms for Construction and Analysis of Systems (TACAS)
P. Boonstoppel, C. Cadar, and D. Engler. 2008 · 2008
Cited alongside, same era.
KLEE: Unassisted and Automatic Generation of High-Coverage Tests for Complex Systems Programs
Cristian Cadar, Daniel Dunbar, Dawson R Engler, et al · 2008
Cited alongside, same era.
Z3: An Efficient SMT Solver. In Tools and Algorithms for the Construction and Analysis of Systems
Leonardo de Moura and Nikolaj Bjørner. 2008 · 2008
Cited alongside, same era.
Automated whitebox fuzz testing.. In NDSS
Patrice Godefroid, Michael Y Levin, David A Molnar, et al · 2008
Cited alongside, same era.
Dynamic inference of likely data preconditions over predicates by tree learning. In Proceedings of the 2008 international symposium on Software testing and analysis
Sriram Sankaranarayanan, Swarat Chaudhuri, Franjo Ivančić, and Aarti Gupta. 2008 · 2008
Cited alongside, same era.
Invgen: An efficient invariant generator. In International Conference on Computer Aided Verification
Ashutosh Gupta and Andrey Rybalchenko. 2009 · 2009
Cited alongside, same era.
SymJS: automatic symbolic testing of JavaScript web applications. In Proceedings of the 22nd ACM SIGSOFT International Symposium on Foundations of Software Engineering
Guodong Li, Esben Andreasen, and Indradeep Ghosh. 2014 · 2014
Later among the works it cites.
DIG: a dynamic invariant generator for polynomial and array invariants
Thanhvu Nguyen, Deepak Kapur, Westley Weimer, and Stephanie Forrest. 2014 · 2014
Later among the works it cites.
Building bridges between symbolic computation and satisfiability checking. In Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation
Erika Ábrahám. 2015 · 2015
Later among the works it cites.
Counterexample-guided polynomial loop invariant generation by lagrange interpolation. In International Conference on Computer Aided Verification
Yu-Fang Chen, Chih-Duo Hong, Bow-Yaw Wang, and Lijun Zhang. 2015 · 2015
Later among the works it cites.
A continuum among logarithmic, linear, and exponential functions, and its potential to improve generalization in neural networks. In Knowledge Discovery, Knowledge Engineering and Knowledge Management (IC3K), 2015 7th International Joint Conference on
Luke B Godfrey and Michael S Gashler. 2015 · 2015
Later among the works it cites.
Explaining and harnessing adversarial examples. In International Conference on Learning Representations
Ian J Goodfellow, Jonathon Shlens, and Christian Szegedy. 2015 · 2015
Later among the works it cites.
Adam: A method for stochastic optimization. In International Conference on Learning Representations
Diederik P Kingma and Jimmy Ba. 2015 · 2015
Later among the works it cites.
Learning invariants using decision trees
Siddharth Krishna, Christian Puhrsch, and Thomas Wies. 2015 · 2015
Later among the works it cites.
multiSE: Multi-path Symbolic Execution. In International Symposium on Foundations of Software Engineering
K. Sen, G. Necula, L. Gong, and W. Choi. 2015 · 2015
Later among the works it cites.
CIVL: the concurrency intermediate verification language. In Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis
Stephen F Siegel, Manchun Zheng, Ziqing Luo, Timothy K Zirkel, Andre V Marianiello, John G Edenhofner, Matthew B Dwyer, and Michael S Rogers. 2015 · 2015
Later among the works it cites.
TensorFlow: A System for Large-Scale Machine Learning.. In OSDI
Martín Abadi, Paul Barham, Jianmin Chen, Zhifeng Chen, Andy Davis, Jeffrey Dean, Matthieu Devin, Sanjay Ghemawat, Geoffrey Irving, Michael Isard, et al · 2016
Later among the works it cites.
End to end learning for self-driving cars
Mariusz Bojarski, Davide Del Testa, Daniel Dworakowski, Bernhard Firner, Beat Flepp, Prasoon Goyal, Lawrence D Jackel, Mathew Monfort, Urs Muller, Jiakai Zhang, et al · 2016
Later among the works it cites.
Symbolic execution of complex program driven by machine learning based constraint solving. In Proceedings of the 31st IEEE/ACM International Conference on Automated Software Engineering
Xin Li, Yongjuan Liang, Hong Qian, Yi-Qi Hu, Lei Bu, Yang Yu, Xin Chen, and Xuandong Li. 2016 · 2016
Later among the works it cites.
Exponential Recency Weighted Average Branching Heuristic for SAT Solvers.. In AAAI
Jia Hui Liang, Vijay Ganesh, Pascal Poupart, and Krzysztof Czarnecki. 2016 · 2016
Later among the works it cites.
The limitations of deep learning in adversarial settings. In Security and Privacy (EuroS&P), 2016 IEEE European Symposium on
Nicolas Papernot, Patrick McDaniel, Somesh Jha, Matt Fredrikson, Z Berkay Celik, and Ananthram Swami. 2016 · 2016
Later among the works it cites.
An overview of gradient descent optimization algorithms
Sebastian Ruder. 2016 · 2016
Later among the works it cites.
Proteus: computing disjunctive loop summary via path dependency analysis. In Proceedings of the 2016 24th ACM SIGSOFT International Symposium on Foundations of Software Engineering
Xiaofei Xie, Bihuan Chen, Yang Liu, Wei Le, and Xiaohong Li. 2016 · 2016
Later among the works it cites.
Derivative-Free Optimization via Classification.. In AAAI
Yang Yu, Hong Qian, and Yi-Qi Hu. 2016 · 2016
Later among the works it cites.
Verifying properties of binarized deep neural networks
Nina Narodytska, Shiva Prasad Kasiviswanathan, Leonid Ryzhyk, Mooly Sagiv, and Toby Walsh. 2017 · 2017
Later among the works it cites.
Counterexample-guided approach to finding numerical invariants. In Proceedings of the 2017 11th Joint Meeting on Foundations of Software Engineering
ThanhVu Nguyen, Timos Antonopoulos, Andrew Ruef, and Michael Hicks. 2017 · 2017
Later among the works it cites.
Data-Driven Loop Invariant Inference with Automatic Feature Synthesis
Saswat Padhi and Todd Millstein. 2017 · 2017
Later among the works it cites.
Jalangi2: Dynamic analysis framework for JavaScript
2018 · 2018
Closest in time.
PyExZ3: Python Exploration with Z3
2018 · 2018
Closest in time.
A Survey of Symbolic Execution Techniques
Roberto Baldoni, Emilio Coppa, Daniele Cono D’Elia, Camil Demetrescu, and Irene Finocchi. 2018 · 2018
Closest in time.
Neuro-Symbolic Program Corrector for Introductory Programming Assignments. In International Conference on Software Engineering (ICSE)
S. Bhatia, P. Kohli, and R. Singh. 2018 · 2018
Closest in time.
Angora: Efficient Fuzzing by Principled Search
Peng Chen and Hao Chen. 2018 · 2018
Closest in time.