Citation Context

...by applying code transformations. Other tools apply code transformations, but the user must specify target locations [18]. The closest work locates and applies very simple or limited stylized changes =-=[9]-=-, [23], [25], [28]. We refer to limited changes such as API, concurrency, or security policy corrections [2], [9], [25], and identical, lexical edits to similar text [13] as stylized. Andersen and Law...

Citation Context

...at is witnessing a significant upsurge in interest. Program improvement seeks to automate improving an existing code base with relatively small modifications. Examples include repairing the code base =-=[17, 24, 39, 41]-=-, enhancing its properties [22,23,30,34,42,43], or even migrating it to other systems [21, 33]. All these program improvement approaches share the foundational assumption that many software systems co...

Citation Context

...ng for memory errors. Aviso [30] proposed a collaborative approach for fixing concurrency bugs. Although RaceMob focuses on collaborative detection instead of fixing, it could be integrated with CFix =-=[22]-=-, an automated concurrency bug fixing tool, to avoid racing thread interleavings. 8 Conclusion In this paper, we described RaceMob, a crowdsourcingbased approach for better data race detection: it emp...

Citation Context

...s the set of inputs that the application decides to process. This narrowing is conceptually similar to transformations that eliminate concurrency errors by narrowing the set of possible interleavings =-=[27, 43]-=-. 1.2 Usage Scenarios Proprietary Donors: The CP donor analysis operates directly on stripped binaries with no need for source code or symbolic information of any kind. CP can therefore use arbitrary ...

Citation Context

...roaches perform program repair in specific domains, such as repairs for data structures [11], web application repairs [35], and repairs targeted at security vulnerabilities [33] or concurrency faults =-=[23]-=-. 6 Conclusions and Future Work We presented MintHint, a novel technique for semi-automated program repair. The key novelty of our approach is that it combines symbolic, statistical, and syntactic rea...

Citation Context

...erring locks and atomicity constructs [20, 30, 8]. Comparatively, there has been little focus on static techniques for enforcing “ordering” relationships or determinism, exceptions being the works of =-=[23, 6, 14]-=-. Relationship to existing work is discussed in detail in Section 8. We present a synthesis framework for statically enforcing determinism. The framework consists of a novel thread-modular synthesis a...

Citation Context

...nd crossover operators. Kim et al. [12] manually inspected thousands of bug fixes and summarized ten templates as new mutation operators. Wei et al. [32] used mined invariants to fix bugs. Jin et al. =-=[11]-=- proposed new mutation operators and selectors that are designed to fix concurrent bugs. All the preceding approaches define a limited number of simple repair shapes, and rely on genetic algorithm to ...

Citation Context

...ficult to specify the correctness condition of fixing memory leaks as test cases or assertions. Dedicated approaches for specific types of bugs also exist. For example, Jin et al. proposed approaches =-=[26, 27]-=- to automate the whole process of fixing a wide variety of concurrency bugs. However, none of the dedicated approaches within our knowledge target memory leaks in C. Fixing faults can be bad, and may ...