Symbolic execution is a systematic technique for checking programs, which forms a basis for
various software testing and verification techniques. It provides a powerful analysis in …

Symbolic execution is a systematic program analysis technique which executes programs
on symbolic inputs, representing multiple concrete inputs, and represents the program …

Verification problems of programs in various paradigms can be reduced to problems of
solving Horn clause constraints on predicate variables that represent unknown inductive …

The symbolic-heap fragment of separation logic has been actively developed and
advocated for verifying the memory-safety property of computer programs. At present, one of …

We present a decision procedure for checking entailment between separation logic formulas
with inductive predicates specifying complex data structures corresponding to finite nesting …

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 …

An efficient entailment proof system is essential to compositional verification using
separation logic. Unfortunately, existing decision procedures are either inexpressive or …

We investigate array separation logic (ASL), a variant of symbolic-heap separation logic in
which the data structures are either pointers or arrays, ie, contiguous blocks of memory. This …

In this work, we consider the satisfiability problem in a logic that combines word equations
over string variables denoting words of unbounded lengths, regular languages to which …

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 …