用插值法综合多个布尔函数的一个证明
Synthesizing Multiple Boolean Functions using Interpolation on a Single Proof
摘要:
通常很难为复杂的系统正确地实现布尔控制器,特别是当涉及并发时。然而,正式指定控制器可能很容易。例如,对于一个流水线处理器,只要声明流水线系统的可见行为应该与非流水线参考系统(Burch-Dill范例)相同就足够了。我们提出了一种新的程序,有效地合成多个布尔控制信号从一个规范作为一个量化的一阶公式(具有特定的量词结构)。我们的方法使用未解释的函数来抽象设计的细节。我们构造一个不可满足的SMT公式从给定的规格。然后,从仅仅一个证明的不可满足性,我们使用克雷格插值的一个变种来计算多个协调插值实现布尔控制信号。我们的方法避免了迭代学习和回代的控制功能。我们应用我们的方法来合成一个简单的两级流水线处理器的控制器,并提出第一个实验结果。
英文摘要:
It is often difficult to correctly implement a Boolean controller for a complex system, especially when concurrency is involved. Yet, it may be easy to formally specify a controller. For instance, for a pipelined processor it suffices to state that the visible behavior of the pipelined system should be identical to a non-pipelined reference system (Burch-Dill paradigm). We present a novel procedure to efficiently synthesize multiple Boolean control signals from a specification given as a quantified first-order formula (with a specific quantifier structure). Our approach uses uninterpreted functions to abstract details of the design. We construct an unsatisfiable SMT formula from the given specification. Then, from just one proof of unsatisfiability, we use a variant of Craig interpolation to compute multiple coordinated interpolants that implement the Boolean control signals. Our method avoids iterative learning and back-substitution of the control functions. We applied our approach to synthesize a controller for a simple two-stage pipelined processor, and present first experimental results.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。