Counterexample-Driven Genetic Programming: Heuristic Program Synthesis from Formal Specifications | Citedby Results | Evolutionary Computation | MIT Press

Skip to Main Content

Skip Nav Destination

Counterexample-Driven Genetic Programming: Heuristic Program Synthesis from Formal Specifications

Evolutionary Computation (2018) 26 (3): 441–469.

This article has been cited by the following articles in journals that are participating in Crossref Cited-by Linking.

Counterexample-Driven Genetic Programming for Symbolic Regression With Formal Constraints

Iwo Błądek
Krzysztof Krawiec

IEEE Transactions on Evolutionary Computation (2023) 27 (5): 1327.

The use of data mining technology in agricultural e-commerce under the background of 6G Internet of things communication

Qiubo Li
Ru Xiao

International Journal of System Assurance Engineering and Management (2021) 12 (4): 813.

[Retracted] Security Control Technology and Simulation of Network News Communication under the Environment of Internet of Things

Xudong Zhou
Jing Wang
Xiao Zhou
Keping Yu

Wireless Communications and Mobile Computing (2021) 2021 (1)

Automatic programming: The open issue?

Michael O’Neill
Lee Spector

Genetic Programming and Evolvable Machines (2020) 21 (1-2): 251.