Angelix: Scalable Multiline Program Patch Synthesis via Symbolic Analysis
- Submitting institution
-
University College London
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 14503
- Type
- E - Conference contribution
- DOI
-
10.1145/2884781.2884807
- Title of conference / published proceedings
- 2016 IEEE/ACM 38TH INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING (ICSE)
- First page
- 691
- Volume
- 14-22-May-2016
- Issue
- -
- ISSN
- 0270-5257
- Open access status
- Deposit exception
- Month of publication
- May
- Year of publication
- 2016
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
2
- Research group(s)
-
-
- Citation count
- 82
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This work addressed scalability of semantic program repair, which is a fundamental problem (“Automated Program Repair”, CACM’19). The proposed technique uses a novel specification called angelic forest that made it the first semantic technique that scaled to large realistic programs, and the first to fix the famous Heartbleed vulnerability. The implementation of this technique, Angelix, has received 71 stars on GitHub, has been used at IIT Kanpur in an intelligent tutoring system. The proposed specification was used in benchmarks of the most popular program synthesis competition SyGuS-2017 (https://sygus.org/comp/2017/). The technique was independently re-implemented for other programming languages (https://xuanbachle.github.io/semanticsrepair/).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -