Daniel Gaina, Masaki Nakamura 0001, Kazuhiro Ogata 0001, Kokichi Futatsugi. Stability of termination and sufficient-completeness under pushouts via amalgamation. Theoretical Computer Science, 848:82-105, 2020. [doi]
@article{GainaNOF20,
title = {Stability of termination and sufficient-completeness under pushouts via amalgamation},
author = {Daniel Gaina and Masaki Nakamura 0001 and Kazuhiro Ogata 0001 and Kokichi Futatsugi},
year = {2020},
doi = {10.1016/j.tcs.2020.09.024},
url = {https://doi.org/10.1016/j.tcs.2020.09.024},
researchr = {https://researchr.org/publication/GainaNOF20},
cites = {0},
citedby = {0},
journal = {Theoretical Computer Science},
volume = {848},
pages = {82-105},
}