Verifying a hash table and its iterators in higher-order separation logic

François Pottier. Verifying a hash table and its iterators in higher-order separation logic. In Yves Bertot, Viktor Vafeiadis, editors, Proceedings of the 6th ACM SIGPLAN Conference on Certified Programs and Proofs, CPP 2017, Paris, France, January 16-17, 2017. pages 3-16, ACM, 2017. [doi]

@inproceedings{Pottier17,
  title = {Verifying a hash table and its iterators in higher-order separation logic},
  author = {François Pottier},
  year = {2017},
  doi = {10.1145/3018610.3018624},
  url = {http://doi.acm.org/10.1145/3018610.3018624},
  researchr = {https://researchr.org/publication/Pottier17},
  cites = {0},
  citedby = {0},
  pages = {3-16},
  booktitle = {Proceedings of the 6th ACM SIGPLAN Conference on Certified Programs and Proofs, CPP 2017, Paris, France, January 16-17, 2017},
  editor = {Yves Bertot and Viktor Vafeiadis},
  publisher = {ACM},
  isbn = {978-1-4503-4705-1},
}