Shachar Itzhaky, Anindya Banerjee, Neil Immerman, Aleksandar Nanevski, Mooly Sagiv. Effectively-Propositional Reasoning about Reachability in Linked Data Structures. In Natasha Sharygina, Helmut Veith, editors, Computer Aided Verification - 25th International Conference, CAV 2013, Saint Petersburg, Russia, July 13-19, 2013. Proceedings. Volume 8044 of Lecture Notes in Computer Science, pages 756-772, Springer, 2013. [doi]
@inproceedings{ItzhakyBINS13,
title = {Effectively-Propositional Reasoning about Reachability in Linked Data Structures},
author = {Shachar Itzhaky and Anindya Banerjee and Neil Immerman and Aleksandar Nanevski and Mooly Sagiv},
year = {2013},
doi = {10.1007/978-3-642-39799-8_53},
url = {http://dx.doi.org/10.1007/978-3-642-39799-8_53},
researchr = {https://researchr.org/publication/ItzhakyBINS13},
cites = {0},
citedby = {0},
pages = {756-772},
booktitle = {Computer Aided Verification - 25th International Conference, CAV 2013, Saint Petersburg, Russia, July 13-19, 2013. Proceedings},
editor = {Natasha Sharygina and Helmut Veith},
volume = {8044},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-39798-1},
}