אחיה אליסף

אקדמי בכיר

Evolving Assembly Code in an Adversarial Environment

We evolve survivors for the CodeGuru competition - - assembly programs that run the longest in shared memory, by resisting attacks from adversary survivors and finding their weaknesses. For evolving top-notch solvers, we specify a Backus Normal Form (BNF) for the assembly language and synthesize the code from scratch using Genetic Programming (GP). We evaluate the survivors by running CodeGuru games against human-written winning survivors. Our evolved programs found weaknesses in the programs they were trained against and utilized them. This work has important applications for cyber-security, as we utilize evolution to detect weaknesses in survivors. The assembly BNF is domain-independent; thus, by modifying the fitness function, it can detect code weaknesses and help fix them. Finally, the CodeGuru competition offers a novel platform for analyzing GP and code evolution in adversarial environments. To support further research in this direction, we provide a thorough qualitative analysis of the evolved survivors and the weaknesses found.

שפת פרסום אנגלית
דפים 723-726
סטטוס פרסום פורסם - 14.07.2024

Keywords

assembly
code generation
codeguru xtreme
genetic programming

ASJC Scopus subject areas

Artificial Intelligence
Software
Control and Optimization
Discrete Mathematics and Combinatorics
Logic
גישה למסמך
10.1145/3638530.3654209
קבצים וקישורים אחרים
Link to publication in Scopus