Completeness of Cyclic Proofs for Symbolic Heaps with Inductive Definitions

Makoto Tatsuta, Koji Nakazawa, Daisuke Kimura. Completeness of Cyclic Proofs for Symbolic Heaps with Inductive Definitions. In Anthony Widjaja Lin, editor, Programming Languages and Systems - 17th Asian Symposium, APLAS 2019, Nusa Dua, Bali, Indonesia, December 1-4, 2019, Proceedings. Volume 11893 of Lecture Notes in Computer Science, pages 367-387, Springer, 2019. [doi]

@inproceedings{TatsutaNK19,
  title = {Completeness of Cyclic Proofs for Symbolic Heaps with Inductive Definitions},
  author = {Makoto Tatsuta and Koji Nakazawa and Daisuke Kimura},
  year = {2019},
  doi = {10.1007/978-3-030-34175-6_19},
  url = {https://doi.org/10.1007/978-3-030-34175-6_19},
  researchr = {https://researchr.org/publication/TatsutaNK19},
  cites = {0},
  citedby = {0},
  pages = {367-387},
  booktitle = {Programming Languages and Systems - 17th Asian Symposium, APLAS 2019, Nusa Dua, Bali, Indonesia, December 1-4, 2019, Proceedings},
  editor = {Anthony Widjaja Lin},
  volume = {11893},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-030-34175-6},
}