Polar: An Algebraic Analyzer for (Probabilistic) Loops

Abstract

We present the Polar framework for fully automating the analysis of classical and probabilistic loops using algebraic reasoning. The central theme in Polar comes with handling algebraic recurrences that precisely capture the loop semantics. To this end, our work implements a variety of techniques to compute exact closed-forms of recurrences over higher-order moments of variables, infer invariants, and derive loop sensitivities with respect to unknown parameters. Polar can analyze probabilistic loops containing if-statements, polynomial arithmetic, and common probability distributions. By translating loop analysis into linear recurrence solving, Polar uses the derived closed-forms of recurrences to compute the strongest polynomial invariant or to infer parameter sensitivity. Polar is both sound and complete within well-defined programming model restrictions. Lifting any of these restrictions results in significant hardness limits of computation. To overcome computational burdens for the sake of efficiency, Polar also provides incomplete but sound techniques to compute moments of combinations of variables.

Published in "Principles of Verification: Cycling the Probabilistic Landscape"

References in corpus (8)

• Aiming Low Is Harder -- Induction for Lower Bounds in Probabilistic Program Verification
• Invariant Generation for Multi-Path Loops with Polynomial Assignments
• This Is the Moment for Probabilistic Loops
• A Deductive Verification Infrastructure for Probabilistic Programs (Extended Version)
• Aligator.jl - A Julia Package for Loop Invariant Generation
• Moment-based Invariants for Probabilistic Loops with Non-polynomial Assignments
• Strong Invariants Are Hard: On the Hardness of Strongest Polynomial Invariants for (Probabilistic) Programs
• Exact and Approximate Moment Derivation for Probabilistic Loops With Non-Polynomial Assignments