Automated program repair has the potential to reduce the developers’ effort to fix errors in their code. In particular, modernprogramming languages, such as Java, C, and C#, represent time as integer variables that suffer from integer overflow, introducingsubtle errors that are hard to discover and repair. Recent researches on automated program repair rely on test cases to discoverfailures to correct, making them suitable only for regression errors. We propose a new strategy to automatically repair programs thatsuffer from timestamp overflows that are manifested in comparison expressions. It unifies the benefits of static analysis and automaticprogram repair avoiding dependency on testing to identify and correct defected code. Our approach performs an abstract analysis overthe time domain of a program using a Time Type System to identify the problematic comparison expressions. The repairing strategyrewrites the timestamp comparisons exploiting the binary representation of machine numbers to correct the code. We have validatedthe applicability of our approach with 20 open source Java projects. The results show that it is able to correctly repair all 246 identifiederrors. To further validate the reliability of our approach, we have proved the soundness of both, type system and repairing strategy.Furthermore, several patches for three open source projects have been acknowledged and accepted by their developers.
Hier werden alle mit dieser Publikation in Zusammenhang stehenden Forschungsaktivitäten angezeigt. Mit dem untenstehenden Link können sie sich diese Forschungsaktivitäten in der Suche anzeigen lassen und gegebenenfalls exportieren.
(Achtung: Externe Aktivitäten werden im Suchergebnis nicht mitangezeigt)