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.
Type de document :
Article dans une revue
Annals of Pure and Applied Logic, Elsevier Masson, 2009
Liste complète des métadonnées
Contributeur : Etienne Lozes <>
Soumis le : jeudi 25 octobre 2018 - 15:55:58
Dernière modification le : mardi 13 novembre 2018 - 11:50:03


Fichiers produits par l'(les) auteur(s)


  • HAL Id : hal-01905172, version 1



Rémi Brochenin, Stephane Demri, Etienne Lozes. Reasoning about sequences of memory states. Annals of Pure and Applied Logic, Elsevier Masson, 2009. 〈hal-01905172〉



Consultations de la notice