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 …

Program termination is a classic non-safety property whose falsification cannot in general be
witnessed by a finite trace. This makes testing for non-termination challenging, and also a …

We present the first machine learning approach to the termination analysis of probabilistic
programs. Ranking supermartingales (RSMs) prove that probabilistic programs halt, in …

We introduce a novel approach to the automated termination analysis of computer
programs: we use neural networks to represent ranking functions. Ranking functions map …

Termination is a crucial program property. Non-termination bugs can be subtle to detect and
may remain hidden for long before they take effect. Many real-world programs still suffer …

Program equivalence checking is the task of confirming that two programs have the same
behavior on corresponding inputs. We develop a calculus based on symbolic execution and …

Context Programs with non-termination behavior induce various bugs, such as denial-of-
service vulnerability and memory exhaustion. Hence the ability to detect non-termination …

Context: Reactive programming (RP) is a declarative programming paradigm suitable for
expressing the handling of events. It enables programmers to create applications that react …

Being able to detect program runtime complexity is useful in many tasks (eg, checking
expected performance and identifying potential security vulnerabilities). In this work, we …

Uninterpreted predicate solving is a fundamental problem in formal verification, including
loop invariant and constrained horn clauses predicate solving. Existing approaches have …