Reasoning about block-based cloud storage systems via separation logic

A separation logic for sequences in pointer programs and its decidability

“…We also notice that the model of sequence-heap separation logic is similar to that of block-based separation logic proposed in [9]. However, the sequence singleton heap and quantifiers over sequences in sequence-heap separation logic provide more abstraction, and can be used for wider application scenarios, not just for block-based cloud storage systems.…”

“…In terms of definition for sequence-heap separation logic, we define the heap model as a finite partial mapping from locations to sequences, which is similar to the block model Heap B defined in [9]. The model can be written as h : Loc term can be used to denote stack, queue, variadic arguments, trees with variable-length branches, graphs with unbounded out-degree, etc.…”

“…Besides, properly defining the form of α can help the logic to describe multilevel data structures. For example, if α is of the form α#β (where α denotes the sequence of locations, β denotes the sequence of contents, and # separates these two sequences), one can describe two-tier data structures [9] in block-based cloud storage systems in the following way.…”

“…There are some works which combine separation logic and sequences. When formalizing cloud storage systems, one can construct a modeling language IMDSS [23], and a proof system based on separation logic [9]. These papers define values of heaps as finite sequences, and describe properties on blocks without using sequence singleton heap.…”

“…These papers define values of heaps as finite sequences, and describe properties on blocks without using sequence singleton heap. Coq-based proof assistant [24] is implemented based on the logic defined in [9].…”