We study (collapsible) higher-order pushdown systems -- theoretically robust and well-studied models of higher-order programs -- along with their natural subclass called (collapsi...
In this paper, we address the verification problem of ordered multi-pushdown systems: A multistack extension of pushdown systems that comes with a constraint on stack operations s...
We present an overview of linear-time temporal logics with Presburger constraints whose models are sequences of tuples of integers. Such formal specification languages are welldesi...