On the Complexity of Pointer Arithmetic in Separation Logic

James Brotherston, Max I. Kanovich. On the Complexity of Pointer Arithmetic in Separation Logic. In Sukyoung Ryu, editor, Programming Languages and Systems - 16th Asian Symposium, APLAS 2018, Wellington, New Zealand, December 2-6, 2018, Proceedings. Volume 11275 of Lecture Notes in Computer Science, pages 329-349, Springer, 2018. [doi]

@inproceedings{BrotherstonK18,
  title = {On the Complexity of Pointer Arithmetic in Separation Logic},
  author = {James Brotherston and Max I. Kanovich},
  year = {2018},
  doi = {10.1007/978-3-030-02768-1_18},
  url = {https://doi.org/10.1007/978-3-030-02768-1_18},
  researchr = {https://researchr.org/publication/BrotherstonK18},
  cites = {0},
  citedby = {0},
  pages = {329-349},
  booktitle = {Programming Languages and Systems - 16th Asian Symposium, APLAS 2018, Wellington, New Zealand, December 2-6, 2018, Proceedings},
  editor = {Sukyoung Ryu},
  volume = {11275},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-030-02768-1},
}