The automation of verification techniques based on first-order logic specifications has
benefitted greatly from verification infrastructures such as Boogie and Why. These offer an …

We introduce Gillian, a platform for developing symbolic analysis tools for programming
languages. Here, we focus on the symbolic execution engine at the heart of Gillian, which is …

We introduce verification based on separation logic to Gillian, a multi-language platform for
the development of symbolic analysis tools which is parametric on the memory model of the …

VeriFast is a leading research prototype tool for the sound modular verification of safety and
correctness properties of single-threaded and multithreaded C and Java programs. It has …

We investigate the* model checking* problem for symbolic-heap separation logic with user-
defined inductive predicates, ie, the problem of checking that a given stack-heap memory …

The automation of verification techniques based on firstorder logic specifications has
benefited greatly from verification infrastructures such as Boogie and Why. These offer an …

We introduce heap automata, a formalism for automatic reasoning about robustness
properties of the symbolic heap fragment of separation logic with user-defined inductive …

This paper discusses static verification of programs that have been specified using
separation logic with magic wands. Magic wands are used to specify incomplete resources …

This paper presents a new synthesis-based approach for writing low-level memory-safe
code. Given a partial program with missing guards, our algorithm synthesizes concrete …

The capabilities of modern FPGAs permit the mapping of increasingly complex applications
into reconfigurable hardware. High-level synthesis (HLS) promises a significant shortening …