Skip to Main content Skip to Navigation
Journal articles

Reasoning about sequences of memory states

Abstract : Motivated by the verification of programs with pointer variables, we introduce a temporal logic LTL mem whose underlying assertion language is the quantifier-free fragment of separation logic and the temporal logic on the top of it is the standard linear-time temporal logic LTL. We analyze the complexity of various model-checking and satisfiability problems for LTL mem , considering various fragments of separation logic (including pointer arithmetic), various classes of models (with or without constant heap), and the influence of fixing the initial memory state. We provide a complete picture based on these criteria. Our main decidability result is pspace-completeness of the satisfiability problems on the record fragment and on a classical fragment allowing pointer arithmetic. Σ 0 1-completeness or Σ 1 1-completeness results are established for various problems by reducing standard problems for Minsky machines, and underline the tightness of our decidability results.
Complete list of metadata

Cited literature [36 references]  Display  Hide  Download
Contributor : Etienne Lozes <>
Submitted on : Thursday, October 25, 2018 - 3:55:58 PM
Last modification on : Wednesday, May 5, 2021 - 11:53:10 AM
Long-term archiving on: : Saturday, January 26, 2019 - 3:29:48 PM


Files produced by the author(s)



Rémi Brochenin, Stephane Demri, Etienne Lozes. Reasoning about sequences of memory states. Annals of Pure and Applied Logic, Elsevier Masson, 2009, ⟨10.1016/j.apal.2009.07.004⟩. ⟨hal-01905172⟩



Record views


Files downloads