Deductive Program Repair

Conference paper

DOI: 10.1007/978-3-319-21668-3_13

Part of the Lecture Notes in Computer Science book series (LNCS, volume 9207)
Cite this paper as:
Kneuss E., Koukoutos M., Kuncak V. (2015) Deductive Program Repair. In: Kroening D., Păsăreanu C. (eds) Computer Aided Verification. CAV 2015. Lecture Notes in Computer Science, vol 9207. Springer, Cham

Abstract

We present an approach to program repair and its application to programs with recursive functions over unbounded data types. Our approach formulates program repair in the framework of deductive synthesis that uses existing program structure as a hint to guide synthesis. We introduce a new specification construct for symbolic tests. We rely on such user-specified tests as well as automatically generated ones to localize the fault and speed up synthesis. Our implementation is able to eliminate errors within seconds from a variety of functional programs, including symbolic computation code and implementations of functional data structures. The resulting programs are formally verified by the Leon system.

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Etienne Kneuss
    • 1
  • Manos Koukoutos
    • 1
  • Viktor Kuncak
    • 1
  1. 1.École Polytechnique Fédérale de Lausanne (EPFL)LausanneSwitzerland

Personalised recommendations