Quantitative Weakest Hyper Pre
summary
A novel calculus defines a weakest hyper pre predicate transformer that predicts quantitative properties over initial sets or probability distributions for non‑deterministic programs. It models hyperquantities (expectation, variance, max/min over supports) and matches existing weakest‑pre/expectation transformers by instantiation. The transformer both proves and falsifies hyper‑Hoare triples by intersecting with angelic/demonic WP/WLP or strongest postconditions to produce concrete counterexample states or exact preconditions, and it handles probabilistic choice explicitly.
AI-written summary · about