Skip to Main content Skip to Navigation
Conference papers

Tableaux and Model Checking for Memory Logics

Carlos Areces 1 Diego Figueira 2 Daniel Gorin Sergio Mera
1 TALARIS - Natural Language Processing: representation, inference and semantics
Inria Nancy - Grand Est, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
2 DAHU - Verification in databases
LSV - Laboratoire Spécification et Vérification [Cachan], Inria Saclay - Ile de France
Abstract : Memory logics are modal logics whose semantics is specified in terms of relational models enriched with additional data structure to represent memory. The logical language is then extended with a collection of operations to access and modify the data structure. In this paper we study their satisfiability and the model checking problems. We first give sound and complete tableaux calculi for the memory logic ML(k ; r ; e ) (the basic modal language extended with the operator r used to memorize a state, the operator e used to wipe out the memory, and the operator k used to check if the current point of evaluation is memorized) and some of its sublanguages. As the satisfiability problem of ML( k ; r ; e ) is undecidable, the tableau calculus we present is non terminating. Hence, we furthermore study a variation that ensures termination, at the expense of completeness, and we use model checking to ensure soundness. Secondly, we show that the model checking problem is PSpace-complete.
Document type :
Conference papers
Complete list of metadatas
Contributor : Areces Carlos <>
Submitted on : Friday, October 9, 2009 - 11:39:51 AM
Last modification on : Thursday, July 2, 2020 - 5:26:03 PM


  • HAL Id : inria-00423049, version 1



Carlos Areces, Diego Figueira, Daniel Gorin, Sergio Mera. Tableaux and Model Checking for Memory Logics. 18th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods - TABLEAUX 2009, Jul 2009, Oslo, Norway. pp.47--61. ⟨inria-00423049⟩



Record views