Zhang, Linpeng;
(2025)
Quantitative Program Analysis:
From Strongest Postconditions to Hyperproperties.
Doctoral thesis (Ph.D), UCL (University College London).
Preview |
Text
Linpeng Zhang - PhD Thesis.pdf - Accepted Version Download (1MB) | Preview |
Abstract
The main aim of this thesis is to provide a holistic comprehension of strongest-postcondition-style calculus and weakest-precondition-style calculus for quantitative program analysis. To achieve this goal, the thesis will present novel concepts that deepen the understanding of program correctness and incorrectness, paving the way for the creation of new program logics. For example, it will define new predicate transformers such as the strongest liberal post, along with their quantitative variants, and demonstrate their applications in Information Flow Analysis. Furthermore, by bridging the gap between quantitative forward and back- ward transformers, the thesis will progressively elevate the reasoning to a more general setting, making the calculi parametrized to a class of semirings. This parametrization will enable a deeper understanding of the fundamental relationships between forward and backward, correctness and incorrectness, as well as nontermination and unreachability. Finally, the thesis will delve into the study of hyperproperties and integrate predicate transformers reasoning into them, and beyond. It will demonstrate that their quantitative variants enable reasoning about hyperquantities, thus facilitating analyses involving expected values, variance, and other quantitative metrics. Moreover, the exploration of higher-order predicate transformers will provide insights into their limitations and advantages, allowing for the instantiation of simpler predicate transformers when reasoning about less complex properties.
Type: | Thesis (Doctoral) |
---|---|
Qualification: | Ph.D |
Title: | Quantitative Program Analysis: From Strongest Postconditions to Hyperproperties |
Open access status: | An open access version is available from UCL Discovery |
Language: | English |
Additional information: | Copyright © The Author 2025. Original content in this thesis is licensed under the terms of the Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0) Licence (https://creativecommons.org/licenses/by-nc/4.0/). Any third-party copyright material present remains the property of its respective owner(s) and is licensed under its existing terms. Access may initially be restricted at the author’s request. |
Keywords: | Formal, verification, hyperproperties, predicate, transformers, logics |
UCL classification: | UCL UCL > Provost and Vice Provost Offices > UCL BEAMS UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Computer Science |
URI: | https://discovery.ucl.ac.uk/id/eprint/10211548 |
Archive Staff Only
![]() |
View Item |