约束自动机的数据优化
Data optimizations for constraint automata
摘要:
约束自动机(CA)构成了一个基于有限自动机的无限词的协调模型。最初是为了协调器的建模而引入的,CA的一个有趣的新应用是实现协调器(即,将CA编译成可执行代码)。这种方法保证了构造的正确性,甚至可以产生比手工编写的代码性能更好的代码。这两个潜在优势的实现程度取决于CA编译器的智能性和其正确性的证据的存在。CA中的每个转换都被标记为“数据约束”,该约束将协调进程之间的原子数据流指定为一阶公式。在运行时,编译器生成的代码必须尽可能有效地处理数据约束。在本文中,我们提出,并证明了两个优化技术的正确性CA编译器相关的处理数据约束:减少,以消除冗余变量和翻译(声明性)数据约束(命令式)的数据命令表示在一个小的顺序语言。通过实验,我们表明,这些优化技术可以产生积极的影响,性能生成的可执行代码。
英文摘要:
Constraint automata (CA) constitute a coordination model based on finite automata on infinite words. Originally introduced for modeling of coordinators, an interesting new application of CAs is implementing coordinators (i.e., compiling CAs into executable code). Such an approach guarantees correctness-by-construction and can even yield code that outperforms hand-crafted code. The extent to which these two potential advantages materialize depends on the smartness of CA-compilers and the existence of proofs of their correctness. Every transition in a CA is labeled by a "data constraint" that specifies an atomic data-flow between coordinated processes as a first-order formula. At run-time, compiler-generated code must handle data constraints as efficiently as possible. In this paper, we present, and prove the correctness of two optimization techniques for CA-compilers related to handling of data constraints: a reduction to eliminate redundant variables and a translation from (declarative) data constraints to (imperative) data commands expressed in a small sequential language. Through experiments, we show that these optimization techniques can have a positive impact on performance of generated executable code.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。