ion Refinement And Proof For Probabilistic Systems 21-06-2016 2/4 Abstraction Refinement And Proof For Probabilistic Systems Other Files Available to Download [PDF] Blue Guides Vol. 3 : Cyprus If youâ€¦ (More)

Probabilistic predicates generalize standard predicates over a state space; with probabilistic predicate transformers one thus reasons about imperative programs in terms of probabilistic pre- andâ€¦ (More)

22nd Annual IEEE Symposium on Logic in Computerâ€¦

2007

In 1992 Wang & Larsen extended the may- and must preorders of De Nicola and Hennessy to processes featuring probabilistic as well as nondeterministic choice. They concluded with two problems thatâ€¦ (More)

Dijkstra's programming language is extended by <italic>specification statements</italic>, which specify parts of a program “yet to be developed.” A weakest precondition semantics is givenâ€¦ (More)

Recent work in sequential program semantics has produced both an operational (He et al., Sci. Comput. Programming 28(2, 3) (1997) 171â€“192) and an axiomatic (Morgan et al., ACM Trans. Programmingâ€¦ (More)

A complete set of algebraic laws is given for Dijkstra's nondeterministic sequential programming language. Iteration and recursion are explained in terms of Scott's domain theory as fixed points ofâ€¦ (More)

Data refinement is the systematic substitution of one data type for another in a program. Usually, the new data type is more efficient than the old, but possibly more complex; the purpose of the dataâ€¦ (More)