The author presents the NPA-PMA framework for efficient program analysis of probabilistic programs, addressing challenges with multiple confluence operations.
Probabilistic programs pose challenges for program analysis, but NPA-PMA offers a non-iterative solution.