Conditional Dyck-CFL Reachability Analysis for Complete and Efficient Library Summarization.
https://doi.org/10.1007/978-3-662-54434-1_33
@inproceedings{DBLP:conf/esop/TangWXZW017,
author = {Hao Tang and
Di Wang and
Yingfei Xiong and
Lingming Zhang and
Xiaoyin Wang and
Lu Zhang},
editor = {Hongseok Yang},
title = {Conditional Dyck-CFL Reachability Analysis for Complete and Efficient
Library Summarization},
booktitle = {Programming Languages and Systems - 26th European Symposium on Programming,
{ESOP} 2017, Held as Part of the European Joint Conferences on Theory
and Practice of Software, {ETAPS} 2017, Uppsala, Sweden, April 22-29,
2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10201},
pages = {880--908},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-662-54434-1\_33},
doi = {10.1007/978-3-662-54434-1\_33},
timestamp = {Tue, 14 May 2019 10:00:41 +0200},
biburl = {https://dblp.org/rec/conf/esop/TangWXZW017.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
本页面没有标签