Skip to main content
SpringerLink
Log in

Linking Theories of Probabilistic Programming

  • Chapter
  • First Online:
Symposium on Real-Time and Hybrid Systems

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11180))

  • 470 Accesses

Abstract

Formal methods advocate the critical role played by the algebraic approach in specification and implementation of programs. Traditionally, a top-down approach (with denotational model as its origin) links the algebra of programs with the denotational representation by establishment of the soundness and completeness of the algebra against the given model, while a bottom-up approach (a journey started from operational model) introduces a variety of bisimulations to establish the equivalence relation among programs. This paper follows up a new way presented in [1] to handle probabilistic programming. Our approach takes an algebra of probabilistic programs as its foundation, and then generates both denotational model and transition system, and explores the consistency among three types of representations.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and 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

References

  1. Jifeng, H., Qin, L.: A new roadmap for linking theories of programming and its applications on GCL and CSP. Sci. Comput. Program. Elsevier 162, 3–34 (2018)

    Article  Google Scholar 

  2. Abrial, J.-R.: The B-Book: Assigning Programs to Meanings. Cambridge Press, Cambridge (1996)

    Book  Google Scholar 

  3. Abrial, J.-R.: Modelling in Event-B: System and Software Engineering. Cambridge Press, Cambridge (2010)

    Book  Google Scholar 

  4. Dijkstra, E.W.: A Discipline of Programming. Prentice-Hall, Englewood Cliffs (1976)

    MATH  Google Scholar 

  5. Hehner, E.C.R.: A more complete model of communicating processes. Theor. Comput. Sci. 26, 105–120 (1983)

    Article  MathSciNet  Google Scholar 

  6. Hehner, E.C.R.: Predicative programming, part 1 and 2. Commun. ACM 27(2), 134–151 (1984)

    Article  MathSciNet  Google Scholar 

  7. Hennessy, M.C.: Algebraic Theory of Process. The MIT Press, Cambridge (1988)

    MATH  Google Scholar 

  8. Hoare, C.A.R., et al.: Laws of programming. Commun. ACM 30(8), 672–686 (1987)

    Article  MathSciNet  Google Scholar 

  9. Jones, C.B.: Systematic Software Development Using VDM. Prentice Hall, New York (1986)

    MATH  Google Scholar 

  10. Plotkin, G.D.: A structural approach to operational semantics. Technical Report, DAIMI-FN-19, Aarhus University, Denmark (1981)

    Google Scholar 

  11. Spivey, J.M.: The Z Notation: A Reference Manual. Prentice Hall, New York (1992)

    MATH  Google Scholar 

  12. Jifeng, H., Seidel, K., McIver, A.: Probabilistic models for the guarded command language. Sci. Comput. Program. 28(2–3), 171–192 (1997)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Shanghai Key Laboratory of Trustworthy Computing, East China Normal University, Shanghai, China

    He Jifeng

Authors
  1. He Jifeng
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to He Jifeng .

Editor information

Editors and Affiliations

  1. Newcastle University, Newcastle, UK

    Cliff Jones

  2. National University of Defense Technology, Changsha, China

    Ji Wang

  3. Institute of Software, CAS, Beijing, China

    Naijun Zhan

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Jifeng, H. (2018). Linking Theories of Probabilistic Programming. In: Jones, C., Wang, J., Zhan, N. (eds) Symposium on Real-Time and Hybrid Systems. Lecture Notes in Computer Science(), vol 11180. Springer, Cham. https://doi.org/10.1007/978-3-030-01461-2_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-01461-2_10

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-01460-5

  • Online ISBN: 978-3-030-01461-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation