Newtonian Program Analysis of Probabilistic Programs

Due to their quantitative nature, probabilistic programs pose non-trivial challenges for designing compositional and efficient program analyses. Many analyses for probabilistic programs rely on iterative approximation. This article presents an interprocedural dataflow-analysis framework, called NPA-...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Proceedings of ACM on programming languages 2024-04, Vol.8 (OOPSLA1), p.305-333, Article 105
Hauptverfasser:	Wang, Di, Reps, Thomas
Format:	Artikel
Sprache:	eng
Schlagworte:	Algebraic semantics Probabilistic computation Program analysis Theory of computation Tree languages
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!