Quantitative Weakest Hyper Pre Calculus for Non-Deterministic Programs

Quantitative Weakest Hyper Pre Calculus for Non-Deterministic Programs

Explore a groundbreaking weakest pre calculus for quantitative hyperproperty reasoning in non-deterministic programs. Delve into the extension of quantitative weakest pre from single initial states to initial sets of states or probability distributions. Discover how this novel approach enables a weakest pre calculus for hyper Hoare logic and facilitates reasoning about hyperquantities like expected values and variances. Learn from Linpeng Zhang and Benjamin Lucien Kaminski's presentation at ACM SIGPLAN's Incorrectness'24 conference, offering valuable insights into advanced program analysis techniques over the course of 19 minutes.