Practical Verification Framework for Predicate-Transformer Monads

Investigate whether the foundational weakest- and strongest-postcondition monad results can support a practical Loom-style verification framework for strongest postconditions, general weakest preconditions, and both under- and over-approximate reasoning.

Background

The paper develops predicate-transformer monads, monad morphisms, and Dijkstra-monad constructions, and mechanizes the results in Rocq. However, it does not build a practical verification framework integrating strongest postconditions, general weakest preconditions, and both approximation directions. The conclusion explicitly identifies as future work the unresolved question of whether these foundational constructions can underpin such a framework.

References

Further work is needed to investigate whether these foundational results can underpin a practical verification framework in the style of Loom that supports sps, general wps, and both under- and over-approximation, ideally allowing these different kinds of reasoning to be meaningfully combined.

— A Taxonomy of Predicate Transformer Monads for Specifying Monadic Programs  (2610.23604 - Pribisova et al., 16 Oct 2026) in Section 11, “Conclusion and Future Work”