Abstract
Bisimulation-based information flow properties were introduced by Focardi and Gorrieri [1] as a way of specifying security properties for transition system models. These properties were shown to be decidable for finite-state systems. In this paper, we study the problem of verifying these properties for some well-known classes of infinite state systems. We show that all the properties are undecidable for each of these classes of systems.
Chapter PDF
Similar content being viewed by others
References
Focardi, R., Gorrieri, R.: A classification of security properties for process algebras. Journal of Computer Security 3(1), 5–33 (1995)
Goguen, J.A., Meseguer, J.: Security policies and security models. In: Proceedings of IEEE Symposium on Security and Privacy, pp. 11–20 (April 1982)
Focardi, R., Gorrieri, R.: The compositional security checker: A tool for the verification of information flow security properties. Software Engineering 23(9), 550–571 (1997)
Bossi, A., Focardi, R., Piazza, C., Rossi, S.: A proof system for information flow security. In: Logic Based Program Synthesis and Transformation, pp. 956–956 (2003)
D’Souza, D., Raghavendra, K.R., Sprick, B.: An automata based approach for verifying information flow properties. In: Proceedings of the Second Workshop on Automated Reasoning for Security Protocol Analysis (ARSPA) (2005); Electronic Notes in Theoretical Computer Science 135(1), 39–58 (2005)
D’Souza, D., Holla, R., Raghavendra, K.R., Sprick, B.: Model-checking trace-based information flow properties. Journal of Computer Security 19(1), 101–138 (2011)
Srba, J.: Roadmap of infinite results. Current Trends In Theoretical Computer Science, The Challenge of the New Century 2, 337–350 (2004)
Srba, J.: Undecidability of Weak Bisimilarity for Pushdown Processes. In: Brim, L., Jančar, P., Křetínský, M., Kučera, A. (eds.) CONCUR 2002. LNCS, vol. 2421, pp. 579–593. Springer, Heidelberg (2002)
Jancar, P.: Decidability Questions for Bismilarity of Petri Nets and Some Related Problems. In: Enjalbert, P., Mayr, E.W., Wagner, K.W. (eds.) STACS 1994. LNCS, vol. 775, pp. 581–592. Springer, Heidelberg (1994)
Srba, J.: Undecidability of Weak Bisimilarity for PA-Processes. In: Ito, M., Toyama, M. (eds.) DLT 2002. LNCS, vol. 2450, pp. 197–209. Springer, Heidelberg (2003)
Harwood, W.T., Moller, F., Setzer, A.: Weak Bisimulation Approximants. In: Ésik, Z. (ed.) CSL 2006. LNCS, vol. 4207, pp. 365–379. Springer, Heidelberg (2006)
Stirling, C.: Local Model Checking Games (Extended Abstract). In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol. 962, pp. 1–11. Springer, Heidelberg (1995)
D’Souza, D., Raghavendra, K.R.: Model-checking bisimulation-based information-flow properties for infinite state systems. Technical report, Department of Computer Science and Automation, Indian Institute of Science (2012)
Focardi, R., Rossi, S.: Information flow security in dynamic contexts. In: Proc. of the IEEE Computer Security Foundations Workshop (CSFW 2002), Citeseer, pp. 307–319 (2002)
Minsky, M.L.: Computation: finite and infinite machines. Prentice-Hall, Inc., Upper Saddle River (1967)
Post, E.: A variant of a recursively unsolvable problem. Bulletin of the American Mathematical Society 52(4), 264–268 (1946)
Stirling, C.: Decidability of bisimulation equivalence for pushdown processes. Technical report (2000)
Hirshfeld, Y.: Bisimulation trees and the decidability of weak bisimulations. Electronic Notes in Theoretical Computer Science 5, 2–13 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
D’Souza, D., Raghavendra, K.R. (2012). Model-Checking Bisimulation-Based Information Flow Properties for Infinite State Systems. In: Foresti, S., Yung, M., Martinelli, F. (eds) Computer Security – ESORICS 2012. ESORICS 2012. Lecture Notes in Computer Science, vol 7459. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33167-1_34
Download citation
DOI: https://doi.org/10.1007/978-3-642-33167-1_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33166-4
Online ISBN: 978-3-642-33167-1
eBook Packages: Computer ScienceComputer Science (R0)