{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T21:45:13Z","timestamp":1743111913984,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642273742"},{"type":"electronic","value":"9783642273759"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","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-27375-9_9","type":"book-chapter","created":{"date-parts":[[2012,1,10]],"date-time":"2012-01-10T01:54:43Z","timestamp":1326160483000},"page":"148-165","source":"Crossref","is-referenced-by-count":7,"title":["Model-Checking Secure Information Flow for Multi-threaded Programs"],"prefix":"10.1007","author":[{"given":"Marieke","family":"Huisman","sequence":"first","affiliation":[]},{"given":"Henri-Charles","family":"Blondeel","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","volume-title":"Computer Security Foundation Workshop (CSFW 2017)","author":"G. Barthe","year":"2004","unstructured":"Barthe, G., D\u2019Argenio, P., Rezk, T.: Secure information flow by self-composition. In: Computer Security Foundation Workshop (CSFW 2017). IEEE Press, Los Alamitos (2004)"},{"key":"9_CR2","unstructured":"Blondeel, H.-C.: Security by logic: characterizing non-interference in temporal logic. Master\u2019s thesis, KTH Sweden (2007), \n                  \n                    ftp:\/\/ftp-sop.inria.fr\/everest\/Marieke.Huisman\/blondeel.pdf"},{"issue":"1-2","key":"9_CR3","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/S0304-3975(02)00010-5","volume":"281","author":"G. Boudol","year":"2002","unstructured":"Boudol, G., Castellani, I.: Noninterference for concurrent programs and thread systems. Theor. Comput. Sci.\u00a0281(1-2), 109\u2013130 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/978-3-540-74407-8_9","volume-title":"CONCUR 2007 \u2013 Concurrency Theory","author":"T. Chen","year":"2007","unstructured":"Chen, T., Ploeger, S.C.W., van de Pol, J.C., Willemse, T.A.C.: Equivalence checking for infinite systems using parameterized boolean equation systems. In: Caires, L., Vasconcelos, V.T. (eds.) CONCUR 2007. LNCS, vol.\u00a04703, pp. 120\u2013135. Springer, Heidelberg (2007)"},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1093\/logcom\/12.2.255","volume":"12","author":"M. Dam","year":"2002","unstructured":"Dam, M., Gurov, D.: mu-calculus with explicit points and approximations. Journal of Logic and Computation\u00a012, 43\u201357 (2002)","journal-title":"Journal of Logic and Computation"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-540-32004-3_20","volume-title":"Security in Pervasive Computing","author":"\u00c1. Darvas","year":"2005","unstructured":"Darvas, \u00c1., H\u00e4hnle, R., Sands, D.: A theorem proving approach to analysis of secure information flow. In: Hutter, D., Ullmann, M. (eds.) SPC 2005. LNCS, vol.\u00a03450, pp. 193\u2013209. Springer, Heidelberg (2005)"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-540-73368-3_18","volume-title":"Computer Aided Verification","author":"H. Garavel","year":"2007","unstructured":"Garavel, H., Lang, F., Mateescu, R., Serwe, W.: CADP 2006: A toolbox for the construction and analysis of distributed processes. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol.\u00a04590, pp. 158\u2013163. Springer, Heidelberg (2007)"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Goguen, J., Meseguer, J.: Security policies and security models. In: IEEE Symposium on Security and Privacy, pp. 11\u201320 (1982)","DOI":"10.1109\/SP.1982.10014"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-642-01465-9_12","volume-title":"Formal Aspects in Security and Trust","author":"J.F. Groote","year":"2009","unstructured":"Groote, J.F., Orzan, S.: Parameterised anonymity. In: Degano, P., Guttman, J.D., Martinelli, F. (eds.) FAST 2008. LNCS, vol.\u00a05491, pp. 177\u2013191. Springer, Heidelberg (2009)"},{"key":"9_CR10","unstructured":"Huisman, M., Ngo, M.T.: A new definition of confidentiality for multi-threaded programs (2010) (manuscript)"},{"key":"9_CR11","unstructured":"Huisman, M., Worah, P., Sunesen, K.: A temporal logic characterisation of observational determinism. In: Computer Security Foundations Workshop (2006)"},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0304-3975(82)90125-6","volume":"27","author":"D. Kozen","year":"1983","unstructured":"Kozen, D.: Results on the propositional \u03bc-calculus. Theoretical Computer Science\u00a027, 333\u2013354 (1983)","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"9_CR13","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1145\/1530873.1530882","volume":"36","author":"M. Kwiatkowska","year":"2009","unstructured":"Kwiatkowska, M., Norman, G., Parker, D.: PRISM: Probabilistic model checking for performance and reliability analysis. ACM SIGMETRICS Performance Evaluation Review\u00a036(4), 40\u201345 (2009)","journal-title":"ACM SIGMETRICS Performance Evaluation Review"},{"key":"9_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-10235-3","volume-title":"A Calculus of Communicating Systems","author":"R. Milner","year":"1980","unstructured":"Milner, R.: A Calculus of Communicating Systems. Springer, Heidelberg (1980)"},{"key":"9_CR15","unstructured":"Moller, F., Stevens, P.: Edinburgh Concurrency Workbench user manual (version 7.1), \n                  \n                    http:\/\/homepages.inf.ed.ac.uk\/perdita\/cwb\/"},{"key":"9_CR16","first-page":"114","volume-title":"Symposium on Security and Privacy","author":"A. Roscoe","year":"1995","unstructured":"Roscoe, A.: CSP and determinism in security modelling. In: Symposium on Security and Privacy, pp. 114\u2013127. IEEE Computer Society Press, Los Alamitos (1995)"},{"key":"9_CR17","first-page":"200","volume-title":"Computer Security Foundations Workshop","author":"A. Sabelfeld","year":"2000","unstructured":"Sabelfeld, A., Sands, D.: Probabilistic noninterference for multi-threaded programs. In: Computer Security Foundations Workshop, pp. 200\u2013215. IEEE Press, Los Alamitos (2000)"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Smith, G., Volpano, D.: Secure Information Flow in a Multi-threaded Imperative Language. In: Principles of Programming Languages, pp. 355\u2013364 (1998)","DOI":"10.1145\/268946.268975"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Smith, G., Volpano, D.: Confinement properties for multi-threaded programs. Electronic Notes in Theoretical Computer Science 20 (1999)","DOI":"10.1016\/S1571-0661(04)80071-9"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Terauchi, T.: A type system for observational determinism. In: Computer Security Foundation, CSF 2008 (2008)","DOI":"10.1109\/CSF.2008.9"},{"key":"9_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/11547662_24","volume-title":"Static Analysis","author":"T. Terauchi","year":"2005","unstructured":"Terauchi, T., Aiken, A.: Secure Information Flow as a Safety Problem. In: Hankin, C., Siveroni, I. (eds.) SAS 2005. LNCS, vol.\u00a03672, pp. 352\u2013367. Springer, Heidelberg (2005)"},{"key":"9_CR22","doi-asserted-by":"publisher","first-page":"231","DOI":"10.3233\/JCS-1999-72-305","volume":"7","author":"D. Volpano","year":"1999","unstructured":"Volpano, D., Smith, G.: Probabilistic noninterference in a concurrent language. Journal of Computer Security\u00a07, 231\u2013253 (1999)","journal-title":"Journal of Computer Security"},{"key":"9_CR23","unstructured":"Zdancewic, S., Myers, A.C.: Observational determinism for concurrent program security. In: 16th IEEE Computer Security Foundations Workshop (2003)"}],"container-title":["Lecture Notes in Computer Science","Theory of Security and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-27375-9_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T20:33:06Z","timestamp":1558297986000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-27375-9_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642273742","9783642273759"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-27375-9_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}