HyperPCTL: A Temporal Logic for Probabilistic Hyperproperties

  • Erika Ábrahám
  • Borzoo BonakdarpourEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11024)


In this paper, we propose a new temporal logic for expressing and reasoning about probabilistic hyperproperties. Hyperproperties characterize the relation between different independent executions of a system. Probabilistic hyperproperties express quantitative dependencies between such executions. The standard temporal logics for probabilistic systems, i.e., PCTL and PCTL \(^*\) can refer only to a single path at a time and, hence, cannot express many probabilistic hyperproperties of interest. The logic proposed in this paper, HyperPCTL, adds explicit and simultaneous quantification over multiple traces to PCTL. Such quantification allows expressing probabilistic hyperproperties. A model checking algorithm for the proposed logic is also introduced for discrete-time Markov chains.


  1. 1.
    Alpern, B., Schneider, F.B.: Defining liveness. Inf. Process. Lett. 21, 181–185 (1985)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Balliu, M., Dam, M., Le Guernic, G.: Epistemic temporal logic for information flow security. In: Proceedings of the 2011 Workshop on Programming Languages and Analysis for Security (PLAS), p. 6 (2011)Google Scholar
  3. 3.
    Clarke, E.M., Emerson, E.A.: Design and synthesis of synchronization skeletons using branching time temporal logic. In: Kozen, D. (ed.) Logic of Programs 1981. LNCS, vol. 131, pp. 52–71. Springer, Heidelberg (1982). Scholar
  4. 4.
    Clarkson, M.R., Finkbeiner, B., Koleini, M., Micinski, K.K., Rabe, M.N., Sánchez, C.: Temporal logics for hyperproperties. In: Abadi, M., Kremer, S. (eds.) POST 2014. LNCS, vol. 8414, pp. 265–284. Springer, Heidelberg (2014). Scholar
  5. 5.
    Clarkson, M.R., Schneider, F.B.: Hyperproperties. J. Comput. Secur. 18(6), 1157–1210 (2010)CrossRefGoogle Scholar
  6. 6.
    Dwork, C., Roth, A.: The algorithmic foundations of differential privacy. Found. Trends Theor. Comput. Sci. 9(3–4), 211–407 (2014)MathSciNetzbMATHGoogle Scholar
  7. 7.
    Fagin, R., Halpern, J.Y., Moses, Y., Vardi, M.: Reasoning About Knowledge. The MIT Press, Cambridge (1995)zbMATHGoogle Scholar
  8. 8.
    Fetzer, J.H. (ed.): Probability and Causality. Synthesis Library. Springer, Dordrecht (1988). Scholar
  9. 9.
    Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)zbMATHGoogle Scholar
  10. 10.
    Goguen, J.A., Meseguer, J.: Security policies and security models. In: IEEE Symposium on Security and Privacy, pp. 11–20 (1982)Google Scholar
  11. 11.
    Halpern, J.Y., Tuttle, M.R.: Knowledge, probability, and adversaries. In: Proceedings of the Eighth ACM Symposium on Principles of Distributed Computing (PODC), pp. 103–118 (1989)Google Scholar
  12. 12.
    Hansson, H., Jonsson, B.: A logic for reasoning about time and reliability. Formal Aspects Comput. 6(5), 512–535 (1994)CrossRefGoogle Scholar
  13. 13.
    Gray III, J.W.: Probabilistic interference. In: Proceedings of the 1990 IEEE Symposium on Security and Privacy (S&P), pp. 170–179 (1990)Google Scholar
  14. 14.
    Gray III, J.W.: Toward a mathematical foundation for information flow security. J. Comput. Secur. 1(3–4), 255–294 (1992)MathSciNetCrossRefGoogle Scholar
  15. 15.
    Gray III, J.W., Syverson, P.F.: A logical approach to multilevel security of probabilistic systems. Distrib. Comput. 11(2), 73–90 (1998)CrossRefGoogle Scholar
  16. 16.
    Lamport, L.: Proving the correctness of multiprocess programs. IEEE Trans. Softw. Eng. 3(2) (1977)Google Scholar
  17. 17.
    Pnueli, A.: The temporal logic of programs. In: Symposium on Foundations of Computer Science (FOCS), pp. 46–57 (1977)Google Scholar
  18. 18.
    Reichenbach, H.: The Direction of Time (1956)Google Scholar
  19. 19.
    Sabelfeld, A., Sands, D.: Probabilistic noninterference for multi-threaded programs. In: Proceedings of the 13th IEEE Computer Security Foundations Workshop (CSFW), pp. 200–214 (2000)Google Scholar
  20. 20.
    Skyrms, B.: Causal Necessity. Yale University Press, New Haven and London (1980)Google Scholar
  21. 21.
    Smith, G.: Probabilistic noninterference through weak probabilistic bisimulation. In: Proceedings of the 16th IEEE Computer Security Foundations Workshop (CSF), pp. 3–13 (2003)Google Scholar
  22. 22.
    Zdancewic, S., Myers, A.C.: Observational determinism for concurrent program security. In: Proceedings of the 16th IEEE Computer Security Foundations Workshop (CSFW), p. 29 (2003)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  1. 1.RWTH Aachen UniversityAachenGermany
  2. 2.Iowa State UniversityAmesUSA

Personalised recommendations