ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Model-checking bisimulation-based information flow properties for infinite state sstems

D’Souza, Deepak and Raghavendra, KR (2012) Model-checking bisimulation-based information flow properties for infinite state sstems. In: Proceedings of 17th European Symposium on Research in Computer Security, September 10-12, 2012, Pisa, Italy.

[img] PDF
Rese_Comp_Secu_7459_591_2012.pdf - Published Version
Restricted to Registered users only

Download (449kB) | Request a copy
Official URL: http://dx.doi.org/10.1007/978-3-642-33167-1_34


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.

Item Type: Conference Paper
Publisher: Springer Berlin Heidelberg
Additional Information: Copyright of this article belongs to Springer Berlin Heidelberg.
Keywords: Model-Checking; Pushdown System; Petri Net; Process Algebra; Bisimulation; Information Flow
Department/Centre: Division of Electrical Sciences > Computer Science & Automation
Date Deposited: 05 Nov 2013 07:38
Last Modified: 05 Nov 2013 07:38
URI: http://eprints.iisc.ac.in/id/eprint/47706

Actions (login required)

View Item View Item