Abstract
In industrial contexts, safety regulations often mandate upper bounds on the probabilities of failure. Now that embedded computers are part of many indus- trial environments, it is often needed to analyze programs with non-deterministic and probabilistic behavior. We propose a general abstract interpretation based method for the static analysis of programs using random generators or random inputs. Our method also allows \ordinary" non-deterministic inputs, not neces- sarily following a random distribution.
Chapter PDF
Similar content being viewed by others
Keywords
- Weight Function
- Abstract Interpretation
- Continuous Linear Operator
- Probabilistic Program
- Abstract Domain
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
François Bourdoncle. Interprocedural abstract interpretation of block structured languages with nested procedures, aliasing and recursivity. In PLILP’ 90, volume 456 of LNCS, pages 307–323. Springer-Verlag, 1990.
P. Cousot and R. Cousot. Static determination of dynamic properties of programs. In Proceedings of the Second International Symposium on Programming, pages 106–130. Dunod, Paris, France, 1976.
Patrick Cousot and Radhia Cousot. Abstract interpretation and application to logic programs. J. Logic Prog., 2-3(13):103–179, 1992.
Alessandra Di Pierro and Herbert Wiklicky. Concurrent constraint programming: Towards probabilistic abstract interpretation. In 2nd International Conference on Principles and Practice of Declarative Programming (PPDP 2000), 2000.
J.L. Doob. Measure Theory, volume 143 of Graduate Texts in Mathematics. Springer-Verlag, 1994.
Paul R. Halmos. Measure theory. The University series in higher mathematics. Van Nostrand, 1950.
Jifeng He, K. Seidel, and A. McIver. Probabilistic models for the guarded command language. Science of Computer Programming, 28(2-3):171–192, April 1997. Formal specifications: foundations, methods, tools and applications (Konstancin, 1995).
D. Kozen. Semantics of probabilistic programs. In 20th Annual Symposium on Foundations of Computer Science, pages 101–114, Long Beach, Ca., USA, October 1979. IEEE Computer Society Press.
D. Kozen. Semantics of probabilistic programs. Journal of Computer and System Sciences, 22(3):328–350, 1981.
Serge Lang. Linear algebra. Springer-Verlag, New York, 1989.
Gavin Lowe. Representing nondeterminism and probabilistic behaviour in reactive processes. Technical Report TR-11-93, Oxford University, 1993.
David Monniaux. Abstract interpretation of probabilistic semantics. In Seventh International Static Analysis Symposium (SAS’00), number 1824 in Lecture Notes in Computer Science. Springer-Verlag, 2000. © Springer-Verlag.
David Monniaux. An abstract Monte-Carlo method for the analysis of probabilistic programs (extended abstract). In 28th Symposium on Principles of Programming Languages (POPL’ 01). Association for Computer Machinery, 2001. To appear.
Carroll Morgan, Annabelle McIver, Karen Seidel, and J. W. Sanders. Probabilistic predicate transformers. Technical Report TR-4-95, Oxford University, February 1995.
Carroll Morgan, Annabelle McIver, Karen Seidel, and J. W. Sanders. Refinement-oriented probability for CSP. Formal Aspects of Computing, 8(6):617–647, 1996.
Reuven Y. Rubinstein. Simulation and the Monte-Carlo Method. Wiley series in probabilities and statistics. John Wiley & Sons, 1981.
Walter Rudin. Real and Complex Analysis. McGraw-Hill, 1966.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Monniaux, D. (2001). Backwards Abstract Interpretation of Probabilistic Programs. In: Sands, D. (eds) Programming Languages and Systems. ESOP 2001. Lecture Notes in Computer Science, vol 2028. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45309-1_24
Download citation
DOI: https://doi.org/10.1007/3-540-45309-1_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41862-7
Online ISBN: 978-3-540-45309-3
eBook Packages: Springer Book Archive