Formal verification provides a rigorous and systematic approach to ensure the correctness
and reliability of software systems. Yet, constructing specifications for the full proof relies on …

Incorrectness Logic (IL) has recently been advanced as a logical theory for compositionally
proving the presence of bugs—dual to Hoare Logic, which is used to compositionally prove …

Automated program repair (APR) is a challenging process of detecting bugs, localizing
buggy code, generating fix candidates and validating the fixes. Effectiveness of program …

Techniques for proving termination and non-termination of imperative programs are usually
considered as orthogonal mechanisms. In this paper, we propose a novel mechanism that …

We propose a novel, unified approach to the development of compositional symbolic
execution tools, bridging the gap between classical symbolic execution and compositional …

The paper proposes a new static analysis designed to handle open programs, ie, fragments
of programs, with dynamic pointer-linked data structures-in particular, various kinds of lists …

We describe a formal verification framework and tool implementation, based upon cyclic
proofs, for certifying the safe termination of imperative pointer programs with recursive …

In this work, we present a semi-decision procedure for a fragment of separation logic with
user-defined predicates and Presburger arithmetic. To check the satisfiability of a formula …

We introduce a new dynamic analysis technique to discover invariants in separation logic for
heap-manipulating programs. First, we use a debugger to obtain rich program execution …

We consider the satisfiability problem for a fragment of separation logic including inductive
predicates with shape and arithmetic properties. We show that the fragment is decidable if …