2 November 2016 - 14h00
Biabduction (and Related Problems) in Array Separation Logic
by Nikos Gorogiannis from University of Middlesex
Abstract: We investigate Array Separation Logic, a variant of symbolic-heap separation logic in which the primary data structures are not pointers or lists but arrays. This logic can be used for proving memory safety for array-manipulating imperative programs.
We focus on the biabduction problem for this logic, which has been established as the key to automatic specification inference at the industrial scale in the setting of standard separation logic. Specifically, we show that the problem of finding a solution is NP-complete, and we present a concrete NP algorithm for biabduction that produces solutions of reasonable quality.
Along the way, we show that satisfiability in our logic is NP-complete, and that entailment is decidable with high complexity. The somewhat surprising fact that biabduction is computationally simpler than entailment is explained by the fact that, as we show, the element of choice over biabduction solutions enables us to dramatically reduce the search space.
Nikos is a candidate for CNRS (CR1). He will be staying with us from 31/10 to 04/11. Please let me know if you want to meet him during this time.