Alignment Completeness for Relational Hoare Logics

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 bee...

Full description

Saved in:
Bibliographic Details
Published in:Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science pp. 1 - 13
Main Authors: Nagasamudram, Ramana, Naumann, David A.
Format: Conference Proceeding
Language:English
Published: IEEE 29.06.2021
Subjects:
Automata
Cognition
Computer languages
Computer science
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
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.
AbstractList 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.
Author Naumann, David A.
Nagasamudram, Ramana
Author_xml – sequence: 1
  givenname: Ramana
  surname: Nagasamudram
  fullname: Nagasamudram, Ramana
  organization: Stevens Institute of Technology
– sequence: 2
  givenname: David A.
  surname: Naumann
  fullname: Naumann, David A.
  organization: Stevens Institute of Technology
BookMark eNotj8tKw0AUQEdQUGu-QJD8QNM7N_O6yxLUFgKCj3WZpHdKJJkpmWz8ewW7OpvDgXMvrmOKLMSThEpKoE27bz40olEVAsqKlAVDcCUKsk4ao5VypM2tKHL-BgB0VoKiO4HbcTjFieNSNmk6j7xw5JzLkObynUe_DCn6sdwlP3PZptPQ5wdxE_yYubhwJb5enj-b3bp9e90323bt0dGytoS6x44IPBtX26M0qqvhqLoQlHdG2mAUBi8dQc2s_0zpNDkA6nvlsV6Jx__uwMyH8zxMfv45XM7qX5gCRSw
ContentType Conference Proceeding
DBID 6IE
6IH
CBEJK
RIE
RIO
DOI 10.1109/LICS52264.2021.9470690
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan (POP) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP) 1998-present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Xplore
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISBN 9781665448956
1665448954
EndPage 13
ExternalDocumentID 9470690
Genre orig-research
GroupedDBID 6IE
6IH
ACM
ALMA_UNASSIGNED_HOLDINGS
APO
CBEJK
GUFHI
LHSKQ
RIE
RIO
ID FETCH-LOGICAL-a289t-7925c2b990ae6837d164b30d4bff4a8617f642fa18903ee5b9918598009cc4a23
IEDL.DBID RIE
ISICitedReferencesCount 8
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000947350400072&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
IngestDate Wed Aug 27 02:23:08 EDT 2025
IsPeerReviewed false
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-a289t-7925c2b990ae6837d164b30d4bff4a8617f642fa18903ee5b9918598009cc4a23
PageCount 13
ParticipantIDs ieee_primary_9470690
PublicationCentury 2000
PublicationDate 2021-June-29
PublicationDateYYYYMMDD 2021-06-29
PublicationDate_xml – month: 06
  year: 2021
  text: 2021-June-29
  day: 29
PublicationDecade 2020
PublicationTitle Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science
PublicationTitleAbbrev LICS
PublicationYear 2021
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0002871049
Score 2.2570267
Snippet Relational Hoare logics (RHL) provide rules for reasoning about relations between programs. Several RHLs include a rule we call sequential product that infers...
SourceID ieee
SourceType Publisher
StartPage 1
SubjectTerms Automata
Cognition
Computer languages
Computer science
Title Alignment Completeness for Relational Hoare Logics
URI https://ieeexplore.ieee.org/document/9470690
WOSCitedRecordID wos000947350400072&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LawIxEB5UeujJtlr6Joceu7pmd03mWKRiQUToA2-SZGeLIFp07e_vZF23FHrpLeRBSEIy3zeZB8B9n2ySImaBxZQJCsVhoA2TFR3xYRtuC4tgz-9jNZno2QynNXiofGGIqDA-o44vFn_56drtvKqsi7HygXXrUFdK7X21Kn2KR_6Mdksn4F6I3fHz4MWjC685kb1OOfhXFpVCiAyb_5v-BNo_3nhiWsmZU6jR6gyah3QMorydLZCPy8VH8bkvfOPSw2F-xwTDUnGweTNLMVqbDQmfY9lt2_A2fHodjIIyJUJgmBnlgUKZOGlZhBjqM7dMme3YKExjm2Wx0QxHMiYUmelpDCOihHuyQEZGhehcbGR0Do3VekUXICzqvpJkGQNQHBGiIpXYRCuXae0kXkLLb8H8cx_1Yl6u_urv6ms49rvsjagk3kAj3-zoFo7cV77Ybu6Ko_oGKXiTJg
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEB5qFfRUtRXf5uDRbXez2W5ylGJpcS0Fq_RWkuysFEpX-vD3O9luK4IXbyEPyINkvm8yD4D7NpooVSrzjEqJoKDwPamJrMiQDltTm18Ee35P4sFAjsdqWIGHnS8MIhbGZ9h0xeIvP83t2qnKWkrELrDuHuxHQvBg462106g47E94t3QDDnzVSvqdV4cvnO6EB81y-K88KoUY6db-N4FjaPz447HhTtKcQAXnp1DbJmRg5f2sA3-cTT-K733mGmcOENNLxgiYsq3Vm56xXq4XyFyWZbtswFv3adTpeWVSBE8TN1p5seKR5YaEiMY2scuU-I4J_VSYLBNaEiDJiFJkOpDKDxEj6kkiWREuVNYKzcMzqM7zOZ4DM0q2Y46GUACKEJWKMY5MJGObSWm5uoC624LJ5ybuxaRc_eXf1Xdw2Bu9JJOkP3i-giO3486kiqtrqK4Wa7yBA_u1mi4Xt8WxfQMEf5Zt
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=Proceedings+of+the+36th+Annual+ACM%2FIEEE+Symposium+on+Logic+in+Computer+Science&rft.atitle=Alignment+Completeness+for+Relational+Hoare+Logics&rft.au=Nagasamudram%2C+Ramana&rft.au=Naumann%2C+David+A.&rft.date=2021-06-29&rft.pub=IEEE&rft.spage=1&rft.epage=13&rft_id=info:doi/10.1109%2FLICS52264.2021.9470690&rft.externalDocID=9470690