Relational Hoare logics (RHL) provide rules for reasoning about relations between programs. Several RHLs include a rule, Sequential-Product, that infers a relational correctness judgment from judgments of ordinary Hoare logic (HL). A variety of other rules have been found useful in practice, but Sequential-Product is relatively complete on its own (with HL). As a more satisfactory way to evaluate RHLs, a notion of alignment completeness for rules is introduced, in terms of the inductive assertion method and product automata. Alignment completeness results are given to account for several different sets of rules. Applying alignment completeness to richer languages and product notions may serve to guide the design of RHLs.

中文翻译：

---

关系Hoare逻辑的对齐完整性

关系Hoare逻辑（RHL）为推理程序之间的关系提供了规则。几个RHL包含一个规则，即“顺序乘积”，该规则从普通Hoare逻辑（HL）的判断中推断出关系正确性判断。在实践中发现了许多其他规则也很有用，但是顺序产品本身（相对于HL）是相对完整的。作为评估RHL的更令人满意的方法，就归纳断言方法和乘积自动机而言，引入了规则的对齐完整性的概念。给出对齐完整性结果以说明几套不同的规则。将对齐完整性应用于更丰富的语言和产品概念可能有助于指导RHL的设计。