Reasoning About Sequences of Memory States

Brochenin, Rémi; Demri, Stéphane; Lozes, Étienne

doi:10.1007/978-3-540-72734-7_8

Cited by 11 publications

(13 citation statements)

References 30 publications

(36 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…4.2) or the qualitative spatial reasoning of [2]. Finally, the results for the LTL extension of [3] with constraints built from the separation logic to verify memory allocation of programs also use an abstraction technique verifying this property. For all these LTL extensions, the satisfiability and model-checking problems have been shown to be pspace-complete.…”

Section: A Decidable Model-checking Problemmentioning

confidence: 99%

“…This construction can be used to refine several results about LTL extended with constraints (for instance [2,7,3]). Indeed, we can take advantage of the fact that the models of the logics concerned can be abstracted in such a way that the correspondence between concrete and symbolic models can be verified easier.…”

Section: Introductionmentioning

confidence: 94%

“…A famous one is the region abstraction of timed automata [1]. Several works about extensions of LTL over concrete domains also relies on symbolic valuation abstractions [2,7,3]. In most of them the symbolic valuations are described by sets of constraints.…”

Section: Example 31mentioning

confidence: 99%

See 2 more Smart Citations

An Automata-based Approach for CTL⋆ With Constraints

Gascon

2009

Electronic Notes in Theoretical Computer Science

View full text Add to dashboard Cite

We introduce a general definition for a family of branching-time logics that extend CTL * by allowing constraints between variables at the atomic level. These constraints allow to compare values of variables at different states of the model. We define an automata-theoretic approach to solve verification problems for such extensions. Our method is based on a finite abstraction of the infinite state space and a symbolic representation of the models that generalizes several approaches used for extensions of the linear-time logic LTL with constraints. We extend and combine several constructions involving alternating tree automata. We apply this approach to prove decidability and optimal complexity results for particular instances of CTL * extensions whenever an abstraction of the models verifying a "nice" property can be computed. These theoretical results generalize several results on LTL with constraints where such nice abstractions are used.

show abstract

Section: A Decidable Model-checking Problemmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 94%

See 1 more Smart Citation

An Automata-based Approach for CTL⋆ With Constraints

Gascon

2009

Electronic Notes in Theoretical Computer Science

View full text Add to dashboard Cite

show abstract

“…The PSpace upper bound relies on a small heap property based on the techniques of test formulae, see e.g. [5,16,25,26], and the PSpace-hardness of SL( * ) is inherited from [12]. The PSpace upper bound can be extended to the fragment of SL( * , − * , reach + ) made of Boolean combinations of formulae from SL( * , reach + ) ∪ SL( * , − * ) (see the developments in Section 4).…”

Section: Introductionmentioning

confidence: 99%

The Effects of Adding Reachability Predicates in Propositional Separation Logic

Demri

Lozes

Mansutti

2018

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. The list segment predicate ls used in separation logic for verifying programs with pointers is well-suited to express properties on singly-linked lists. We study the effects of adding ls to the full propositional separation logic with the separating conjunction and implication, which is motivated by the recent design of new fragments in which all these ingredients are used indifferently and verification tools start to handle the magic wand connective. This is a very natural extension that has not been studied so far. We show that the restriction without the separating implication can be solved in polynomial space by using an appropriate abstraction for memory states whereas the full extension is shown undecidable by reduction from first-order separation logic. Many variants of the logic and fragments are also investigated from the computational point of view when ls is added, providing numerous results about adding reachability predicates to propositional separation logic.

show abstract

“…That work has been recently extended to reason on generic nested words [1]. LT L mem [10] is also a multidimensional logic that uses LTL as the most external formalism. However, instead of using a model logic like CTL to reason about dynamic structures, it has an embedded separation logic.…”

Section: Verifying Properties Over Dynamic Structuresmentioning

confidence: 99%

Model Checking Dynamic Memory Allocation in Operating Systems

2009

View full text Add to dashboard Cite

Most system software, including operating systems, contains dynamic data structures whose shape and contents should satisfy design requirements during execution. Model checking technology, a powerful tool for automatic verification based on state exploration, should be adapted to deal with this kind of structure. This paper presents a method to specify and verify properties of C programs with dynamic memory management. The proposal contains two main contributions. First, we present a novel method to extend explicit model checking of C programs with dynamic memory management. The approach consists of defining a canonical representation of the heap, moving most of the information from the state vector to a global structure. We provide a formal semantics of the method that allows us to prove the soundness of the representation. Secondly, we combine temporal LTL and CTL logic to define a two-dimensional logic, in time and space, which is suitable to specify complex properties of programs with dynamic data structures. We also define the model checking algorithms for this logic. The whole method has been implemented in the well known model checker SPIN, and illustrated with an example where a typical memory reader/writer driver is modelled and analyzed.

show abstract

Reasoning About Sequences of Memory States

Cited by 11 publications

References 30 publications

An Automata-based Approach for CTL⋆ With Constraints

An Automata-based Approach for CTL⋆ With Constraints

The Effects of Adding Reachability Predicates in Propositional Separation Logic

Model Checking Dynamic Memory Allocation in Operating Systems

Contact Info

Product

Resources

About