Skip to main content

Advertisement

SpringerLink
Log in
Menu
Find a journal Publish with us
Search
Cart
Book cover

European Symposium on Programming

ESOP 2012: Programming Languages and Systems pp 169–193Cite as

  1. Home
  2. Programming Languages and Systems
  3. Conference paper
Probabilistic Abstract Interpretation

Probabilistic Abstract Interpretation

  • Patrick Cousot17 &
  • Michael Monerau17 
  • Conference paper
  • 1892 Accesses

  • 54 Citations

Part of the Lecture Notes in Computer Science book series (LNPSE,volume 7211)

Abstract

Abstract interpretation has been widely used for verifying properties of computer systems. Here, we present a way to extend this framework to the case of probabilistic systems.

The probabilistic abstraction framework that we propose allows us to systematically lift any classical analysis or verification method to the probabilistic setting by separating in the program semantics the probabilistic behavior from the (non-)deterministic behavior. This separation provides new insights for designing novel probabilistic static analyses and verification methods.

We define the concrete probabilistic semantics and propose different ways to abstract them. We provide examples illustrating the expressiveness and effectiveness of our approach.

Keywords

  • Markov Decision Process
  • Abstract Interpretation
  • Probabilistic Program
  • Abstract Domain
  • Semantic 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.

Download conference paper PDF

