Regression-free synthesis for concurrency Conference Paper

Author(s): Cerný, Pavol; Henzinger, Thomas A; Radhakrishna, Arjun; Ryzhyk, Leonid; Tarrach, Thorsten
Title: Regression-free synthesis for concurrency
Title Series: LNCS
Affiliation IST Austria
Abstract: While fixing concurrency bugs, program repair algorithms may introduce new concurrency bugs. We present an algorithm that avoids such regressions. The solution space is given by a set of program transformations we consider in the repair process. These include reordering of instructions within a thread and inserting atomic sections. The new algorithm learns a constraint on the space of candidate solutions, from both positive examples (error-free traces) and counterexamples (error traces). From each counterexample, the algorithm learns a constraint necessary to remove the errors. From each positive examples, it learns a constraint that is necessary in order to prevent the repair from turning the trace into an error trace. We implemented the algorithm and evaluated it on simplified Linux device drivers with known bugs.
Conference Title: CAV: Computer Aided Verification
Volume: 8559
Conference Dates: July 18-22, 2014
Conference Location: Vienna, Austria
Publisher: Springer  
Date Published: 2014-07-22
Start Page: 568
End Page: 584
DOI: 10.1007/978-3-319-08867-9_38
Open access: yes (repository)
IST Austria Authors
  1. Thomas A. Henzinger
    415 Henzinger
  2. Pavol Černý
    25 Cerný
Related IST Austria Work