@inproceedings{penelle_et_al:LIPIcs:2018:9943,
Address = {Dagstuhl, Germany},
Annote = {Keywords: Higher-order pushdown automata, Vector addition systems, Boundedness problem, Termination problem, Coverability problem},
Author = {Penelle, Vincent and Salvati, Sylvain and Sutre, Gr{\'e}goire},
BookTitle = {38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)},
Editor = {Ganguly, Sumit and Pandya, Paritosh},
File = {LIPIcs-FSTTCS-2018-44 (0) - a - a - v.pdf},
ISBN = {978-3-95977-093-4},
ISSN = {1868-8969},
Pages = {44:1--44:20},
Publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
Series = {Leibniz International Proceedings in Informatics (LIPIcs)},
Title = {{On the Boundedness Problem for Higher-Order Pushdown Vector Addition Systems}},
URL = {http://drops.dagstuhl.de/opus/volltexte/2018/9943},
Volume = {122},
Year = {2018},
bdsk-url-1 = {http://drops.dagstuhl.de/opus/volltexte/2018/9943},
bdsk-url-2 = {https://doi.org/10.4230/LIPIcs.FSTTCS.2018.44},
date-added = {2019-01-18 14:36:58 +0100},
date-modified = {2019-01-18 14:36:58 +0100},
urn = {urn:nbn:de:0030-drops-99432},
doi = {10.4230/LIPIcs.FSTTCS.2018.44}
}
Library Size: 13G (12942 entries),
Last Updated: Apr 05, 2026, 07:51:09,
Build Time: N/A