References

  1. Camporesi, F., Feret, J., Koeppl, H., Petrov, T.: Automatic reduction of stochastic rules-based models in a nutshell. Amer. Inst. of Physics, AIP 1281(2) (2010)

    Google Scholar 

  2. Chadha, R., Viswanathan, M., Viswanathan, R.: Least Upper Bounds for Probability Measures and Their Applications to Abstractions. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol. 5201, pp. 264–278. Springer, Heidelberg (2008)

    CrossRef  Google Scholar 

  3. Coletta, A., Gori, R., Levi, F.: Approximating probabilistic behaviors of biological systems using abstract interpretation  229(1), 165–182 (2009)

    Google Scholar 

  4. Cousot, P.: Constructive design of a hierarchy of semantics of a transition system by abstract interpretation. TCS 277(1-2), 47–103 (2002)

    CrossRef  MathSciNet  MATH  Google Scholar 

  5. Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: POPL, pp. 238–252 (1977)

    Google Scholar 

  6. Cousot, P., Cousot, R.: Systematic design of program analysis frameworks. In: POPL, pp. 269–282 (1979)

    Google Scholar 

  7. Cousot, P., Cousot, R.: Abstract interpretation frameworks. J. Logic and Comp. 2(4), 511–547 (1992)

    CrossRef  MathSciNet  MATH  Google Scholar 

  8. Cousot, P., Cousot, R.: Comparing the Galois Connection and Widening/Narrowing Approaches to Abstract Interpretation. In: Bruynooghe, M., Wirsing, M. (eds.) PLILP 1992. LNCS, vol. 631, pp. 269–295. Springer, Heidelberg (1992)

    CrossRef  Google Scholar 

  9. Cousot, P., Cousot, R., Feret, J., Mauborgne, L., Miné, A., Rival, X.: Why does Astrée scale up? FMSD 35(3), 229–264 (2009)

    MATH  Google Scholar 

  10. D’Argenio, P.R., Jeannet, B., Jensen, H.E., Larsen, K.G.: Reduction and Refinement Strategies for Probabilistic Analysis. In: Hermanns, H., Segala, R. (eds.) PAPM-PROBMIV 2002. LNCS, vol. 2399, pp. 57–76. Springer, Heidelberg (2002)

    CrossRef  Google Scholar 

  11. Forejt, V., Kwiatkowska, M., Norman, G., Parker, D.: Automated Verification Techniques for Probabilistic Systems. In: Bernardo, M., Issarny, V. (eds.) SFM 2011. LNCS, vol. 6659, pp. 53–113. Springer, Heidelberg (2011)

    CrossRef  Google Scholar 

  12. Hansson, H., Jonsson, B.: A logic for reasoning about time and reliability. FAC 6(5), 512–535 (1994)

    MATH  Google Scholar 

  13. Hehner, E.: Probabilistic Predicative Programming. In: Kozen, D. (ed.) MPC 2004. LNCS, vol. 3125, pp. 169–185. Springer, Heidelberg (2004)

    CrossRef  Google Scholar 

  14. Hehner, E.: A probability perspective. FAC 23(4), 391–419 (2011)

    MathSciNet  MATH  Google Scholar 

  15. Katoen, J.-P., McIver, A.K., Meinicke, L.A., Morgan, C.C.: Linear-Invariant Generation for Probabilistic Programs: Automated Support for Proof-Based Methods. In: Cousot, R., Martel, M. (eds.) SAS 2010. LNCS, vol. 6337, pp. 390–406. Springer, Heidelberg (2010)

    CrossRef  Google Scholar 

  16. Klenke, A.: Probability Theory: A Comprehensive Course. Springer, Heidelberg (2007)

    Google Scholar 

  17. Kozen, D.: Semantics of probabilistic programs. JCSS 22, 328–350 (1981)

    MathSciNet  MATH  Google Scholar 

  18. Kwiatkowska, M., Norman, G., Parker, D.: Using probabilistic model checking in systems biology. PER 35(4), 14–21 (2008)

    Google Scholar 

  19. McIver, A., Morgan, C.: Abstraction, Refinement and Proof for Probabilistic Systems. Springer, Heidelberg (2005)

    MATH  Google Scholar 

  20. Meyn, S.: Control Techniques for Complex Networks. CUP (2007)

    Google Scholar 

  21. Monniaux, D.: Abstract Interpretation of Probabilistic Semantics. In: SAS 2000. LNCS, vol. 1824, pp. 322–340. Springer, Heidelberg (2000)

    CrossRef  Google Scholar 

  22. Monniaux, D.: Abstract interpretation of programs as Markov decision processes. SCP 58(1–2), 179–205 (2005)

    MathSciNet  MATH  Google Scholar 

  23. Morgan, C., McIver, A., Seidel, K., Sanders, J.: Probabilistic predicate transformers. TOPLAS 18(3), 325–353 (1996)

    CrossRef  Google Scholar 

  24. Di Pierro, A., Hankin, C., Wiklicky, H.: Probabilistic lambda-calculus and quantitative program analysis. JLC 15(2), 159–179 (2005)

    MATH  Google Scholar 

  25. Di Pierro, A., Wiklicky, H.: Concurrent constraint programming: towards probabilistic abstract interpretation. In: PPDP, pp. 127–138. ACM (2000)

    Google Scholar 

  26. Di Pierro, A., Wiklicky, H.: Probabilistic Abstract Interpretation and Statistical Testing (Extended Abstract). In: Hermanns, H., Segala, R. (eds.) PAPM-PROBMIV 2002. LNCS, vol. 2399, pp. 211–212. Springer, Heidelberg (2002)

    CrossRef  Google Scholar 

  27. Roy, P., Parker, D., Norman, G., de Alfaro, L.: Symbolic magnifying lens abstraction in Markov decision processes. In: QEST 2008, pp. 103–112. IEEE (2008)

    Google Scholar 

  28. Smith, M.: Probabilistic abstract interpretation of imperative programs using truncated normal distributions 220(3), 43–59 (2008)

    Google Scholar 

  29. Wachter, B., Zhang, L.: Best Probabilistic Transformers. In: Barthe, G., Hermenegildo, M. (eds.) VMCAI 2010. LNCS, vol. 5944, pp. 362–379. Springer, Heidelberg (2010)

    CrossRef  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. NYU and École Normale Supérieure, Courant Institute, France

    Patrick Cousot & Michael Monerau

Authors
  1. Patrick Cousot
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michael Monerau
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Technische Universität München, Boltzmannstrasse 3, 85748, Garching, Germany

    Helmut Seidl

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cousot, P., Monerau, M. (2012). Probabilistic Abstract Interpretation. In: Seidl, H. (eds) Programming Languages and Systems. ESOP 2012. Lecture Notes in Computer Science, vol 7211. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28869-2_9

Download citation

  • .RIS
  • .ENW
  • .BIB
  • DOI: https://doi.org/10.1007/978-3-642-28869-2_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-28868-5

  • Online ISBN: 978-3-642-28869-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Share this paper

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

Search

Navigation

  • Find a journal
  • Publish with us

Discover content

  • Journals A-Z
  • Books A-Z

Publish with us

  • Publish your research
  • Open access publishing

Products and services

  • Our products
  • Librarians
  • Societies
  • Partners and advertisers

Our imprints

  • Springer
  • Nature Portfolio
  • BMC
  • Palgrave Macmillan
  • Apress
  • Your US state privacy rights
  • Accessibility statement
  • Terms and conditions
  • Privacy policy
  • Help and support

167.114.118.210

Not affiliated

Springer Nature

© 2023 Springer Nature