术语重写的并行复杂度分析
Analysing Parallel Complexity of Term Rewriting
摘要：
我们重新审视并行最里面的长期重写作为一个模型的并行计算归纳数据结构，并提供了相应的概念的运行时复杂度参数的大小的开始长期。我们提出了自动技术，以获得上界和下界的并行重写的复杂性，使现有的技术的顺序复杂性的直接重用。该方法的适用性和精度证明了相对较轻的努力，在扩展的程序分析工具AProVE和众多的基准从文献中的实验。
英文摘要：
We revisit parallel-innermost term rewriting as a model of parallel computation on inductive data structures and provide a corresponding notion of runtime complexity parametric in the size of the start term. We propose automatic techniques to derive both upper and lower bounds on parallel complexity of rewriting that enable a direct reuse of existing techniques for sequential complexity. The applicability and the precision of the method are demonstrated by the relatively light effort in extending the program analysis tool AProVE and by experiments on numerous benchmarks from the literature.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
