Log In Sign Up

Graded Hoare Logic and its Categorical Semantics

by   Marco Gaboardi, et al.

Deductive verification techniques, based on program logics (i.e., the family of Floyd-Hoare logics), are a powerful approach for program reasoning. Recently, there has been a trend of increasing the expressive power of such logics by augmenting their rules with additional analyses. For example, general program logics have been augmented with cost analyses, logics for probabilistic programming have been augmented with estimate measures, and logics for differential privacy with sensitivity bounds. In this work, we unify these various disparate approaches via the paradigm of grading, adapted from the world of functional calculi and semantics. We propose Graded Hoare Logic (GHL), a parametrisable framework for augmenting program logics with a pre-ordered monoidal analysis. We develop a semantic framework for modelling GHL such that grading, logical assertions (pre- and post-conditions) and the underlying effectful semantics of an imperative language can be integrated together. Central to our framework is the notion of graded category which we extend here, introducing graded Freyd categories which provide a semantics that can interpret many examples of augmented program logics from the literature. We leverage coherent fibrations to model the base assertion language, and thus the overall setting is also fibrational.


page 1

page 2

page 3

page 4


Divergences on Monads for Relational Program Logics

Several relational program logics have been introduced for integrating r...

Higher-order probabilistic adversarial computations: Categorical semantics and program logics

Adversarial computations are a widely studied class of computations wher...

Unifying graded and parameterised monads

Monads are a useful tool for structuring effectful features of computati...

Fuzzi: A Three-Level Logic for Differential Privacy

Curators of sensitive datasets sometimes need to know whether queries ag...

An Assertion-Based Program Logic for Probabilistic Programs

Research on deductive verification of probabilistic programs has conside...

Intelligence Graph

In fact, there exist three genres of intelligence architectures: logics ...

A pre-semantics for counterfactual conditionals and similar logics

The elegant Stalnaker/Lewis semantics for counterfactual conditonals wor...