Prenex Separation Logic with One Selector Field - Archive ouverte HAL Access content directly
Conference Papers Year : 2019

Prenex Separation Logic with One Selector Field

Mnacho Echenim
Radu Iosif
  • Function : Author
  • PersonId : 840083

Abstract

We show that infinite satisfiability can be reduced to finite satisfiabil-ity for all prenex formulas of Separation Logic with k ≥ 1 selector fields (SL k). This fact entails the decidability of the finite and infinite satisfiability problems for the class of prenex formulas of SL 1 , by reduction to the first-order theory of a single unary function symbol and an arbitrary number of unary predicate symbols. We also prove that the complexity of this fragment is not elementary recursive, by reduction from the first-order theory of one unary function symbol. Finally, we prove that the Bernays-Schönfinkel-Ramsey fragment of prenex SL 1 formulas with quantifier prefix in the language ∃ * ∀ * is PSPACE-complete.
Fichier principal
Vignette du fichier
paper_15.pdf (225.47 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02323468 , version 1 (05-11-2019)

Identifiers

Cite

Mnacho Echenim, Radu Iosif, Nicolas Peltier. Prenex Separation Logic with One Selector Field. Automated Reasoning with Analytic Tableaux and Related Methods - 28th International Conference, 2019, London, United Kingdom. pp.409-427, ⟨10.1007/978-3-030-29026-9_23⟩. ⟨hal-02323468⟩
68 View
93 Download

Altmetric

Share

Gmail Facebook X LinkedIn More