Automated repair of binary and assembly programs for cooperating embedded devices

Eric Schulte, Jonathan Di Lorenzo, Westley Weimer, Stephanie Forrest

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

We present a method for automatically repairing arbitrary software defects in embedded systems, which have limited memory, disk and CPU capacities, but exist in great numbers. We extend evolutionary computation (EC) algorithms that search for valid repairs at the source code level to assembly and ELF format binaries, compensating for limited system resources with several algorithmic innovations. Our method does not require access to the source code or build toolchain of the software under repair, does not require program instrumentation, specialized execution environments, or virtual machines, or prior knowledge of the bug type. We repair defects in ARM and x86 assembly as well as ELF binaries, observing decreases of 86% in memory and 95% in disk requirements, with 62% decrease in repair time, compared to similar source-level techniques. These advances allow repairs previously possible only with C source code to be applied to any ARM or x86 assembly or ELF executable. Efficiency gains are achieved by introducing stochastic fault localization, with much lower overhead than comparable deterministic methods, and low-level program representations. When distributed over multiple devices, our algorithm finds repairs faster than predicted by naïve parallelism. Four devices using our approach are five times more efficient than a single device because of our collaboration model. The algorithm is implemented on Nokia N900 smartphones, with inter-phone communication fitting in 900 bytes sent in 7 SMS text messages per device per repair on average.

Original languageEnglish (US)
Pages (from-to)317-327
Number of pages11
JournalACM SIGPLAN Notices
Volume48
Issue number4
DOIs
StatePublished - Apr 1 2013
Externally publishedYes

Fingerprint

Program assemblers
Repair
Data storage equipment
Defects
Smartphones
Embedded systems
Evolutionary algorithms
Program processors
Innovation
Communication

Keywords

  • Assembly code
  • Automated program repair
  • Bytecode
  • Evolutionary computation
  • Fault localization
  • Legacy software

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Automated repair of binary and assembly programs for cooperating embedded devices. / Schulte, Eric; Di Lorenzo, Jonathan; Weimer, Westley; Forrest, Stephanie.

In: ACM SIGPLAN Notices, Vol. 48, No. 4, 01.04.2013, p. 317-327.

Research output: Contribution to journalArticle

Schulte, Eric ; Di Lorenzo, Jonathan ; Weimer, Westley ; Forrest, Stephanie. / Automated repair of binary and assembly programs for cooperating embedded devices. In: ACM SIGPLAN Notices. 2013 ; Vol. 48, No. 4. pp. 317-327.
@article{22ffd0de7fb84e33990f235e52144532,
title = "Automated repair of binary and assembly programs for cooperating embedded devices",
abstract = "We present a method for automatically repairing arbitrary software defects in embedded systems, which have limited memory, disk and CPU capacities, but exist in great numbers. We extend evolutionary computation (EC) algorithms that search for valid repairs at the source code level to assembly and ELF format binaries, compensating for limited system resources with several algorithmic innovations. Our method does not require access to the source code or build toolchain of the software under repair, does not require program instrumentation, specialized execution environments, or virtual machines, or prior knowledge of the bug type. We repair defects in ARM and x86 assembly as well as ELF binaries, observing decreases of 86{\%} in memory and 95{\%} in disk requirements, with 62{\%} decrease in repair time, compared to similar source-level techniques. These advances allow repairs previously possible only with C source code to be applied to any ARM or x86 assembly or ELF executable. Efficiency gains are achieved by introducing stochastic fault localization, with much lower overhead than comparable deterministic methods, and low-level program representations. When distributed over multiple devices, our algorithm finds repairs faster than predicted by na{\"i}ve parallelism. Four devices using our approach are five times more efficient than a single device because of our collaboration model. The algorithm is implemented on Nokia N900 smartphones, with inter-phone communication fitting in 900 bytes sent in 7 SMS text messages per device per repair on average.",
keywords = "Assembly code, Automated program repair, Bytecode, Evolutionary computation, Fault localization, Legacy software",
author = "Eric Schulte and {Di Lorenzo}, Jonathan and Westley Weimer and Stephanie Forrest",
year = "2013",
month = "4",
day = "1",
doi = "10.1145/2499368.2451151",
language = "English (US)",
volume = "48",
pages = "317--327",
journal = "SIGPLAN Notices (ACM Special Interest Group on Programming Languages)",
issn = "1523-2867",
publisher = "Association for Computing Machinery (ACM)",
number = "4",

}

TY - JOUR

T1 - Automated repair of binary and assembly programs for cooperating embedded devices

AU - Schulte, Eric

AU - Di Lorenzo, Jonathan

AU - Weimer, Westley

AU - Forrest, Stephanie

PY - 2013/4/1

Y1 - 2013/4/1

N2 - We present a method for automatically repairing arbitrary software defects in embedded systems, which have limited memory, disk and CPU capacities, but exist in great numbers. We extend evolutionary computation (EC) algorithms that search for valid repairs at the source code level to assembly and ELF format binaries, compensating for limited system resources with several algorithmic innovations. Our method does not require access to the source code or build toolchain of the software under repair, does not require program instrumentation, specialized execution environments, or virtual machines, or prior knowledge of the bug type. We repair defects in ARM and x86 assembly as well as ELF binaries, observing decreases of 86% in memory and 95% in disk requirements, with 62% decrease in repair time, compared to similar source-level techniques. These advances allow repairs previously possible only with C source code to be applied to any ARM or x86 assembly or ELF executable. Efficiency gains are achieved by introducing stochastic fault localization, with much lower overhead than comparable deterministic methods, and low-level program representations. When distributed over multiple devices, our algorithm finds repairs faster than predicted by naïve parallelism. Four devices using our approach are five times more efficient than a single device because of our collaboration model. The algorithm is implemented on Nokia N900 smartphones, with inter-phone communication fitting in 900 bytes sent in 7 SMS text messages per device per repair on average.

AB - We present a method for automatically repairing arbitrary software defects in embedded systems, which have limited memory, disk and CPU capacities, but exist in great numbers. We extend evolutionary computation (EC) algorithms that search for valid repairs at the source code level to assembly and ELF format binaries, compensating for limited system resources with several algorithmic innovations. Our method does not require access to the source code or build toolchain of the software under repair, does not require program instrumentation, specialized execution environments, or virtual machines, or prior knowledge of the bug type. We repair defects in ARM and x86 assembly as well as ELF binaries, observing decreases of 86% in memory and 95% in disk requirements, with 62% decrease in repair time, compared to similar source-level techniques. These advances allow repairs previously possible only with C source code to be applied to any ARM or x86 assembly or ELF executable. Efficiency gains are achieved by introducing stochastic fault localization, with much lower overhead than comparable deterministic methods, and low-level program representations. When distributed over multiple devices, our algorithm finds repairs faster than predicted by naïve parallelism. Four devices using our approach are five times more efficient than a single device because of our collaboration model. The algorithm is implemented on Nokia N900 smartphones, with inter-phone communication fitting in 900 bytes sent in 7 SMS text messages per device per repair on average.

KW - Assembly code

KW - Automated program repair

KW - Bytecode

KW - Evolutionary computation

KW - Fault localization

KW - Legacy software

UR - http://www.scopus.com/inward/record.url?scp=84880115039&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84880115039&partnerID=8YFLogxK

U2 - 10.1145/2499368.2451151

DO - 10.1145/2499368.2451151

M3 - Article

VL - 48

SP - 317

EP - 327

JO - SIGPLAN Notices (ACM Special Interest Group on Programming Languages)

JF - SIGPLAN Notices (ACM Special Interest Group on Programming Languages)

SN - 1523-2867

IS - 4

ER -