Skip to main navigation Skip to search Skip to main content

Alignment Completeness for Relational Hoare Logics

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

Relational Hoare logics (RHL) provide rules for reasoning about relations between programs. Several RHLs include a rule we call sequential product that infers a relational correctness judgment from judgments of ordinary Hoare logic (HL). Other rules embody sensible patterns of reasoning and 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 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. The notion may serve to guide the design of RHLs and relational verifiers for richer programming languages and alignment patterns.

Original languageEnglish
Title of host publication2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2021
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781665448956
DOIs
StatePublished - Jun 29 2021
Event36th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2021 - Virtual, Online
Duration: Jun 29 2021 → Jul 2 2021

Publication series

NameProceedings - Symposium on Logic in Computer Science
Volume2021-June

Conference

Conference36th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2021
CityVirtual, Online
Period6/29/21 → 7/2/21

ASJC Scopus subject areas

  • Software
  • General Mathematics

Fingerprint

Dive into the research topics of 'Alignment Completeness for Relational Hoare Logics'. Together they form a unique fingerprint.

Cite this