{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T12:44:29Z","timestamp":1742993069288,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642331664"},{"type":"electronic","value":"9783642331671"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33167-1_34","type":"book-chapter","created":{"date-parts":[[2012,8,18]],"date-time":"2012-08-18T10:07:05Z","timestamp":1345284425000},"page":"591-608","source":"Crossref","is-referenced-by-count":2,"title":["Model-Checking Bisimulation-Based Information Flow Properties for Infinite State Systems"],"prefix":"10.1007","author":[{"given":"Deepak","family":"D\u2019Souza","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K. R.","family":"Raghavendra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"34_CR1","doi-asserted-by":"crossref","first-page":"5","DOI":"10.3233\/JCS-1994\/1995-3103","volume":"3","author":"R. Focardi","year":"1995","unstructured":"Focardi, R., Gorrieri, R.: A classification of security properties for process algebras. Journal of Computer Security\u00a03(1), 5\u201333 (1995)","journal-title":"Journal of Computer Security"},{"key":"34_CR2","doi-asserted-by":"crossref","unstructured":"Goguen, J.A., Meseguer, J.: Security policies and security models. In: Proceedings of IEEE Symposium on Security and Privacy, pp. 11\u201320 (April 1982)","DOI":"10.1109\/SP.1982.10014"},{"issue":"9","key":"34_CR3","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1109\/32.629493","volume":"23","author":"R. Focardi","year":"1997","unstructured":"Focardi, R., Gorrieri, R.: The compositional security checker: A tool for the verification of information flow security properties. Software Engineering\u00a023(9), 550\u2013571 (1997)","journal-title":"Software Engineering"},{"key":"34_CR4","doi-asserted-by":"crossref","unstructured":"Bossi, A., Focardi, R., Piazza, C., Rossi, S.: A proof system for information flow security. In: Logic Based Program Synthesis and Transformation, pp. 956\u2013956 (2003)","DOI":"10.1007\/3-540-45013-0_16"},{"key":"#cr-split#-34_CR5.1","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1016\/j.entcs.2005.06.005"},{"key":"#cr-split#-34_CR5.2","doi-asserted-by":"crossref","unstructured":"Electronic Notes in Theoretical Computer Science 135(1), 39-58 (2005)","DOI":"10.1016\/j.entcs.2005.06.005"},{"issue":"1","key":"34_CR6","doi-asserted-by":"crossref","first-page":"101","DOI":"10.3233\/JCS-2010-0400","volume":"19","author":"D. D\u2019Souza","year":"2011","unstructured":"D\u2019Souza, D., Holla, R., Raghavendra, K.R., Sprick, B.: Model-checking trace-based information flow properties. Journal of Computer Security\u00a019(1), 101\u2013138 (2011)","journal-title":"Journal of Computer Security"},{"key":"34_CR7","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1142\/9789812562494_0054","volume":"2","author":"J. Srba","year":"2004","unstructured":"Srba, J.: Roadmap of infinite results. Current Trends In Theoretical Computer Science, The Challenge of the New Century\u00a02, 337\u2013350 (2004)","journal-title":"Current Trends In Theoretical Computer Science, The Challenge of the New Century"},{"key":"34_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1007\/3-540-45694-5_38","volume-title":"CONCUR 2002 - Concurrency Theory","author":"J. Srba","year":"2002","unstructured":"Srba, J.: Undecidability of Weak Bisimilarity for Pushdown Processes. In: Brim, L., Jan\u010dar, P., K\u0159et\u00ednsk\u00fd, M., Ku\u010dera, A. (eds.) CONCUR 2002. LNCS, vol.\u00a02421, pp. 579\u2013593. Springer, Heidelberg (2002)"},{"key":"34_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/3-540-57785-8_173","volume-title":"STACS 94","author":"P. Jancar","year":"1994","unstructured":"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.\u00a0775, pp. 581\u2013592. Springer, Heidelberg (1994)"},{"key":"34_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/3-540-45005-X_17","volume-title":"Developments in Language Theory","author":"J. Srba","year":"2003","unstructured":"Srba, J.: Undecidability of Weak Bisimilarity for PA-Processes. In: Ito, M., Toyama, M. (eds.) DLT 2002. LNCS, vol.\u00a02450, pp. 197\u2013209. Springer, Heidelberg (2003)"},{"key":"34_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/11874683_24","volume-title":"Computer Science Logic","author":"W.T. Harwood","year":"2006","unstructured":"Harwood, W.T., Moller, F., Setzer, A.: Weak Bisimulation Approximants. In: \u00c9sik, Z. (ed.) CSL 2006. LNCS, vol.\u00a04207, pp. 365\u2013379. Springer, Heidelberg (2006)"},{"key":"34_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-60218-6_1","volume-title":"CONCUR \u201995 Concurrency Theory","author":"C. Stirling","year":"1995","unstructured":"Stirling, C.: Local Model Checking Games (Extended Abstract). In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol.\u00a0962, pp. 1\u201311. Springer, Heidelberg (1995)"},{"key":"34_CR13","doi-asserted-by":"crossref","unstructured":"D\u2019Souza, 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)","DOI":"10.1007\/978-3-642-33167-1_34"},{"key":"34_CR14","unstructured":"Focardi, R., Rossi, S.: Information flow security in dynamic contexts. In: Proc. of the IEEE Computer Security Foundations Workshop (CSFW 2002), Citeseer, pp. 307\u2013319 (2002)"},{"key":"34_CR15","volume-title":"Computation: finite and infinite machines","author":"M.L. Minsky","year":"1967","unstructured":"Minsky, M.L.: Computation: finite and infinite machines. Prentice-Hall, Inc., Upper Saddle River (1967)"},{"issue":"4","key":"34_CR16","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1090\/S0002-9904-1946-08555-9","volume":"52","author":"E. Post","year":"1946","unstructured":"Post, E.: A variant of a recursively unsolvable problem. Bulletin of the American Mathematical Society\u00a052(4), 264\u2013268 (1946)","journal-title":"Bulletin of the American Mathematical Society"},{"key":"34_CR17","doi-asserted-by":"crossref","unstructured":"Stirling, C.: Decidability of bisimulation equivalence for pushdown processes. Technical report (2000)","DOI":"10.1145\/333623.333624"},{"key":"34_CR18","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/S1571-0661(05)80674-7","volume":"5","author":"Y. Hirshfeld","year":"1997","unstructured":"Hirshfeld, Y.: Bisimulation trees and the decidability of weak bisimulations. Electronic Notes in Theoretical Computer Science\u00a05, 2\u201313 (1997)","journal-title":"Electronic Notes in Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Computer Security \u2013 ESORICS 2012"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33167-1_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,12]],"date-time":"2020-07-12T17:56:58Z","timestamp":1594576618000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33167-1_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642331664","9783642331671"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33167-1_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}