Automated program repair (APR) faces the challenge of test overfitting, where generated
patches pass validation tests but fail to generalize. Existing methods for patch assessment …

There are two approaches to automatically deriving symbolic worst-case resource bounds
for programs: static analysis of the source code and data-driven analysis of cost …

Recurrence equations have played a central role in static cost analysis, where they can be
viewed as abstractions of programs and used to infer resource usage information without …

Automatic static cost analysis infers information about the resources used by programs
without actually running them with concrete data and presents such information as functions …

The correctness of computations remains a significant challenge in computer science, with
traditional approaches relying on automated testing or formal verification. Self …

This paper describes a formal repair framework for performance bugs in loop programs,
which are programming errors that slow down program execution. The approach is …

We consider the problem of automatically proving resource bounds. That is, we study how to
prove that an integer-valued resource variable is bounded by a given program expression …

Online judge (OJ) systems have been widely used for programming skill evaluation in
various fields, including programming education, programming competition and talent …

Automated runtime complexity analysis can help developers detect egregious performance
issues. Existing runtime complexity analysis are often done for imperative programs using …

Resource-bound analysis aims to infer symbolic bounds of worst-case resource usage (eg,
running time, memory, and energy) of programs as functions of program inputs. Resource …