Skip to main content

Abstract Interpretation of Probabilistic Semantics

  • Conference paper
Book cover Static Analysis (SAS 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1824))

Included in the following conference series:

Abstract

Following earlier models, we lift standard deterministic and nondeterministic semantics of imperative programs to probabilistic semantics. This semantics allows for random external inputs of known or unknown probability and random number generators.

We then propose a method for analysing programs according to this semantics, in the general framework of abstract interpretation. This method lifts an “ordinary” abstract lattice, for non-probabilistic programs, to one suitable for probabilistic programs.

Our construction is highly generic. We discuss the influence of certain parameters on the precision of the analysis, basing ourselves on experimental results.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cousot, P.: Méthodes itératives de construction et d’approximation de points fixes d’opérateurs monotones sur un treillis, analyse sémantique de programmes. Thèse d’état ès sciences mathématiques, Université scientifique et médicale de Grenoble, Grenoble, France, mars 21 (1978)

    Google Scholar 

  2. Cousot, P., Cousot, R.: Abstract interpretation and application to logic programs. Logic Prog. 2-3(13), 103–179 (1992)

    Article  MathSciNet  Google Scholar 

  3. Cousot, P., Halbwachs, N.: Automatic discovery of linear restraints among variables of a program. In: Proceedings of the Fifth Conference on Principles of Programming Languages, ACM Press, New York (1978)

    Google Scholar 

  4. Deutsch, A.: Semantic models and abstract interpretation techniques for inductive data structures and pointers. In: Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, La Jolla, California, June 21–23, pp. 226–229 (1995)

    Google Scholar 

  5. Doob, J.L.: Measure Theory. Graduate Texts in Mathematics, vol. 143. Springer, Heidelberg (1994)

    MATH  Google Scholar 

  6. Granger, P.: Static analysis of linear congruence equalities among variables of a program. In: CAAP 1991 and TAPSOFT 1991. LNCS, vol. 493, pp.I. 169–172. Springer, Heidelberg (1991)

    Google Scholar 

  7. Granger, P.: Improving the results of static analyses programs by local decreasing iteration. In: Shyamasundar, R.K. (ed.) FSTTCS 1992. LNCS, vol. 652, pp. 68–79. Springer, Heidelberg (1992)

    Google Scholar 

  8. He, J., Seidel, K., McIver, A.: Probabilistic models for the guarded command language. Science of Computer Programming 28(2–3), 171–192 (1997), Formal specifications: foundations, methods, tools and applications (Konstancin, 1995)

    MATH  MathSciNet  Google Scholar 

  9. Jones, C.: Probabilistic Non-Determinism. PhD thesis, University of Edinburgh (1990)

    Google Scholar 

  10. Kozen, D.: Semantics of probabilistic programs. In: 20th Annual Symposium on Foundations of Computer Science, Long Beach, Ca., USA, pp. 101–114. IEEE Computer Society Press, Los Alamitos (1979)

    Google Scholar 

  11. Kozen, D.: Semantics of probabilistic programs. Journal of Computer and System Sciences 22(3), 328–350 (1981), A novel attempt at defining the semantics of probabilistic programs. Two equivalent semantics are presented

    Article  MATH  MathSciNet  Google Scholar 

  12. Lowe, G.: Representing nondeterminism and probabilistic behaviour in reactive processes. Technical Report TR-11-93, Oxford University (1993)

    Google Scholar 

  13. Masdupuy, F.: Semantic analysis of interval congruences. In: Pottosin, I.V., Bjorner, D., Broy, M. (eds.) FMP&TA 1993. LNCS, vol. 735, Springer, Heidelberg (1993)

    Chapter  Google Scholar 

  14. Morgan, C., McIver, A., Seidel, K., Sanders, J.W.: Probabilistic predicate transformers. Technical Report TR-4-95, Oxford University (February 1995)

    Google Scholar 

  15. Morgan, C., McIver, A., Seidel, K., Sanders, J.W.: Refinementoriented probability for CSP. Formal Aspects of Computing 8(6), 617–647 (1996)

    Article  MATH  Google Scholar 

  16. Rudin, W.: Real and Complex Analysis. McGraw-Hill, New York (1966)

    MATH  Google Scholar 

  17. Wagner, T.A., Maverick, V., Graham, S.L., Harrison, M.A.: Accurate static estimators for program optimization. ACM SIGPLAN Notices 29(6), 85–96 (1994)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Monniaux, D. (2000). Abstract Interpretation of Probabilistic Semantics. In: Palsberg, J. (eds) Static Analysis. SAS 2000. Lecture Notes in Computer Science, vol 1824. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45099-3_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45099-3_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67668-3

  • Online ISBN: 978-3-540-45099-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics