Continuous Pushdown VASS in One Dimension are Easy
CoRR(2024)
摘要
A pushdown vector addition system with states (PVASS) extends the model of
vector addition systems with a pushdown stack. The algorithmic analysis of
PVASS has applications such as static anal- ysis of recursive programs
manipulating integer variables. Unfor- tunately, reachability analysis, even
for one-dimensional PVASS is not known to be decidable. We relax the model of
one-dimensional PVASS to make the counter updates continuous and show that in
this case reachability, coverability, and boundedness are decidable in
polynomial time. In addition, for the extension of the model with lower-bound
guards on the states, we show that coverability and reachability are in NP, and
boundedness is in coNP.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要