Alain Finkel, Serge Haddad, Igor Khmelnitsky. Minimal Coverability Tree Construction Made Complete and Efficient. In Jean Goubault-Larrecq, Barbara König 0001, editors, Foundations of Software Science and Computation Structures - 23rd International Conference, FOSSACS 2020, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25-30, 2020, Proceedings. Volume 12077 of Lecture Notes in Computer Science, pages 237-256, Springer, 2020. [doi]
@inproceedings{FinkelHK20,
title = {Minimal Coverability Tree Construction Made Complete and Efficient},
author = {Alain Finkel and Serge Haddad and Igor Khmelnitsky},
year = {2020},
doi = {10.1007/978-3-030-45231-5_13},
url = {https://doi.org/10.1007/978-3-030-45231-5_13},
researchr = {https://researchr.org/publication/FinkelHK20},
cites = {0},
citedby = {0},
pages = {237-256},
booktitle = {Foundations of Software Science and Computation Structures - 23rd International Conference, FOSSACS 2020, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25-30, 2020, Proceedings},
editor = {Jean Goubault-Larrecq and Barbara König 0001},
volume = {12077},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-030-45231-5},
}