精确
发表于 2025-3-25 03:45:49
Nils Jansen,Sebastian Junges,Matthias VolkChapters explain many research and implementation successes inspired by Joost-Pieter Katoen.Contributions from leading scientists.Honors an influential researcher, teacher, and community leader
Charade
发表于 2025-3-25 09:12:07
Symbolic Quantitative Information Flow for Probabilistic Programse handle programs that combine discrete and continuous distributions. However, in the SOGA setting, we approximate the exact semantics using Gaussian mixtures and compute bounds for the measures. We demonstrate the use of our methods in two widely used mechanisms to ensure differential privacy: randomized response and the Gaussian mechanism.
毛细血管
发表于 2025-3-25 14:34:52
http://reply.papertrans.cn/77/7647/764642/764642_23.png
有杂色
发表于 2025-3-25 18:34:37
http://reply.papertrans.cn/77/7647/764642/764642_24.png
left-ventricle
发表于 2025-3-25 22:31:46
http://reply.papertrans.cn/77/7647/764642/764642_25.png
使增至最大
发表于 2025-3-26 01:50:31
Static Slicing for Probabilistic Programs: An Overviewbased on probabilistic control flow graphs. Through motivating examples and sketches of key definitions and results, we provide a clear, accessible, and self-contained presentation of slicing techniques for probabilistic programs.
说明
发表于 2025-3-26 04:45:05
Polar: An Algebraic Analyzer for (Probabilistic) Loopsmeter sensitivity. . 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, . also provides incomplete but sound techniques to compute moments of combinations of variables.
骑师
发表于 2025-3-26 12:30:16
http://reply.papertrans.cn/77/7647/764642/764642_28.png
palliate
发表于 2025-3-26 15:03:17
http://reply.papertrans.cn/77/7647/764642/764642_29.png
潜伏期
发表于 2025-3-26 17:27:00
Sound and Complete Techniques for Reasoning About Terminationamming models, extended with constructs for (unbounded) nondeterminism, fairness, and probabilistic choice. We provide both the computability-theoretic classification of the termination problems as well as sound and complete proof systems for proving termination.