Abstract
The mechanisation of proofs for probabilistic systems is particularly challenging due to the verification of real-valued properties that probability entails: experience indicates [12,4,11] that there are many difficulties in automating real-number arithmetic in the context of other program features.
In this paper we propose a framework for verification of probabilistic distributed systems based on the generalisation of Kleene algebra with tests that has been used as a basis for development of concurrency control in standard programming [7]. We show that verification of real-valued properties in these systems can be considerably simplified, and moreover that there is an interpretation which is susceptible to counterexample search via state exploration, despite the underlying real-number domain.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arons, T., Pnueli, A., Zuck, L.: Parameterized verification by probabilistic abstraction. In: Gordon, A.D. (ed.) FOSSACS 2003. LNCS, vol. 2620, pp. 87–102. Springer, Heidelberg (2003)
Aspnes, J., Herlihy, M.: Fast randomized consensus using shared memory. J. Algorithms 11(3), 441–461 (1990)
Back, R.-J.R., von Wright, J.: The Refinement Calculus: A Systematic Introduction. Springer, Heidelberg (1998)
Celiku, O., McIver, A.: Cost-based analysis of probabilistic programs mechanised in HOL. Nordic Journal of Computing (2004)
Cohen, E.: Hypotheses in Kleene Algebra. Bellcore technical report (1994)
Cohen, E.: Lazy caching. Bellcore technical report (1994)
Cohen, E.: Separation and reduction. In: Backhouse, R., Oliveira, J.N. (eds.) MPC 2000. LNCS, vol. 1837, pp. 45–59. Springer, Heidelberg (2000)
de Alfaro, L., Henzinger, T.: Concurrent ω-regular games. In: Proc. 15th IEEE Symp. Logic in Computer Science. IEEE, Los Alamitos (2000)
Derman, C.: Finite State Markov Decision Processes. Academic Press, London (1970)
He, J., Seidel, K., McIver, A.K.: Probabilistic models for the guarded command language. Science of Computer Programming 28, 171–192 (1997)
Huang, T.S.: The Development of a Probabilistic B Method and a Supporting Toolkit. PhD thesis, Dept. Engineering and Computer Science. In: draft
Hurd, J., McIver, A.K., Morgan, C.C.: Probabilistic guarded commands mechanised in HOL. In: Proc. QAPL 2004. ETAPS (2004)
Jackson, D.: Alloy:A lightweight object modelling notation. ACM Transactions on Software Engineering and Methodology (TOSEM) 11, 256–290 (2002)
Jones, C., Plotkin, G.: A probabilistic powerdomain of evaluations. In: Proceedings of the IEEE 4th Annual Symposium on Logic in Computer Science, pp. 186–195. Computer Society Press, Los Alamitos (1989)
Jonsson, B., Larsen, K.G.: Specification and refinement of probabilistic processes. In: Proc. 6th Conf. LICS (1991)
Kozen, D.: Kleene algebra with tests and commutativity conditions. In: Margaria, T., Steffen, B. (eds.) TACAS 1996. LNCS, vol. 1055. Springer, Heidelberg (1996)
Kwiatkowska, M., Norman, G., Parker, D.: Probabilistic symbolic model checking with PRISM: A hybrid approach. In: Katoen, J.-P., Stevens, P. (eds.) TACAS 2002. LNCS, vol. 2280, p. 52. Springer, Heidelberg (2002)
Lowe, G.: Probabilities and priorities in timed CSP. Technical Monograph PRG-111, Oxford University Computing Laboratory, DPhil Thesis (1993)
McIver, A.K., Morgan, C.C.: Abstraction, Refinement and Proof for Probabilistic Programs. Springer, Heidelberg (2005)
Morgan, C.C.: The specification statement. ACM Transactions on Programming Languages and Systems 10(3) (July 1988) Reprinted in [24]
Morgan, C.C.: Programming from Specifications. Prentice-Hall, Englewood Cliffs (1994)
Morgan, C.C.: Private communication (2004)
Morgan, C.C., McIver, A.K., Seidel, K.: Probabilistic predicate transformers. ACM Transactions on Programming Languages and Systems 18(3), 325–353 (1996)
Morgan, C.C., Vickers, T.N. (eds.): On the Refinement Calculus. FACIT Series in Computer Science. Springer, Berlin (1994)
Nipkow, T., Paulson, L.C., Wenzel, M.: Isabelle/HOL. LNCS, vol. 2283. Springer, Heidelberg (2002)
Rabin, M.O.: N-process mutual exclusion with bounded waiting by 4log2n-valued shared variable. Journal of Computer and System Sciences 25(1), 66–75 (1982)
Segala, R.: Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, MIT (1995)
Shankar, N.: Automated verification using deduction, exploration and abstraction. In: McIver, A.K., Morgan, C.C. (eds.) Programming Methodology. Springer, Heidelberg (2003)
Weber, T.: Bounded model generation for Isabelle/HOL. In: Ahrendt, W., Baumgartner, P., de Nivelle, H., Ranise, S., Tinelli, C. (eds.) Selected Papers from the Workshops on Disproving and the Second International Workshop on Pragmatics of Decision Procedures (PDPAR 2004), July 2005. ENTCS, vol. 125, pp. 103–116. Elsevier, Amsterdam (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
McIver, A.K., Weber, T. (2005). Towards Automated Proof Support for Probabilistic Distributed Systems. In: Sutcliffe, G., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2005. Lecture Notes in Computer Science(), vol 3835. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11591191_37
Download citation
DOI: https://doi.org/10.1007/11591191_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30553-8
Online ISBN: 978-3-540-31650-3
eBook Packages: Computer ScienceComputer Science (R0)