Verifying Probabilistic Programs Using a Hoare like Logic-Reference-Cited by-同舟云学术

Verifying Probabilistic Programs Using a Hoare like Logic

Published:1999 Issue: Volume: Page:113-125
ISSN:0302-9743
Container-title:Advances in Computing Science — ASIAN’99
language:
Short-container-title:

Author:

den Hartog J. I.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-46674-6_11

Reference20 articles.

1. L. de Alfaro. Formal Verification of Probabilistic Systems. PhD thesis, Stanford University, 1997.

2. S. Andova. Probabilistic process algebra. In Proceedings of ARTS’99, Bamberg, Germany, 1999.

3. K.R. Apt and E.-R. Olderog. Verification of Sequential and Concurrent Programs. Texts and Monographs in Computer Science. Springer-Verlag, 1991.

4. C. Baier, M. Kwiatkowska, and G. Norman. Computing probabilistic lower and upper bounds for ltl formulae over sequential and concurrent markov chains. Technical Report CSR-98-4, University of Birmingham, June 1998.

5. J.W. de Bakker. Mathematical Theory of Program Correctness. Series in Computer Science. Prentice-Hall Internationall, 1980.

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Combining Classical and Probabilistic Independence Reasoning to Verify the Security of Oblivious Algorithms;Lecture Notes in Computer Science;2024-09-11

2. A Calculus of Chaos in Stochastic Compilation;Lecture Notes in Computer Science;2020

3. A Compositional Modelling and Verification Framework for Stochastic Hybrid Systems;Formal Aspects of Computing;2017-07

4. Reverse Hoare Logic;Software Engineering and Formal Methods;2011

5. A Logic for Formal Verification of Quantum Programs;Advances in Computer Science - ASIAN 2009. Information Security and Privacy;2009