Quantitative Strongest Post

by   Linpeng Zhang, et al.

We present a novel strongest-postcondition-style calculus for quantitative reasoning about non-deterministic programs with loops. Whereas existing quantitative weakest pre allows reasoning about the value of a quantity after a program terminates on a given initial state, quantitative strongest post allows reasoning about the value that a quantity had before the program was executed and reached a given final state. We show how strongest post enables reasoning about the flow of quantitative information through programs. Similarly to weakest liberal preconditions, we also develop a quantitative strongest liberal post. As a byproduct, we obtain the entirely unexplored notion of strongest liberal postconditions and show how these foreshadow a potential new program logic - partial incorrectness logic - which would be a more liberal version of O'Hearn's recent incorrectness logic.


page 1

page 2

page 3

page 4


Quantitative Separation Logic

We present quantitative separation logic (QSL). In contrast to classical...

Towards Concurrent Quantitative Separation Logic

In this paper, we develop a novel verification technique to reason about...

Relatively Complete Verification of Probabilistic Programs

We study a syntax for specifying quantitative "assertions" - functions m...

Galois connecting call-by-value and call-by-name

We establish a general framework for reasoning about the relationship be...

A program logic for fresh name generation

We present a program logic for Pitts and Stark's ν-calculus, an extensio...

Operational Annotations: A new method for sequential program verification

I present a new method for specifying and verifying the partial correctn...

Synthesizing Set Functions

Set functions are a feature of functional logic programming to encapsula...