An algebra of alignment for relational verification

02/09/2022
by   Timos Antonopoulos, et al.
0

Relational verification encompasses information flow security, regression verification, translation validation for compilers, and more. Effective alignment of the programs and computations to be related facilitates use of simpler relational invariants which in turn enables automation and modular reasoning. Alignment has been explored in terms of trace pairs, deductive rules of relational Hoare logics (RHL), and several forms of product automata. This article shows how a simple extension of Kleene Algebra with Tests (KAT), called BiKAT, subsumes prior formulations, including alignment witnesses for forall-exists properties, which brings to light new RHL rules for such properties. Alignments can be discovered algorithmically or devised manually but, in either case, their adequacy with respect to the original programs must be proved; an explicit algebra enables constructive proof by equational reasoning. Furthermore our approach inherits algorithmic benefits from existing KAT-based techniques and tools, which are applicable to a range of semantic models.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/20/2022

Making Relational Hoare Logic Alignment Complete

In relational verification, judicious alignment of computational steps f...
research
07/19/2023

Alignment complete relational Hoare logics for some and all

In relational verification, judicious alignment of computational steps f...
research
01/27/2021

Alignment Completeness for Relational Hoare Logics

Relational Hoare logics (RHL) provide rules for reasoning about relation...
research
07/13/2020

Thirty-seven years of relational Hoare logic: remarks on its principles and history

Relational Hoare logics extend the applicability of modular, deductive v...
research
03/25/2023

The WhyRel Prototype for Relational Verification

Verifying relations between programs arises as a task in various verific...
research
08/16/2020

Automatic Translation of tock-CSP into Timed Automata

The process algebra tock-CSP provides textual notations for modelling di...
research
04/27/2021

Temporal Reasoning Through Automatic Translation of tock-CSP into Timed Automata

In this work, we consider translating tock-CSP into Timed Automata for U...

Please sign up or login with your details

Forgot password? Click here to reset