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

Celý popis

Podrobná bibliografia

Vydané v:	Proceedings of ACM on programming languages Ročník 8; číslo OOPSLA2; s. 817 - 845
Hlavní autori:	Zhang, Linpeng, Zilberstein, Noam, Kaminski, Benjamin Lucien, Silva, Alexandra
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York, NY, USA ACM 08.10.2024
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!