Fetching the paper…
Reading the bibliography…
The automatic generation of computer programs is one of the main applications with practical relevance in the field of evolutionary computation.
T. Brown, B. Mann, N. Ryder, M. Subbiah, J. D. Kaplan, P. Dhariwal, A. Neelakantan, P. Shyam, G. Sastry, A. Askell, S. Agarwal, A. Herbert-Voss, G. Krueger, T. Henighan, R. Child, A. Ramesh, D. Ziegler, J. Wu, C. Winter, C. Hesse, M. Chen, E. Sigler, M. Litwin, S. Gray, B. Chess, J. Clark, C. Berner, S. McCandlish, A. Radford, I. Sutskever, and D. Amodei, “Language models are few-shot learners,” in Advances in Neural Information Processing Systems , vol. 33. Curran Associates, Inc., 2020, pp. 1877–1901
1901
Earlier work this paper cites.
N. L. Cramer, “A representation for the adaptive generation of simple sequential programs,” in proceedings of an International Conference on Genetic Algorithms and the Applications , 1985, pp. 183–187
1985
Earlier work this paper cites.
J. R. Koza and J. R. Koza, Genetic programming: on the programming of computers by means of natural selection . MIT press, 1992, vol. 1
1992
Earlier work this paper cites.
D. Kurlander, A. Cypher, and D. C. Halbert, Watch what I do: programming by demonstration . MIT press, 1993
1993
Earlier work this paper cites.
J. R. Koza, “Automated discovery of detectors and iteration-performing calculations to recognize patterns in protein sequences using genetic programming,” in IEEE Computer Society Conference on Computer Vision and Pattern Recognition . Institute of Electrical Engineers Inc (IEEE), 1994, pp. 684–684
1994
Earlier work this paper cites.
T. Perkis, “Stack-based genetic programming,” in Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence . IEEE, 1994, pp. 148–153
1994
Earlier work this paper cites.
P. A. Whigham, “Grammatically-based genetic programming,” in Proceedings of the workshop on genetic programming: from theory to real-world applications , vol. 16, no. 3, 1995, pp. 33–41
1995
Earlier work this paper cites.
J. R. Koza and D. Andre, “Evolution of iteration in genetic programming.” in Evolutionary Programming . Citeseer, 1996, pp. 469–478
1996
Earlier work this paper cites.
K. Stoffel and L. Spector, “High-performance, parallel, stack-based genetic programming,” Genetic Programming , pp. 224–229, 1996
1996
Earlier work this paper cites.
C. Ryan, J. J. Collins, and M. O. Neill, “Grammatical evolution: Evolving programs for an arbitrary language,” in European Conference on Genetic Programming . Springer, 1998, pp. 83–96
1998
Earlier work this paper cites.
T. Yu, “Hierarchical processing for evolving recursive and modular programs using higher-order functions and lambda abstraction,” Genetic Programming and Evolvable Machines , vol. 2, no. 4, pp. 345–380, 2001
2001
Earlier work this paper cites.
M. O’Neill and C. Ryan, “Grammatical evolution,” IEEE Transactions on Evolutionary Computation , vol. 5, no. 4, pp. 349–358, 2001
2001
Earlier work this paper cites.
L. Spector and A. Robinson, “Genetic programming and autoconstructive evolution with the Push programming language,” Genetic Programming and Evolvable Machines , vol. 3, no. 1, pp. 7–40, 2002
2002
Earlier work this paper cites.
K. Beck, Test-driven development: by example . Addison-Wesley Professional, 2003
2003
Earlier work this paper cites.
L. Spector, Automatic Quantum Computer Programming: a genetic programming approach . Springer Science & Business Media, 2004
2004
Earlier work this paper cites.
L. Spector, J. Klein, and M. Keijzer, “The Push3 execution stack and the evolution of control,” in Proceedings of the 7th annual conference on Genetic and evolutionary computation , 2005, pp. 1689–1696
2005
Earlier work this paper cites.
N. Pillay, “A genetic programming system for the induction of iterative solution algorithms to novice procedural programming problems,” in ACM International Conference Proceeding Series , vol. 150, 2005, pp. 66–77
2005
Earlier work this paper cites.
A. Arcuri and X. Yao, “Coevolving programs and unit tests from their specification,” in Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering , 2007, pp. 397–400
2007
Earlier work this paper cites.
S. Shirakawa, S. Ogino, and T. Nagao, “Graph structured program evolution,” in Proceedings of the 9th annual conference on Genetic and evolutionary computation , 2007, pp. 1686–1693
2007
Earlier work this paper cites.
A. Solar-Lezama, “The sketching approach to program synthesis,” in Asian Symposium on Programming Languages and Systems . Springer, 2009, pp. 4–13
2009
Earlier work this paper cites.
T. Yeh, T.-H. Chang, and R. C. Miller, “Sikuli: using GUI screenshots for search and automation,” in Proceedings of the 22nd annual ACM symposium on User interface software and technology , 2009, pp. 183–192
2009
Earlier work this paper cites.
S. Gulwani, “Dimensions in program synthesis,” in Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming , 2010, pp. 13–24
2010
Earlier work this paper cites.
L. Spector, “Assessment of problem modality by differential performance of lexicase selection in genetic programming: a preliminary report,” in Proceedings of the 14th annual conference companion on Genetic and evolutionary computation , 2012, pp. 401–408
2012
Earlier work this paper cites.
A. Albarghouthi, S. Gulwani, and Z. Kincaid, “Recursive program synthesis,” in International conference on computer aided verification . Springer, 2013, pp. 934–950
2013
Earlier work this paper cites.
A. Solar-Lezama, “Program sketching,” International Journal on Software Tools for Technology Transfer , vol. 15, no. 5, pp. 475–495, 2013
2013
Earlier work this paper cites.
2013
Earlier work this paper cites.
K. Krawiec and J. Swan, “Pattern-guided genetic programming,” in Proceedings of the 15th annual conference on Genetic and evolutionary computation , 2013, pp. 949–956
2013
Earlier work this paper cites.
T. Helmuth and L. Spector, “Word count as a traditional programming benchmark problem for genetic programming,” in Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation , 2014, pp. 919–926
2014
Earlier work this paper cites.
G. Chennupati, R. M. A. Azad, and C. Ryan, “Synthesis of parallel iterative sorts with multi-core grammatical evolution,” in Proceedings of the Companion Publication of the 2015 Annual Conference on Genetic and Evolutionary Computation , 2015, pp. 1059–1066
2015
Earlier work this paper cites.
T. Helmuth and L. Spector, “General program synthesis benchmark suite,” in Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation , 2015, pp. 1039–1046
2015
Earlier work this paper cites.
P.-M. Osera and S. Zdancewic, “Type-and-example-directed program synthesis,” in Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation , ser. PLDI ’15. New York, NY, USA: Association for Computing Machinery, 2015, p. 619–630
2015
Earlier work this paper cites.
S. Gulwani, J. Hernández-Orallo, E. Kitzelmann, S. H. Muggleton, U. Schmid, and B. Zorn, “Inductive programming meets the real world,” Communications of the ACM , vol. 58, no. 11, pp. 90–99, 2015
2015
Cited alongside, same era.
T. Helmuth and L. Spector, “Detailed problem descriptions for general program synthesis benchmark suite,” School of Computer Science, University of Massachusetts Amherst, Tech. Rep. , 2015
2015
Cited alongside, same era.
T. Helmuth, “General program synthesis from examples using genetic programming with parent selection based on random lexicographic orderings of test cases,” 2015
2015
Cited alongside, same era.
W. La Cava, T. Helmuth, L. Spector, and K. Danai, “Genetic programming with epigenetic local search,” in Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation , 2015, pp. 1055–1062
2015
Cited alongside, same era.
T. Helmuth, E. Pantridge, and L. Spector, “Lexicase selection of specialists,” in Proceedings of the Genetic and Evolutionary Computation Conference , 2019, pp. 1030–1038
2019
Later among the works it cites.
L. Jundt and T. Helmuth, “Comparing and combining lexicase selection and novelty search,” in Proceedings of the Genetic and Evolutionary Computation Conference , 2019, pp. 1047–1055
2019
Later among the works it cites.
S. Forstenlechner, “Program synthesis with grammars and semantics in genetic programming,” Ph. D. dissertation , 2019
2019
Later among the works it cites.
D. Sobania and F. Rothlauf, “Teaching GP to program like a human software developer: using perplexity pressure to guide program synthesis approaches,” in Proceedings of the Genetic and Evolutionary Computation Conference , 2019, pp. 1065–1074
2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A. Desai, S. Gulwani, V. Hingorani, N. Jain, A. Karkare, M. Marron, and S. Roy, “Program synthesis using natural language,” in Proceedings of the 38th International Conference on Software Engineering , 2016, pp. 345–356
2016
Cited alongside, same era.
K. Krawiec, Behavioral program synthesis with genetic programming . Springer, 2016, vol. 618
2016
Cited alongside, same era.
T. Helmuth, N. F. McPhee, and L. Spector, “Lexicase selection for program synthesis: a diversity analysis,” in Genetic Programming Theory and Practice XIII . Springer, 2016, pp. 151–167
2016
Cited alongside, same era.
T. Helmuth, N. F. McPhee, and L. Spector, “The impact of hyperselection on lexicase selection,” in Proceedings of the Genetic and Evolutionary Computation Conference 2016 , 2016, pp. 717–724
2016
Cited alongside, same era.
N. F. McPhee, D. Donatucci, and T. Helmuth, “Using graph databases to explore the dynamics of genetic programming runs,” in Genetic programming theory and practice XIII . Springer, 2016, pp. 185–201
2016
Cited alongside, same era.
S. Forstenlechner, M. Nicolau, D. Fagan, and M. O’Neill, “Grammar design for derivation tree based genetic programming systems,” in European Conference on Genetic Programming . Springer, 2016, pp. 199–214
2016
Cited alongside, same era.
S. Forstenlechner, D. Fagan, M. Nicolau, and M. O’Neill, “A grammar design pattern for arbitrary program synthesis problems in genetic programming,” in European Conference on Genetic Programming . Springer, 2017, pp. 262–277
2017
Cited alongside, same era.
T. Helmuth, N. F. McPhee, E. Pantridge, and L. Spector, “Improving generalization of evolved programs through automatic simplification,” in Proceedings of the Genetic and Evolutionary Computation Conference , 2017, pp. 937–944
2017
Cited alongside, same era.
E. Dolson, A. Lalejini, and C. Ofria, “Exploring genetic programming systems with MAP-Elites,” in Genetic Programming Theory and Practice XVI . Springer, 2019, pp. 1–16
2019
Later among the works it cites.
A. Lalejini and C. Ofria, “Tag-accessed memory for genetic programming,” in Proceedings of the Genetic and Evolutionary Computation Conference Companion , 2019, pp. 346–347
2019
Later among the works it cites.
E. L. Dolson, On the Constructive Power of Ecology in Open-Ended Evolving Systems . Michigan State University, 2019
2019
Later among the works it cites.
J. Kelly, E. Hemberg, and U.-M. O’Reilly, “Improving genetic programming with novel exploration-exploitation control,” in European Conference on Genetic Programming . Springer, 2019, pp. 64–80
2019
Later among the works it cites.
A. Correia, J. Iyoda, and A. Mota, “Combining model finder and genetic programming into a general purpose automatic program synthesizer,” Information Processing Letters , vol. 154, p. 105866, 2020
2020
Later among the works it cites.
K. Chen, Q. Huang, H. Palangi, P. Smolensky, K. Forbus, and J. Gao, “Mapping natural-language problems to formal-language solutions using structured neural representations,” in International Conference on Machine Learning . PMLR, 2020, pp. 1566–1575
2020
Later among the works it cites.
E. Pantridge, T. Helmuth, and L. Spector, “Comparison of linear genome representations for software synthesis,” in Genetic Programming Theory and Practice XVII . Springer, 2020, pp. 255–274
2020
Later among the works it cites.
T. Helmuth and L. Spector, “Explaining and exploiting the advantages of down-sampled lexicase selection,” in Artificial Life Conference Proceedings . MIT Press, 2020, pp. 341–349
2020
Later among the works it cites.
A. K. Saini and L. Spector, “Why and when are loops useful in genetic programming?” in Proceedings of the 2020 Genetic and Evolutionary Computation Conference Companion , 2020, pp. 247–248
2020
Later among the works it cites.
T. Helmuth, E. Pantridge, G. Woolson, and L. Spector, “Genetic source sensitivity and transfer learning in genetic programming,” in Artificial Life Conference Proceedings . MIT Press, 2020, pp. 303–311
2020
Later among the works it cites.
T. Helmuth, E. Pantridge, and L. Spector, “On the importance of specialists for lexicase selection,” Genetic Programming and Evolvable Machines , vol. 21, no. 3, pp. 349–373, 2020
2020
Later among the works it cites.
T. Helmuth and A. Abdelhady, “Benchmarking parent selection for program synthesis by genetic programming,” in Proceedings of the 2020 Genetic and Evolutionary Computation Conference Companion , 2020, pp. 237–238
2020
Later among the works it cites.
A. K. Saini and L. Spector, “Effect of parent selection methods on modularity,” in European Conference on Genetic Programming (Part of EvoStar) . Springer, 2020, pp. 184–194
2020
Later among the works it cites.
E. Pantridge and L. Spector, “Code building genetic programming,” in Proceedings of the 2020 Genetic and Evolutionary Computation Conference , 2020, pp. 994–1002
2020
Later among the works it cites.
D. Sobania and F. Rothlauf, “Challenges of program synthesis with grammatical evolution,” in European Conference on Genetic Programming (Part of EvoStar) . Springer, 2020, pp. 211–227
2020
Later among the works it cites.
A. J. Ferguson, J. G. Hernandez, D. Junghans, A. Lalejini, E. Dolson, and C. Ofria, “Characterizing the effects of random subsampling on lexicase selection,” in Genetic Programming Theory and Practice XVII . Springer, 2020, pp. 1–23
2020
Later among the works it cites.
D. Lynch, J. McDermott, and M. O’Neill, “Program synthesis in a continuous space using grammars and variational autoencoders,” in International Conference on Parallel Problem Solving from Nature . Springer, 2020, pp. 33–47
2020
Later among the works it cites.
T. Helmuth, E. Pantridge, G. Woolson, and L. Spector, “Transfer learning of genetic programming instruction sets,” in Proceedings of the 2020 Genetic and Evolutionary Computation Conference Companion , 2020, pp. 241–242
2020
Later among the works it cites.
T. Helmuth, L. Spector, and E. Pantridge, “Counterexample-driven genetic programming without formal specifications,” in Proceedings of the 2020 Genetic and Evolutionary Computation Conference Companion , 2020, pp. 239–240
2020
Later among the works it cites.
J. Deglman, “Summed batch lexicase selection on software synthesis problems,” Scholarly Horizons: University of Minnesota, Morris Undergraduate Journal , vol. 7, no. 1, p. 3, 2020
2020
Later among the works it cites.
A. Solar-Lezama, “Introduction to program synthesis,” Lecture , 2018, https://people.csail.mit.edu/asolar/SynthesisCourse/index.htm
2021
Closest in time.
L. Spector, C. Perry, J. Klein, and M. Keijzer, “Push 3.0 programming language description,” Technical Report , 2004, http://faculty.hampshire.edu/lspector/push3-description.html
2021
Closest in time.
D. Sobania, “On the generalizability of programs synthesized by grammar-guided genetic programming.” in EuroGP , 2021, pp. 130–145
2021
Closest in time.
D. Sobania and F. Rothlauf, “A generalizability measure for program synthesis with genetic programming,” in Proceedings of the Genetic and Evolutionary Computation Conference , 2021, pp. 822–829
2021
Closest in time.
D. Schweim, E. Hemberg, D. Sobania, U.-M. O’Reilly, and F. Rothlauf, “Using knowledge of human-generated code to bias the search in program synthesis with grammatical evolution,” in Proceedings of the Genetic and Evolutionary Computation Conference Companion , 2021, pp. 331–332
2021
Closest in time.
T. Helmuth and P. Kelly, “PSB2: the second program synthesis benchmark suite,” in Proceedings of the Genetic and Evolutionary Computation Conference , 2021, pp. 785–794
2021
Closest in time.
J. G. Hernandez, A. Lalejini, E. Dolson, and C. Ofria, “Random subsampling improves performance in lexicase selection,” in Proceedings of the Genetic and Evolutionary Computation Conference Companion , 2019, pp. 2028–2031
2031
Closest in time.