Measurement of refinement and correctness

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.

[1]  Ralph-Johan Back,et al.  Refinement Calculus: A Systematic Introduction , 1998 .

[2]  Annabelle McIver,et al.  Probabilistic Models for the Guarded Command Language , 1997, Sci. Comput. Program..

[3]  Annabelle McIver,et al.  Probabilistic predicate transformers , 1996, TOPL.

[4]  C. A. R. HOARE,et al.  An axiomatic basis for computer programming , 1969, CACM.

[5]  Klaus Keimel,et al.  Semantic Domains for Combining Probability and Non-Determinism , 2005, Electron. Notes Theor. Comput. Sci..

[6]  K. Hofmann,et al.  Continuous Lattices and Domains , 2003 .

[7]  Claire Jones,et al.  Probabilistic non-determinism , 1990 .

[8]  Annabelle McIver,et al.  Partial correctness for probabilistic demonic programs , 2001, Theor. Comput. Sci..

[9]  Edsger W. Dijkstra,et al.  A Discipline of Programming , 1976 .

[10]  Annabelle McIver,et al.  Demonic, angelic and unbounded probabilistic choices in sequential programs , 2001, Acta Informatica.

[11]  Yixiang Chen,et al.  Semantics of sub-probabilistic programs , 2008, Frontiers of Computer Science in China.

[12]  C. A. R. Hoare,et al.  An axiomatic basis for computer programming , 1969, CACM.

[13]  Klaus Keimel,et al.  A Minkowski type duality mediating between state and predicate transformer semantics for a probabilistic nondeterministic language , 2009, Ann. Pure Appl. Log..

[14]  Klaus Keimel,et al.  Semantic Domains for Combining Probability and Non-Determinism , 2005, Electronic Notes in Theoretical Computer Science.

[15]  Dexter Kozen,et al.  Semantics of probabilistic programs , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[16]  Dexter Kozen,et al.  A probabilistic PDL , 1983, J. Comput. Syst. Sci..

[17]  Mingsheng Ying,et al.  Reasoning about probabilistic sequential programs in a probabilistic logic , 2003, Acta Informatica.