Verifying Probabilistic Programs Using A Hoare Like Logic: full version free software download5/31/2016 Publication » Verifying Probabilistic Programs Using A Hoare Like Logic. Keywords: Hoare logic; Probability; Randomized algorithms; Program verification; Probabilistic predicates. Hoare logic can be used to verify properties of deterministic programs by deriving correctness formulae, also called Hoare triples. The goal of this paper is to extend the Hoare logic to be able to deal with probabilistic. Title Verifying probabilistic programs using a Hoare-like logic Author J.I. den Hartog E.P. de Vink: Year of publication 2002 In International Journal of Foundations of Computer Science, Vol. 13(2002), No. 3, p. Title Verifying probabilistic programs using a Hoare like logic Author J.I. den Hartog: Year of publication 1999 In Advances in Computing Science - ASIAN'99 (Proceedings 5th Asian Computing Science Conference. BibTeX @MISC{Hartog02verifyingprobabilistic, author = {J. I. Den Hartog and E. P. De Vink}, title = {Verifying Probabilistic Programs Using A Hoare Like Logic}, year = {2002}}. Cite. Seer. X — Citation Query Verifying probabilistic programs using a hoare like logic. Citation Context.. Logics supporting such reasoning have branched in two main directions. Firstly, Hoare- style =- =[3. The second approach enriches temporal modalities with probabilistic bounds [1.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. Archives
September 2016
Categories |