On relationships between semantic diversity, complexity and modularity of programming tasks

Created by W.Langdon from gp-bibliography.bib Revision:1.8120

@InProceedings{Krawiec:2012:GECCO,

• author = "Krzysztof Krawiec",
• title = "On relationships between semantic diversity, complexity and modularity of programming tasks",
• booktitle = "GECCO '12: Proceedings of the fourteenth international conference on Genetic and evolutionary computation conference",
• year = "2012",
• editor = "Terry Soule and Anne Auger and Jason Moore and David Pelta and Christine Solnon and Mike Preuss and Alan Dorin and Yew-Soon Ong and Christian Blum and Dario Landa Silva and Frank Neumann and Tina Yu and Aniko Ekart and Will Browne and Tim Kovacs and Man-Leung Wong and Clara Pizzuti and Jon Rowe and Tobias Friedrich and Giovanni Squillero and Nicolas Bredeche and Stephen L. Smith and Alison Motsinger-Reif and Jose Lozano and Martin Pelikan and Silja Meyer-Nienberg and Christian Igel and Greg Hornby and Rene Doursat and Steve Gustafson and Gustavo Olague and Shin Yoo and John Clark and Gabriela Ochoa and Gisele Pappa and Fernando Lobo and Daniel Tauritz and Jurgen Branke and Kalyanmoy Deb",
• isbn13 = "978-1-4503-1177-9",
• pages = "783--790",
• keywords = "genetic algorithms, genetic programming",
• month = "7-11 " # jul,
• organisation = "SIGEVO",
• address = "Philadelphia, Pennsylvania, USA",
• DOI = "doi:10.1145/2330163.2330272",
• publisher = "ACM",
• publisher_address = "New York, NY, USA",
• abstract = "We investigate semantic properties of linear programs, both internally, by analyzing the memory states they produce during execution, and externally, by inspecting program outcomes. The main concept of the formalism we propose is program trace, which reflects the behavior of program in semantic space. It allows us to characterize programming tasks in terms of traces of programs that solve them, and to propose certain measures that reveal their properties. We are primarily interested in measures that quantitatively characterize functional (semantic, behavioral) modularity of programming tasks. The experiments conducted on large samples of linear programs written in Push demonstrate that semantic structure varies from task to task, and reveal patterns of different forms of modularity. In particular, we identify interesting relationships between task modularity, task complexity, and program length, and conclude that a great share of programming tasks are modular.",
• notes = "Also known as \cite{2330272} GECCO-2012 A joint meeting of the twenty first international conference on genetic algorithms (ICGA-2012) and the seventeenth annual genetic programming conference (GP-2012)",

}

Genetic Programming entries for Krzysztof Krawiec

Citations