Skip to main content
SpringerLink
Log in

Probabilistic Analysis of Programs: A Weak Limit Approach

  • Conference paper
  • First Online:
Foundational and Practical Aspects of Resource Analysis (FOPARA 2013)

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

Abstract

We present an approach to probabilistic analysis which is based on program semantics and exploits the mathematical properties of the semantical operators to ensure a form of optimality for the analysis. As in the algorithmic setting, where the analysis results are used the help the design of efficient algorithms, the purposes of our framework are to offer static analysis techniques usable for resource optimisation.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 34.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 44.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

References

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

    Google Scholar 

  2. Di Pierro, A., Hankin, C., Wiklicky, H.: A systematic approach to probabilistic pointer analysis. In: Shao, Z. (ed.) APLAS 2007. LNCS, vol. 4807, pp. 335–350. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  3. Di Pierro, A., Sotin, P., Wiklicky, H.: Relational analysis and precision via probabilistic abstract interpretation. In: QAPL’08. Volume 220(3) of ENTCS., pp. 23–42. Elsevier (2008)

    Google Scholar 

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

    Google Scholar 

  5. Kubrusly, C.S.: The Elements of Operator Theory, 2nd edn. Birkhäuser, Boston (2011)

    Book  MATH  Google Scholar 

  6. Groetsch, C.W.: Stable Approximate Evaluation of Unbounded Operators. Lecture Notes in Mathematics. Springer, Berlin (2007)

    MATH  Google Scholar 

  7. Kozen, D.: Semantics of probabilistic programs. J. Comput. Syst. Sci. 22(3), 328–350 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  8. Nielson, F., Nielson, H.R., Hankin, C.: Principles of Program Analysis. Springer, Heidelberg (1999)

    Book  MATH  Google Scholar 

  9. Roman, S.: Advanced Linear Algebra, 2nd edn. Springer, New York (2005)

    MATH  Google Scholar 

  10. Kadison, R., Ringrose, J.: Fundamentals of the Theory of Operator Algebras: Elementary Theory. AMS (1997) reprint from Academic Press edition (1983)

    Google Scholar 

  11. Di Pierro, A., Wiklicky, H.: Semantics of probabilistic programs: a weak limit approach. In: Shan, C. (ed.) APLAS 2013. LNCS, vol. 8301, pp. 241–256. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  12. Di Pierro, A., Wiklicky, H.: Measuring the precision of abstract interpretations. In: Lau, K.-K. (ed.) LOPSTR 2000. LNCS, vol. 2042, pp. 147–164. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  13. Di Pierro, A., Hankin, C., Wiklicky, H.: Measuring the confinement of probabilistic systems. Theor. Comput. Sci. 340(1), 3–56 (2005)

    Article  MATH  Google Scholar 

  14. Ben-Israel, A., Greville, T.N.E.: Gereralized Inverses - Theory and Applications. CMS Books in Mathematics, 2nd edn. Springer, New York (2003)

    Google Scholar 

  15. Böttcher, A., Silbermann, B.: Introduction to Large Truncated Toeplitz Matrices. Springer, New York (1999)

    Book  MATH  Google Scholar 

  16. Deutsch, F.: Best Approximation in Inner-Product Spaces. Springer, New York (2001)

    Book  MATH  Google Scholar 

  17. Pinkus, A.M.: On \(L^1\)-Approximation. Cambridge University Press, London (1989)

    Google Scholar 

  18. Di Pierro, A., Wiklicky, H.: Probabilistic data flow analysis: a linear equational approach. In: Proceedings of GandALF’13. Volume 119 of EPTCS, pp. 150–165 (2013)

    Google Scholar 

  19. Fabian, M., Habala, P., Hájek, P., Montesinos, V., Zizler, V.: Banach Space Theory - The Basis for Linear and Nonlinear Analysis. Springer, New York (2011)

    MATH  Google Scholar 

  20. Atkinson, K., Han, W.: Theoretical Numerical Analysis - A Functional Analysis Framework, 3rd edn. Springer, New York (2009)

    MATH  Google Scholar 

  21. Nailin, D.: Finite-dimensional approximation settings for infinite-dimensional Moore-Penrose inverses. SIAM J. of Numer. Anal. 46(3), 1454–1482 (2008)

    Article  MATH  Google Scholar 

  22. Kulkarni, S., Ramesh, G.: Projection methods for computing Moore-Penrose inverses of unbounded operators. Indian J. Pure Appl. Math. 41(5), 647–662 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  23. Groetsch, C.: Spectral methods for linear inverse problems with unbounded operators. J. Approx. Theory 70, 16–28 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  24. Groetsch, C.: Dykstra’s algorithm and a representation of the Moore-Penrose inverse. J. Approx. Theory 117, 179–184 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  25. Groetsch, C.: An iterative stabilization method for the evaluation of unbounded operators. Proc. AMS 134, 1173–1181 (2005)

    Article  MathSciNet  Google Scholar 

  26. Plateau, B., Atif, K.: Stochastic automata network of modeling parallel systems. IEEE Trans. Softw. Eng. 17(10), 1093–1108 (1991)

    Article  MathSciNet  Google Scholar 

  27. Fourneau, J.M., Plateau, B., Stewart, W.: Product form for stochastic automata networks. In: Proceedings of ValueTools ’07, ICST, pp. 32:1–32:10 (2007)

    Google Scholar 

  28. Gugercin, S., Antoulas, A.: Model reduction of large-scale systems by least squares. Linear Algebra Appl. 415, 290–321 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  29. Buchholz, P., Kriege, J.: Aggregation of markovian models - an alternating least squares approach. In: QEST, pp. 43–52 (2012)

    Google Scholar 

  30. Cousot, P., Monerau, M.: Probabilistic abstract interpretation. In: Seidl, H. (ed.) ESOP 2012. LNCS, vol. 7211, pp. 169–193. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Università di Verona, Verona, Italy

    Alessandra Di Pierro

  2. Department of Computing, Imperial College, London, UK

    Herbert Wiklicky

Authors
  1. Alessandra Di Pierro
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Herbert Wiklicky
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Herbert Wiklicky .

Editor information

Editors and Affiliations

  1. Università di Bologna, Bologna, Italy

    Ugo Dal Lago

  2. Universidad Complutense de Madrid, Madrid, Spain

    Ricardo Peña

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Di Pierro, A., Wiklicky, H. (2014). Probabilistic Analysis of Programs: A Weak Limit Approach. In: Dal Lago, U., Peña, R. (eds) Foundational and Practical Aspects of Resource Analysis. FOPARA 2013. Lecture Notes in Computer Science(), vol 8552. Springer, Cham. https://doi.org/10.1007/978-3-319-12466-7_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-12466-7_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-12465-0

  • Online ISBN: 978-3-319-12466-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation