Debugging is a costly process that consumes much of developer time and energy. To help
reduce debugging effort, many studies have proposed various fault localization approaches …

Deductive Synthesis of Programs with Pointers: Techniques, Challenges, Opportunities |
SpringerLink Skip to main content Advertisement SpringerLink Account Menu Find a journal …

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

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 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 …

Given separation logic formulae AA and CC, frame inference is the problem of checking
whether AA entails CC and simultaneously inferring residual heaps. Existing approaches on …

Over the past two decades, there has been a great deal of progress on verification of full
functional correctness of programs using separation logic, sometimes even producing …

Symbolic execution is a well established method for test input generation. Despite of having
achieved tremendous success over numerical domains, existing symbolic execution …

We introduce a novel decision procedure to the satisfiability problem in array separation
logic combined with general inductively defined predicates and arithmetic. Our proposal …

Heap-manipulating programs are known to be challenging to reason about. We present a
novel verifier for heap-manipulating programs called S2TD, which encodes programs …