Skip to main content
SpringerLink
Log in

Measurement of refinement and correctness

  • Research Article
  • Published:
Frontiers of Computer Science in China Aims and scope Submit manuscript

Abstract

The purpose of this paper is to introduce a measurement approach of refinement and correctness of probabilistic programs. That is, we define the refinement degree and the correctness degree by the weakest precondition transformers. This kind of measurement indicates the degree that a program is refined by another and the degree that a program is correct with respect to a pair of precondition and postcondition. Some properties of this measurement, for example continuity, are discussed.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Dijkstra E W. A Discipline of Programming. Englewood Cliffs: Prentice Hall International, 1976

    MATH  Google Scholar 

  2. Back R J, Von Wright J. Refinement Calculus: A Systematic Introduction. New York: Springer-Verlag, 1998

    MATH  Google Scholar 

  3. Kozen D. Semantics of probabilistic programs. Journal of Computer and System Science, 1981, 22: 328–350

    Article  MATH  MathSciNet  Google Scholar 

  4. Kozen D. A probabilistic PDL. Journal of Computer and System Science, 1985, 30: 162–178

    Article  MATH  MathSciNet  Google Scholar 

  5. Jones C. Probabilistic non-determinism. PhD thesis. Edinburgh: University of Edinburgh, 1990

    Google Scholar 

  6. Hoare C A R. An axiomatic basis for computer programming. Communications of the ACM, 1969, 12(10): 576–580

    Article  MATH  Google Scholar 

  7. He J F, Seidel K, McIver A K. Probabilistic models for the guarded command language. Science of Computer Programming, 1997, 28: 171–192

    Article  MATH  MathSciNet  Google Scholar 

  8. Morgan C, McIver A K, Seidel K. Probabilistic predicate transformers. ACM Transactions on Programming Languages and Systems, 1996, 18: 325–353

    Article  Google Scholar 

  9. McIver A K, Morgan C. Partial correctness for probabilistic demonic programs. Theoretical Computer Science, 2001, 266: 513–541

    Article  MATH  MathSciNet  Google Scholar 

  10. McIver A K, Morgan C. Demonic, angelic and unbounded probabilistic choices in sequential programs. Acta Informatica, 2001, 37(4–5): 329–354

    Article  MATH  MathSciNet  Google Scholar 

  11. Tix R, Keimel K, Plotkin G. Semantic domains for combining probability and non-determinism. Electronic Notes in Theoretical Computer Science, 2005, 129: 1–108

    Article  MATH  MathSciNet  Google Scholar 

  12. Keimel K, Rosenbusch A, Streicher T. A Minkowski type duality mediating between state and predicate transformer semantics for a probabilistic nondeterministic language. Annals of Pure and Applied Logic, 2008

  13. Ying M S. Reasoning about probabilistic sequential programs in a probabilistic logic. Acta Informatica, 2003, 39: 315–389

    Article  MATH  MathSciNet  Google Scholar 

  14. Chen Y X, Wu H Y. Semantics of sub-probabilistic programs. Frontiers of Computer Science in China, 2008, 2(2): 29–38

    Article  Google Scholar 

  15. Gierz G, et al. Continuous Lattices and Domains. Cambridge University Press, 2003

Download references

Author information

Authors and Affiliations

  1. Information Engineer College, Hangzhou Dianzi University, Hangzhou, 310018, China

    Hengyang Wu

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

    Hengyang Wu

Authors
  1. Hengyang Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hengyang Wu.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wu, H. Measurement of refinement and correctness. Front. Comput. Sci. China 3, 465–471 (2009). https://doi.org/10.1007/s11704-009-0016-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11704-009-0016-4

Keywords

Search

Navigation