3. Deciding Constants by Effective Weakest Preconditions

2006 ◽  
pp. 31-52
Author(s):  
Markus Müller-Olm
Keyword(s):  
Weakest Preconditions

scholarly journals Quantum weakest preconditions

2006 ◽  
Vol 16 (3) ◽  
pp. 429-451 ◽  
Author(s):  
ELLIE D'HONDT ◽  
PRAKASH PANANGADEN
Keyword(s):  
Quantum Computation ◽  
Representation Theorem ◽  
Completely Positive Maps ◽  
Completely Positive ◽  
Weakest Precondition ◽  
Positive Maps ◽  
Weakest Preconditions ◽  
Predicate Transformer ◽  
Usual State ◽  
Stone Type

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 in quantum computation. The proof that weakest preconditions exist for completely positive maps follows immediately from the Kraus representation theorem. As an example, we give the semantics of Selinger's language in terms of our weakest preconditions. We also cover some specific situations and exhibit an interesting link with stabilisers.

Eliminating Redundant Bounds Checks in Dynamic Buffer Overflow Detection Using Weakest Preconditions

2016 ◽  
Vol 65 (4) ◽  
pp. 1682-1699 ◽  
Author(s):  
Yulei Sui ◽  
Ding Ye ◽  
Yu Su ◽  
Jingling Xue
Keyword(s):  
Buffer Overflow ◽  
Weakest Preconditions

Software Reliability Analysis Using Weakest Preconditions in Linear Assignment Programs

2016 ◽  
Vol 42 (9) ◽  
pp. 866-885 ◽  
Author(s):  
Hang Luo ◽  
Xue Liu ◽  
Xi Chen ◽  
Ting Long ◽  
Ronghua Jiang
Keyword(s):  
Reliability Analysis ◽  
Software Reliability ◽  
Weakest Preconditions ◽  
Linear Assignment

Efficient weakest preconditions

2005 ◽  
Vol 93 (6) ◽  
pp. 281-288 ◽  
Author(s):  
K. Rustan M. Leino
Keyword(s):  
Weakest Preconditions
Sign in / Sign up

Export Citation Format

Share Document