サインイン
インサイト - Probabilistic program analysis
Control-Flow Refinement Improves Complexity Analysis of Probabilistic Programs in KoAT
The authors present a novel control-flow refinement (CFR) technique that can be used to improve the automated complexity analysis of probabilistic integer programs. They prove the soundness of their CFR approach and demonstrate its benefits by implementing it in their complexity analysis tool KoAT.
Automated Formal Analysis of Equivalence and Similarity of Probabilistic Program Outputs
The authors present a new method for static equivalence and similarity refutation analyses of probabilistic program pairs. The method is fully automated, applicable to infinite-state probabilistic programs, and provides formal guarantees on the correctness of its results.
© 2024 by Linnk AI