- author = "Thomas Helmuth and Peter Kelly",
- title = "{PSB2}: The Second Program Synthesis Benchmark Suite",
- booktitle = "Proceedings of the 2021 Genetic and Evolutionary Computation Conference",
- year = "2021",
- editor = "Francisco Chicano and Alberto Tonda and Krzysztof Krawiec and Marde Helbig and Christopher W. Cleghorn and Dennis G. Wilson and Georgios Yannakakis and Luis Paquete and Gabriela Ochoa and Jaume Bacardit and Christian Gagne and Sanaz Mostaghim and Laetitia Jourdan and Oliver Schuetze and Petr Posik and Carlos Segura and Renato Tinos and Carlos Cotta and Malcolm Heywood and Mengjie Zhang and Leonardo Trujillo and Risto Miikkulainen and Bing Xue and Aneta Neumann and Richard Allmendinger and Fuyuki Ishikawa and Inmaculada Medina-Bulo and Frank Neumann and Andrew M. Sutton",
- pages = "785--794",
- address = "internet",
- series = "GECCO '21",
- month = jul # " 10-14",
- organisation = "SIGEVO",
- publisher = "Association for Computing Machinery",
- publisher_address = "New York, NY, USA",
- note = "Nominated for best paper",
- keywords = "genetic algorithms, genetic programming, automatic program synthesis, benchmarking",
- isbn13 = "9781450383509",
-
URL = "
https://arxiv.org/abs/2106.06086",
-
DOI = "
doi:10.1145/3449639.3459285",
-
code_url = "https://cs.hamilton.edu/~thelmuth/PSB2/PSB2.html",
- size = "10 pages",
-
abstract = "For the past six years, researchers in genetic
programming and other program synthesis disciplines
have used the General Program Synthesis Benchmark Suite
to benchmark many aspects of automatic program
synthesis systems. These problems have been used to
make notable progress toward the goal of general
program synthesis: automatically creating the types of
software that human programmers code. Many of the
systems that have attempted the problems in the
original benchmark suite have used it to demonstrate
performance improvements granted through new
techniques. Over time, the suite has gradually become
outdated, hindering the accurate measurement of further
improvements. The field needs a new set of more
difficult benchmark problems to move beyond what was
previously possible.
We describe the 25 new general program synthesis benchmark problems that make up PSB2, a new benchmark suite. These problems are curated from a variety of sources,including programming katas and college courses. We selected these problems to be more difficult than those in the original suite, and give results using PushGP showing this increase in difficulty. These new problems give plenty of room for improvement, pointing the way for the next six or more years of general program synthesis research",
-
notes = "https://cs.hamilton.edu/~thelmuth/PSB2/PSB2.html See
also \cite{Helmuth:2022:GPEM}
p785 'PSB2 consists of 25 problems curated from programming challenges, programming katas, and college courses.' 'markedly harder to solve than problems in PSB1'
Hamilton College, USA
Also known as \cite{Helmuth:2021:GECCO:PSB2} GECCO-2021 A Recombination of the 30th International Conference on Genetic Algorithms (ICGA) and the 26th Annual Genetic Programming Conference (GP)",
