On automated verification of probabilistic programs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4963 LNCS, Issue , 2008, Pages 173-187

  Legay, Axel ^a   Murawski, Andrzej S ^b   Ouaknine, Joël ^b   Worrell, James ^b  

^a UNIVERSITY OF LIÈGE   (Belgium)

^b UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BASIC (PROGRAMMING LANGUAGE); BINARY SEQUENCES; BINARY TREES; COMPUTABILITY AND DECIDABILITY; COMPUTER AIDED SOFTWARE ENGINEERING; COMPUTER SOFTWARE; CRYPTOGRAPHY; EQUIVALENCE CLASSES; GAME THEORY; INFORMATION THEORY; LINGUISTICS; PROBABILITY; PROBLEM ORIENTED LANGUAGES; PROGRAMMING THEORY; TREES (MATHEMATICS);

AUTOMATED VERIFICATION; BINARY SEARCH TREES; CASE STUDIES; DATATYPES; EQUIVALENCE CHECKER; EQUIVALENCE PROBLEMS; EUROPEAN; GAME SEMANTICS; HEIDELBERG (CO); INTERNATIONAL CONFERENCES; NON-TRIVIAL; PROBABILISTIC PROGRAMMING LANGUAGE; PROBABILISTIC PROGRAMS; RANDOM INSERTION (RAIN); RANDOMISED ALGORITHMS; SPEED UPS; STABILISATION;

COMPUTER PROGRAMMING LANGUAGES;

EID: 47249157727     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78800-3_13     Document Type: Conference Paper

References (25)

1. Abramsky, S., Jagadeesan, R., Malacaria, P.: Full abstraction for PCF. Inf. Comput. 163, 409-470 (2000)
2. Bhargava, M., Palamidessi, C.: Probabilistic anonymity. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol. 3653, pp. 171-185. Springer, Heidelberg (2005)
3. Chaum, D.: The dining cryptographers problem: Unconditional sender and recipient untraceability. J. Cryptology 1(1), 65-75 (1988)
4. Ciesinski, F., Baier, C.: LiQuor: A tool for qualitative and quantitative linear time analysis of reactive systems. In: Proceedings of QEST, IEEE Computer Society Press, Los Alamitos (2006)
5. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)
6. Danos, V., Harmer, R.: Probabilistic game semantics. ACM Trans. Comput. Log. 3(3), 359-382 (2002)
7. Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Commun. ACM 17(11), 643-644 (1974)
8. Esparza, J., Etessami, K.: Verifying probabilistic procedural programs. In: Lodaya, K., Mahajan, M. (eds.) FSTTCS 2004. LNCS, vol. 3328, pp. 16-31. Springer, Heidelberg (2004)
9. Herman, T.: Probabilistic self-stabilization. Inf. Process. Lett. 35(2), 63-67 (1990)
10. Hibbard, T.N.: Some combinatorial properties of certain trees with applications to searching and sorting. J. ACM 9(1), 13-28 (1962)
11. Hinton, A., Kwiatkowska, M.Z., Norman, G., Parker, D.: PRISM: A Tool for Automatic Verification of Probabilistic Systems. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006. LNCS, vol. 3920, pp. 441-444. Springer, Heidelberg (2006)
12. Hyland, J.M.E., Ong, C.-H.L.: On Full Abstraction for PCF: I. Models, observables and the full abstraction problem, II. Dialogue games and innocent strategies, III. A fully abstract and universal game model. Inf. Comput. 163(2), 285-408 (2000)
13. Jonassen, A.T., Knuth, D.E.: A trivial algorithm whose analysis isn't. J. Comput. Syst. Sci. 16(3), 301-322 (1978)
14. Knott, G.D.: Deletion in Binary Storage Trees. PhD thesis, Stanford University, Computer Science Technical Report STAN-CS-75-491 (1975)
15. Knuth, D.E.: Sorting and searching. In: The Art of Computer Programming (first printing), vol. 3, Addison-Wesley, Reading (1973)
16. Kozen, D.: Semantics of probabilistic programs. J. Comput. Syst. Sci. 22(3), 328-350 (1981)
17. Larsen, K., Skou, A.: Compositional verification of probabilistic processes. In: Cleaveland, W.R. (ed.) CONCUR 1992. LNCS, vol. 630, Springer, Heidelberg (1992)
18. Legay, A., Murawski, A.S., Ouaknine, J., Worrell, J.: Verification of probabilistic programs via equivalence checking. (preparation)
19. Murawski, A.S., Ouaknine, J.: On Probabilistic Program Equivalence and Refinement. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol. 3653, pp. 156-170. Springer, Heidelberg (2005)
20. Norman, G., Palamidessi, C, Parker, D., Wu, P.: Model checking the probabilistic π-calculus. In: Proceedings of QEST, IEEE Computer Society Press, Los Alamitos (2007)
21. PRISM case study: Dining Cryptographers. www.prismmodelchecker.org/ casestudies/dining_crypt.php
22. Rabin, M.O.: Probabilistic automata. Information and Control 6(3), 230-245 (1963)
23. Rabin, M.O.: Probabilistic algorithms. In: Proceedings of the Symposium on Algorithms and Complexity, Academic Press, London (1976)
24. Schneider, S., Sidiropoulos, A.: CSP and anonymity. In: Martella, G., Kurth, H., Montolivo, E., Bertino, E. (eds.) ESORICS 1996. LNCS, vol. 1146, Springer, Heidelberg (1996)
25. Tzeng, W.-G.: A polynomial-time algorithm for the equivalence of probabilistic automata. SIAM J. Comput. 21(2), 216-227 (1992)