巨大变量组合逻辑设计优化软件的研究与设计

采用不同优化算法和机器处理方法来缓解机器资源对巨大变量组合逻辑综合问题的限制。介绍了软件系统设计的技术途径。以此形成的巨大变量逻辑优化软件,其输入、输出变量之和达到300。该软件通过了组合逻辑电路的benchmark例题测试。其优化效果的平均输入输出之比为0．652。     

Process algebra with guards: Combining Hoare logic with process algebra

We extend process algebra with guards, comparable to the guards in guarded commands or conditions in common programming constructs such as if — then — else — fi and while — do — od.The extended language is provided with an operational semantics based on transitions between pairs of a process and a (data-)state. The data-states are given by a data environment that also defines in which data-states guards hold and how atomic actions (non-deterministically) transform these states. The operational semantics is studied modulo strong bisimulation equivalence. For basic process algebra (without operators for parallelism) we present a small axiom system that is complete with respect to a general class of data environments. Given a particular data environmentL we add three axioms to this system, which is then again complete, provided weakest preconditions are expressible andL is sufficiently deterministic.Then we study process algebra with parallelism and guards. A two phase-calculus is provided that makes it possible to prove identities between parallel processes. Also this calculus is complete. In the last section we show that partial correctness formulas can easily be expressed in this setting. We use process algebra with guards to prove the soundness of a Hoare logic for linear processes by translating proofs in Hoare logic into proofs in process algebra.Supported by ESPRIT Basic Research Action no. 3006 (CONCUR) and by RACE project no. 1046 (SPECS).Supported by RACE project no. 1046 (SPECS).     

用Hoare逻辑验证程序的一般方法及实例

本文引用一个简单的语言说明如何验证一个程序的正确性，并且给出一个实例来进行验证，并指明了今后的研究方向。