Measuring the confinement of probabilistic systems

Theoretical Computer Science

Volumn 340, Issue 1, 2005, Pages 3-56

  Di Pierro, Alessandra ^a   Hankin, Chris ^b   Wiklicky, Herbert ^b  

^a UNIVERSITY OF PISA   (Italy)

^b IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

Probabilistic bisimulation; Probabilistic weak bisimulation; Security analysis; Static program analysis; Statistical testing

Indexed keywords

COMPUTER SCIENCE; COSTS; DATA TRANSFER; MARKOV PROCESSES; MATHEMATICAL MODELS; PROBABILITY DISTRIBUTIONS; RELIABILITY; SEMANTICS; STATISTICAL TESTS;

PROBABILISTIC BISIMULATION; PROBABILISTIC WEAK BISIMULATION; SECURITY ANALYSIS; STATIC PROGRAM ANALYSIS;

SECURITY OF DATA;

EID: 18544383932     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.03.002     Document Type: Article

References (69)

1. A. Aldini, M. Bravetti, R. Gorrieri, A process algebraic approach for the analysis of probabilistic non-interference, J. Comput. Security, 2003, to appear.
2. A. Aldini, A. Di Pierro, A quantitative approach to noninterference for probabilistic systems, in: M. Bravetti, G. Gorrieri (Eds.), Electronic Notes in Theoretical Computer Science, Vol. 99. Elsevier Science, Amsterdam, 2004 (Proc. MEFISTO Project 2003, Formal Methods for Security and Time).
3. D. Applebaum Probability and Information - An Integrated Approach 1996 Cambridge University Press Cambridge
4. C. Baier, H. Hermanns, Weak bisimulation for fully probabilistic processes, in: Proc. 9th Int. Conf. Computer Aided Verification, Lecture Notes in Computer Science, Vol. 1254, Springer, Berlin, 1997, pp. 119-130.
5. J.A. Bergstra, A. Ponse, S.A. Smolka (Eds.), Handbook of Process Algebra, Elsevier Science, Amsterdam, 2001.
6. F.J. Beutler The operator theory of the pseudo-inverse J. Math. Anal. Appl. 10 1965 451-470, 471-493
7. N. Biggs Algebraic Graph Theory second ed. 1993 Cambridge Mathematical Library, Cambridge University Press Cambridge
8. P. Billingsley Probability and Measure second ed. 1986 Wiley New York
9. A. Böttcher, and B. Silbermann Introduction to Large Truncated Toeplitz Matrices 1999 Springer New York
10. F. van Breugel, J. Worrell, An algorithm for quantitative verification of probabilistic transition systems, in: Proc. CONCUR'01, Lecture Notes in Computer Science, Vol. 2154, Springer, Berlin, 2001.
11. F. van Breugel, J. Worrell, Towards quantitative verification of probabilistic transition systems, in: Proc. ICALP'01, Lecture Notes in Computer Science, Vol. 2076, Springer, Berlin, 2001, pp. 421-432.
12. S.L. Campbell, and D. Meyer Generalized Inverse of Linear Transformations 1979 Constable and Company London
13. H. Cavusoglu, B. Mishra, and S. Raghunathan A model for evaluating IT security investments Comm. ACM 47 7 2004 87 92
14. A.Z.R. Cleaveland, S. Smolka, Testing preorders for probabilistic processes, in: Proc. ICALP 92, Lecture Notes in Computer Science, Vol. 623, Springer, Berlin, 1992, pp. 708-719.
15. J.B. Conway, A Course in Functional Analysis, second ed., Graduate Texts in Mathematics, Vol. 96, Springer, New York, 1990.
16. P. Cousot, and R. Cousot Abstract interpretation a unified lattice model for static analysis of programs by construction or approximation of fixpoints Proc. POPL'77 Los Angeles 1977 238 252
17. P. Cousot, and R. Cousot Systematic design of program analysis frameworks Proc. POPL'79 San Antonio, TX 1979 269 282
18. P. Cousot, and R. Cousot Abstract interpretation and applications to logic programs J. Logic Program. 13 2-3 1992 103 180
19. D. Dams, R. Gerth, and O. Grumberg Abstract interpretation of reactive systems ACM Trans. Program. Languages Systems 19 2 1997 253 291
20. K.R. Davidson, C*-Algebras by Example, Fields Institute Monographs, Vol. 6, American Mathematical Society, Providence, RI, 1996.
21. J. Desharnais, A. Edalat, and P. Panangaden Bisimulation for labelled Markov processes Inform. Comput. 179 2002 163 193
22. J. Desharnais, R. Jagadeesan, V. Gupta, P. Panangaden, Metrics for labeled Markov systems, in: Proc. 10th Int. Conf. on Concurrency Theory, Lecture Notes in Computer Science, Vol. 1664, Springer, Berlin, 1999, pp. 258-273.
23. J. Desharnais, R. Jagadeesan, V. Gupta, P. Panangaden, The metric analogue of weak bisimulation for probabilistic processes, in: Proc. LICS'02, IEEE, Copenhagen, Denmark, 22-25 July 2002, pp. 413-422.
24. F. Deutsch, Bet approximation in inner product spaces, CMS Books in Mathematics, Vol. 7, Springer, New York, Berlin, 2001.
25. R. Diestel, Graph theory, Graduate Texts in Mathematics, Vol. 173, Springer, New York, Heidelberg, Berlin, 1997.
26. E.A. Feinberg, A. Shwartz (Eds.), Handbook of Markov Decision Processes, Kluwer, Dordrecht, 2002.
27. P.A. Fillmore A User's Guide to Operator Algebras 1996 Wiley New York, Chichester
28. R.J. van Glabbeek, The Linear Time - Branching Time Spectrum I. The Semantics of Concrete, Sequential Processes, Elsevier Science, Amsterdam, 2001, pp. 3-99 (Chapter 1).
29. R.J. van Glabbeek, S.A. Smolka, and B. Steffen Reactive, generative and stratified models of probabilistic processes Inform. Comput. 121 1995 59 80
30. C. Godsil, G. Royle, Algebraic graph theory, Graduate Texts in Mathematics, Vol. 207, Springer, New York, Heidelberg, Berlin, 2001.
31. J. Goguen, J. Meseguer, Security policies and security models, in: IEEE Symp. on Security and Privacy, IEEE Computer Society Press, Rockville, MD, 1982, pp. 11-20.
32. J.W. Gray III Towards a mathematical foundation for information flow security Proc.1991 Symp. on Research in Security and Privacy, IEEE Oakland, CA May 1991 21 34
33. W.H. Greub, Linear Algebra, third ed., Grundlehren der mathematischen Wissenschaften, Vol. 97, Springer, Berlin, New York, 1967.
34. G.R. Grimmett, and D.R. Stirzaker Probability and Random Processes second ed. 1992 Clarendon Press Oxford
35. C.M. Grinstead, and J.L. Snell Introduction to Probability second revised ed. 1997 American Mathematical Society Providence, RI
36. H. Hansson, Time and probability in formal design of distributed systems, Ph.D. Thesis, Uppsala University, 1994.
37. M.C.B. Hennessy Algebraic Theory of Processes 1988 MIT Press Cambridge, MA
38. B. Jonsson, and W. Yi Compositional testing preorders for probabilistic processes Proc. LICS'95 1995 431 443
39. B. Jonsson, W. Yi, K.G. Larsen, Probabilistic Extensions of Process Algebras, Elsevier Science, Amsterdam, 2001, pp. 685-710 (Chapter 11).
40. R.V. Kadison, J.R. Ringrose, Fundamentals of the theory of operator algebras: Vol. I - elementary theory, Graduate Studies in Mathematics, Vol. 15, American Mathematical Society, Providence, RI, 1997 (reprint from Academic Press edition 1983).
41. J.G. Kemeny, and J.L. Snell Finite Markov Chains 1960 D. Van Nostrand Company Princeton, NJ
42. M. Kwiatkowska, G. Norman, D. Parker, PRISM: Probabilistic Symbolic Model Checker, in: TOOLS 2002, Lecture Notes in Computer Science, Vol. 2324, Springer, Berlin, 2002, pp. 200-204.
43. B.W. Lampson A note on the confinement problem Comm. ACM 16 10 1973 613 615
44. K.G. Larsen, and A. Skou Bisimulation through probabilistic testing Inform. Comput. 94 1991 1 28
45. R. Milner, A Calculus of Communicating Systems, Lecture Notes in Computer Science, Vol. 92, Springer, Berlin, New York, 1980.
46. B. Mohar, and W. Woess A survey on spectra of infinite graphs Bull. London Math. Soc. 21 1988 209 234
47. G.J. Murphy C * -Algebras and Operator Theory 1990 Academic Press San Diego
48. R. De Nicola, and M.C.B. Hennessy Testing equivalences for processes Theoret. Comput. Sci. 34 1983 83 133
49. F. Nielson, H. Riis Nielson, and C. Hankin Principles of Program Analysis 1999 Springer Berlin, Heidelberg
50. A. Philippou, I. Lee, O. Sokolsky, Weak bisimulation for probabilistic processes, in: Proc. CONCUR 2000, Lecture Notes in Computer Science, Vol. 1887, Springer, Berlin, 2000, pp. 334-349.
51. A. Di Pierro, C. Hankin, H. Wiklicky, Probabilistic confinement in a declarative framework, in: Declarative Programming - Selected Papers from AGP 2000, La Havana, Cuba, Electronic Notes in Theoretical Computer Science, Vol. 48, Elsevier, Amsterdam, 2001, pp. 1-23.
52. A. Di Pierro, C. Hankin, and H. Wiklicky Approximate non-interference Proc. CSFW'02 IEEE, Cape Breton, Canada 24-26 June 2002 3 17
53. A. Di Pierro, C. Hankin, H. Wiklicky, Approximate confinement under uniform attacks, in: Proc. SAS'02, Lecture Notes in Computer Science, Vol. 2477, Springer, Berlin, 2002, pp. 310-325.
54. A. Di Pierro, C. Hankin, H. Wiklicky, Quantitative relations and approximate process equivalences, in: R. Amadio, D. Lugiez (Eds.), Proc. CONCUR 2003, 14th Int. Conf. on Concurrency Theory, Lecture Notes in Computer Science, Vol. 2761, Springer, Berlin, 2003, pp. 508-522.
55. A. Di Pierro, C. Hankin, and H. Wiklicky Approximate non-interference J. Comput. Security 12 1 2004 37 81
56. A. Di Pierro, and H. Wiklicky Concurrent constraint programming towards probabilistic abstract interpretation Proc. PPDP'00 ACM, Montréal, Canada 2000 127 138
57. A. Di Pierro, H. Wiklicky, Measuring the precision of abstract interpretations, in: Proc. LOPSTR'00, Lecture Notes in Computer Science, Vol. 2042, Springer, Berlin, 2001, pp. 147-164.
58. P.Y.A. Ryan, J. McLean, J. Millen, V. Gilgor, Non-interference who needs it? in: Proc. 14th IEEE Computer Security Foundations Workshop, IEEE, Cape Breton, Nova Scotia, Canada, June 2001, pp. 237-238.
59. P.Y.A. Ryan, and S.A. Schneider Process algebra and non-interference J. Comput. Security 9 1,2 2001 75 103 (special issue on CSFW-12)
60. D.A. Schmidt, Binary relations for abstraction and refinement, in: Workshop on Refinement and Abstraction, Amagasaki, Japan, November 1999.
61. R. Segala, N. Lynch, Probabilistic simulations for probabilistic processes, in: Proc. CONCUR 94, Lecture Notes in Computer Science, Vol. 836, Springer, Berlin, 1994, pp. 481-496.
62. J. Shao Mathematical Statistics, Springer Texts in Statistics 1999 Springer New York, Berlin, Heidelberg
63. G. Smith, Probabilistic noninterference through weak probabilistic bi-simulation, in: Proc. 16th Computer Security Foundations Workshop (CSFW'03), IEEE, 2003, pp. 3-13.
64. E.D. Sontag, Mathematical Control Theory: Deterministic Finite Dimensional Systems, Texts in Applied Mathematics, Vol. 6, Springer, New York, Heidelberg, Berlin, 1990.
65. M. Vardi, Automatic verification of probabilistic concurrent finite-state programs, in: Proc. FOCS'85, 1985, pp. 332-344.
66. E.P. de Vink, and J.J.M.M. Rutten Bisimulation for probabilistic transition systems: a coalgebraic approach Theoret. Comput. Sci. 221 1999 271 293
67. J. Whittaker Graphical Models in Applied Multivariate Statistics 1990 Wiley Chicester, New York
68. W. Woess, Random walks on infinite graphs and groups, Cambridge Tracts in Mathematics, Vol. 138, Cambridge University Press, Cambridge, 2000.
69. K. Yosida Functional Analysis 1980 Springer Berlin, Heidelberg, New York