Abstract interpretation of programs as Markov decision processes

DOI10.1007/3-540-44898-5_13MaRDI QIDQ4813401zbMATH OpenFDO

Authors David Monniaux

Publication date 13 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2694/26940237.htm

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Abstract interpretation of programs as Markov decision processes
• Abstract interpretation of probabilistic semantics
• Least Upper Bounds for Probability Measures and Their Applications to Abstractions
• Probabilistic abstract interpretation
• An abstract Monte-Carlo method for the analysis of probabilistic programs

Cited in

(7)

• A denotational semantics for low-level probabilistic programs with nondeterminism
• Quantitative static analysis of communication protocols using abstract Markov chains
• Abstract interpretation of programs as Markov decision processes
• On finite-state approximants for probabilistic computation tree logic
• Least upper bounds for probability measures and their applications to abstractions
• Quantitative static analysis of communication protocols using abstract Markov chains
• On the Monniaux problem in abstract interpretation

This page was built for publication: Abstract interpretation of programs as Markov decision processes

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