Model checking has been used traditionally for finding violations of temporal properties.
Recently, testing or fuzzing approaches have also been applied to software systems to find …

The Rust type system guarantees memory safety and data-race freedom. However, to satisfy
Rust's type rules, many familiar implementation patterns must be adapted substantially …

The traditional formulation of the program synthesis problem is to find a program that meets
a logical correctness specification. When synthesis is successful, there is a guarantee that …

Syntax-guided synthesis (SyGuS) aims to find a program satisfying semantic specification as
well as user-provided structural hypotheses. There are two main synthesis approaches …

Library migration is a challenging problem, where most existing approaches rely on prior
knowledge. This can be, for example, information derived from changelogs or statistical …

We describe the first approach to automatically synthesizing heap-manipulating programs
with auxiliary recursive procedures. Such procedures occur routinely in data structure …

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

We present SecCSL, a concurrent separation logic for proving expressive, data-dependent
information flow security properties of low-level programs. SecCSL is considerably more …

Superoptimization is a compilation strategy that uses search to improve code quality, rather
than relying on a canned sequence of transformations, as traditional optimizing compilers …

A frequent programming pattern for small tasks, especially expressions, is to repeatedly
evaluate the program on an input as its editing progresses. The Read-Eval-Print Loop …