带注释的堆栈树
Annotated Stack Trees
摘要:
注释下推自动机提供了一个高阶递归模式的自动机模型,它可以反过来用于模拟高阶程序的验证。我们研究地面注释堆栈树重写系统-树重写系统,其中每个节点被标记的配置的注释下推自动机。这允许在高阶程序中对分叉和连接构造进行建模,并且是最近由Penelle引入的高阶堆栈树的概括。我们表明,给定一个规则的一组注释栈树,可以达到这个集合的树的集合也是规则的,并且对于一个n阶系统,这是最优的,可以在n-EXPTIME中构造。我们还表明,我们的建设可以扩展到允许一个全球性的状态,通过不相关的节点的树可以进行通信,通信的数量受到一个固定的界限。
英文摘要:
Annotated pushdown automata provide an automaton model of higher-order recursion schemes, which may in turn be used to model higher-order programs for the purposes of verification. We study Ground Annotated Stack Tree Rewrite Systems -- a tree rewrite system where each node is labelled by the configuration of an annotated pushdown automaton. This allows the modelling of fork and join constructs in higher-order programs and is a generalisation of higher-order stack trees recently introduced by Penelle. We show that, given a regular set of annotated stack trees, the set of trees that can reach this set is also regular, and constructible in n-EXPTIME for an order-n system, which is optimal. We also show that our construction can be extended to allow a global state through which unrelated nodes of the tree may communicate, provided the number of communications is subject to a fixed bound.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。