Selected publications at LSV

Abstract:: We investigate decidability, complexity and expressive power issues for (first-order) separation logic with one record field (herein called SL) and its fragments. SL can specify properties about the memory heap of programs with singly-linked lists. Separation logic with two record fields is known to be undecidable by reduction of finite satisfiability for classical predicate logic with one binary relation. Surprisingly, we show that second-order logic is as expressive as SL and as a by-product we get undecidability of SL. This is refined by showing that SL without the separating conjunction is as expressive as SL, whence undecidable too. As a consequence, in SL the separating implication (also known as the magic wand) can simulate the separating conjunction. By contrast, we establish that SL without the magic wand is decidable, and we prove a non-elementary complexity by reduction from satisfiability for the first-order theory over finite words. This result is extended with a bounded use of the magic wand that appears in Hoare-style rules. As a generalisation, it is shown that kSL, the separation logic over heaps with k≥ 1 record fields, is equivalent to kSO, the second-order logic over heaps with k record fields.

`@article{BDL-icomp12,`
	`author =`	`{Brochenin, R{\'e}mi and Demri, St{\'e}phane and Lozes, {\'E}tienne},`
	`DOI =`	`{10.1016/j.ic.2011.12.003},`
	`journal =`	`{Information and Computation},`
	`month =`	`feb,`
	`pages =`	`{106-137},`
	`publisher =`	`{Elsevier Science Publishers},`
	`title =`	`{On the Almighty Wand},`
	`url =`	`{http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BDL-icomp12.pdf},`
	`volume =`	`{211},`
	`year =`	`{2012},`
`}`

About LSV