An abstract Monte-Carlo method for the analysis of probabilistic programs

DOI10.1145/360204.360211MaRDI QIDQ5178876zbMATH OpenOpenAlexFDO

Authors David Monniaux

Publication date 17 March 2015

Published in Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/360204.360211

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Semantics in the theory of computing (68Q55) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Recommendations

• scientific article; zbMATH DE number 1617330
• Abstraction Refinement for Probabilistic Software
• scientific article; zbMATH DE number 1692951
• Probabilistic abstract interpretation
• scientific article; zbMATH DE number 1832220

Cited in

(10)

• Generalized probabilistic perturbation method for static analysis
• Abstract interpretation of programs as Markov decision processes
• Probabilistic abstract interpretation: from trace semantics to DTMC's and linear regression
• Probabilistic abstract interpretation
• Statistical verification of probabilistic properties with unbounded until
• scientific article; zbMATH DE number 2090849 (Why is no real title available?)
• Computing Program Reliability Using Forward-Backward Precondition Analysis and Model Counting
• Automatic probabilistic program verification through random variable abstraction
• Evaluating complex MAC protocols for sensor networks with APMC
• Towards abstraction-based probabilistic program analysis

This page was built for publication: An abstract Monte-Carlo method for the analysis of probabilistic programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5178876)