Soundness of a purely syntactical formalizationof weakest preconditions

نویسنده

Rudolf Berghammer

چکیده

We present a purely syntactical deenition of E.W. Dijkstra's predicate transformer wp for nondeterministic while-programs in innnitary logic. Then we show that it is sound wrt. a deenition of weakest preconditions given in terms of denotational semantics.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Simple characterizations for commutativity of quantum weakest preconditions

In a recent letter by Ying et al. [Inf. Process. Lett. 104 (2007) 152-158], it showed some sufficient conditions for commutativity of quantum weakest preconditions. This paper provides some simple characterizations for the commutativity of quantum weakest preconditions, i.e., Theorem 3, Theorem 4 and Proposition 5 in what follows. We also show that to characterize the commutativity of quantum w...

متن کامل

Quantum weakest preconditions

We develop a notion of predicate transformer and, in particular, the weakest precondition, appropriate for quantum computation. We show that there is a Stone-type duality between the usual state-transformer semantics and the weakest precondition semantics. Rather than trying to reduce quantum computation to probabilistic programming we develop a notion that is directly taken from concepts used ...

متن کامل

Commutativity of quantum weakest preconditions

The notion of quantum weakest precondition was introduced by D’Hondt and P. Panangaden (Mathematical Structures in Computer Science 16(2006)429-451), and they presented a representation of weakest precondition of a quantum program in the operatorsum form. In this letter, we give an intrinsic characterization of the weakest precondition of a quantum program given in a systemenvironment model. Fu...

متن کامل

Weakest Preconditions for High-Level Programs (Long Version)

In proof theory, a standard method for showing the correctness of a program w.r.t. given preand postconditions is to construct a weakest precondition and to show that the precondition implies the weakest precondition. In this paper, graph programs in the sense of Habel and Plump 2001 are extended to programs over high-level rules with application conditions, a formal definition of weakest preco...

متن کامل