Results 1 -
4 of
4
Reasoning about probabilistic sequential programs ∗
"... A complete and decidable Hoare-style calculus for iteration-free probabilistic sequential programs is presented using a state logic with truthfunctional propositional (not arithmetical) connectives. 1 ..."
Abstract
-
Cited by 6 (5 self)
- Add to MetaCart
A complete and decidable Hoare-style calculus for iteration-free probabilistic sequential programs is presented using a state logic with truthfunctional propositional (not arithmetical) connectives. 1
QMC: A Model Checker for Quantum Systems (Tool Paper)
"... The novel field of quantum computation and quantum information has been growing at a rapid rate; the study of quantum information in particular has led to the emergence of communication and cryptographic protocols with no classical analogues. Quantum information protocols have interesting properties ..."
Abstract
- Add to MetaCart
The novel field of quantum computation and quantum information has been growing at a rapid rate; the study of quantum information in particular has led to the emergence of communication and cryptographic protocols with no classical analogues. Quantum information protocols have interesting properties which
