The bibliographic entry was discovered and compiled by a machine, and let through without anybody vouching for it. The publication itself is the authors' own work — this badge says nothing about it.

A Modal Sequent Calculus for Propositional Separation Logic

The work

TitleA Modal Sequent Calculus for Propositional Separation Logic
AuthorsNeelakantan R. Krishnaswami
Typeconference paper
Year2008
Citekeykrishnaswami2008modal

Where it appeared

Published inIMLA 2008: 4th Workshop on Intuitionistic Modal Logic and Applications

Identifiers

OpenAlexW2155156044

Access

Landing pagehttp://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.150.1832

Abstract

In this paper, we give a sequent calculus for separation logic. Unlike the logic of bunched implications, this calculus does not have a tree-shaped context { instead, we use labelled deduction to control when hypotheses can and cannot be used. We prove that cut-elimination holds for this calculus, and show that it is sound with respect to the provability semantics of separation logic.

Where this came from

How it got herethe agent went looking · found via openalex
First seen2026-08-04
Standingnot denied
Approved2026-08-07

Cite it as

@inproceedings{krishnaswami2008modal,
  title = {A Modal Sequent Calculus for Propositional Separation Logic},
  author = {Neelakantan R. Krishnaswami},
  year = {2008},
  booktitle = {IMLA 2008: 4th Workshop on Intuitionistic Modal Logic and Applications},
  url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.150.1832},
}

This record lives at https://refs.drheap.org/krishnaswami2008modal/ and will keep doing so.