Quantitative Weakest Hyper Pre: Unifying Correctness and Incorrectness Hyperproperties via Predicate Transformers

We present a novel weakest pre calculus for reasoning about quantitative hyperproperties over nondeterministic and probabilistic programs. Whereas existing calculi allow reasoning about the expected value that a quantity assumes after program termination from a single initial state, we do so for ini...

Full description

Bibliographic Details

Published in:	Proceedings of ACM on programming languages Vol. 8; no. OOPSLA2; pp. 817 - 845
Main Authors:	Zhang, Linpeng, Zilberstein, Noam, Kaminski, Benjamin Lucien, Silva, Alexandra
Format:	Journal Article
Language:	English
Published:	New York, NY, USA ACM 08.10.2024
Subjects:	Axiomatic semantics Hoare logic Logic and verification Pre- and post-conditions Probabilistic computation Program analysis Program verification Programming logic Theory of computation weakest precondition strongest postcondition hyperproperties probabilistic verification quantitative software verification nondeterminism
ISSN:	2475-1421, 2475-1421
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!