Model checking the probabilistic π-calculus

Proceedings - 4th International Conference on the Quantitative Evaluation of Systems, QEST 2007

Volumn , Issue , 2007, Pages 169-178

  Norman, Gethin ^a   Palamidessi, Catuscia ^b   Parker, David ^a   Wu, Peng ^c  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b INRIA   (France)

^c ÉCOLE POLYTECHNIQUE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; FORMAL VERIFICATION; MARKOV PROCESSES; MOBILE AD HOC NETWORKS; NETWORK PROTOCOLS; NETWORK SECURITY; PRISMS; SYSTEMS ANALYSIS;

AUTOMATED PROCEDURES; AUTOMATED VERIFICATION; HIGH-LEVEL MODELING; MARKOV DECISION PROCESSES; PARALLEL COMPONENT; PROBABILISTIC MODELING; SECURITY PROTOCOLS; VERIFICATION TECHNIQUES;

MODEL CHECKING;

EID: 47949122893     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/QEST.2007.27     Document Type: Conference Paper

References (26)

1. M. Bhargava and C. Palamidessi. Probabilistic anonymity. In Proc. CONCUR'05, volume 3653 of LNCS, pages 171-185. Springer, 2005.
2. B. Blanchet. ProVerif: Automatic cryptographic protocol verifier user manual. 2005.
3. M. Boreale and R. D. Nicola. A symbolic semantics for the π-calculus. Information and Computation, 126(1):34-52, April 10 1996.
4. S. Chaki, S. Rajamani, and J. Rehof. Types as models: Model checking message-passing programs. In Proc. POPL'02, pages 45-57. ACM, 2002.
5. K. Chatzikokolakis and C. Palamidessi. A frame-work to analyze probabilistic protocols and its application to the partial secrets exchange. In Proc. International Symposium on Trustworthy Global Computing (TGC05), 2005.
6. D. Chaum. The dining cryptographers problem: Unconditional sender and recipient untraceability. Journal of Cryptology, 1:65-75, 1988.
7. S. Even, O. Goldreich, and A. Lempel. A randomized protocol for signing contracts. Communications of the ACM, 28(6):637-647, 1985.
8. M. Goldsmith, N. Moffat, B. Roscoe, T. Whitworth, and I. Zakiuddin. Watchdog transformations for property-oriented model-checking. In Proc. FME'03, volume 2805 of LNCS. Springer, 2003.
9. M. Hennessy and H. Lin. Symbolic bisimulations. Theoretical Computer Science, 138:353-389, 1995.
10. O. Herescu and C. Palamidessi. Probabilistic asynchronous π-calculus. In Proc. FOSSACS'00, volume 1784 of LNCS, pages 146-160. Springer, 2000.
11. A. Hinton, M. Kwiatkowska, G. Norman, and D. Parker. PRISM: A tool for automatic verification of probabilistic systems. In Proc. TACAS'06, volume 3920 of LNCS, pages 441-444. Springer, 2006.
12. H. Lin. Symbolic bisimulation and proof systems for the π-calculus. Technical report, School of Cognitive and Computer Science, University of Sussex, 1994.
13. H.Lin. Computing bisimulations for finite-control π-calculus. Journal of Computer Science and Technology, 15(1):1- 9, 2000.
14. H. Lin. Complete inference systems for weak bisimulation equivalences in the pi-calculus. Information and Computation, 180(1): 1-29, 2003.
15. R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes. Information and Computation, 100:1-40, 1992.
16. G. Norman, C. Palamidessi, D. Parker, and P. Wu. Translating the probabilistic π-calculus to PRISM. Technical Report CSR-07-02, School of Computer Science, University of Birmingham, 2007.
17. G. Norman and V. Shmatikov. Analysis of probabilistic contract signing. Journal of Computer Security, 14(6):561-589, 2006.
18. F. Orava and J. Parrow. An algebraic verification of a mobile network. Formal Aspects of Computing, 4:497-543, 1992.
19. Online PRISM documentation www.prismmodelchecker.org/doc/.
20. C. Priami. Stochastic π-calculus. The Computer Journal, 38(7):578-589, 1995.
21. R. Segala and N. Lynch. Probabilistic simulations for probabilistic processes. Nordic Journal of Computing, 2(2):250-273, 1995.
22. H. Song and K. Compton. Verifying π-calculus processes by Promela translation. Technical Report CSETR-472-03, University of Michigan, 2003.
23. B. Victor and F. Moller. The Mobility Workbench - a tool for the π-calculus. In Proc. CAV'94, volume 818 of LNCS, pages 428-440. Springer, 1994.
24. P. Wu. Interpreting π-calculus with Spin/Promela. Computer Science, 8:7-9, 2003. Supplement.
25. P. Wu, C. Palamidessi, and H. Lin. Symbolic bisimulations for probabilistic systems. In Proc. QEST'07, 2007.
26. P. Yang, C. Ramakrishnam, and S. Smolka. A logic encoding of the π-calculus: model checking mobile processes using tabled resolution. International Journal on Software Tools Technology Transfer, 4:1-29, 2004.