Toggle Main Menu Toggle Search

Open Access padlockePrints

Reasoning about Separation using Abstraction and Reification

Lookup NU author(s): Professor Cliff JonesORCiD, Dr Nisansala Yatapanage



This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0).


Showing that concurrent threads operate on separate portions of their shared state is a way of establishing non-interference. Furthermore, in many useful programs, ownership of parts of the state are exchanged dynamically. Reasoning about separation and ownership of heap-based variables is often conducted using some form of separation logic. This paper examines the issue of separation and investigates the use of abstraction to specify and to reason about separation in program design. Two case studies demonstrate that using separation as an abstraction is a potentially useful approach.

Publication metadata

Author(s): Jones CB, Yatapanage N

Editor(s): Calinescu, R; Rumpe, B

Publication type: Conference Proceedings (inc. Abstract)

Publication status: Published

Conference Name: Software Engineering and Formal Methods: 13th International Conference (SEFM 2015)

Year of Conference: 2015

Pages: 3-19

Online publication date: 21/08/2015

Date deposited: 08/12/2015

ISSN: 9783319229683

Publisher: Springer International Publishing


DOI: 10.1007/978-3-319-22969-0_1

Series Title: Lecture Notes in Computer Science