{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T16:49:48Z","timestamp":1742402988141},"publisher-location":"Berlin, Heidelberg","reference-count":52,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540442356"},{"type":"electronic","value":"9783540457893"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45789-5_27","type":"book-chapter","created":{"date-parts":[[2007,8,11]],"date-time":"2007-08-11T13:50:10Z","timestamp":1186840210000},"page":"376-394","source":"Crossref","is-referenced-by-count":35,"title":["Static Confidentiality Enforcement for Distributed Programs"],"prefix":"10.1007","author":[{"given":"Andrei","family":"Sabelfeld","sequence":"first","affiliation":[]},{"given":"Heiko","family":"Mantel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,9,5]]},"reference":[{"issue":"5","key":"27_CR1","doi-asserted-by":"crossref","first-page":"749","DOI":"10.1145\/324133.324266","volume":"46","author":"M. Abadi","year":"1999","unstructured":"M. Abadi. Secrecy by typing in security protocols. Journal of the ACM, 46(5):749\u2013786, September 1999.","journal-title":"Journal of the ACM"},{"key":"27_CR2","doi-asserted-by":"crossref","unstructured":"M. Abadi, A. Banerjee, N. Heintze, and J. Riecke. A core calculus of dependency. In Proc. of Symposium on Principles of Programming Languages, January 1999.","DOI":"10.1145\/292540.292555"},{"key":"27_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/3-540-45315-6_2","volume-title":"FOSSACS\u201901","author":"M. Abadi","year":"2001","unstructured":"M. Abadi and B. Blanchet. Secrecy types for asymmetric communication. In FOSSACS\u201901, LNCS 2030, pages 25\u201341, April 2001."},{"key":"27_CR4","doi-asserted-by":"crossref","unstructured":"M. Abadi and A. D. Gordon. A calculus for cryptographic protocols: The spi calculus. In Proc. of Conference on Computer and Communications Security, 1997.","DOI":"10.1145\/266420.266432"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"M. Abadi and P. Rogaway. Reconciling two views of cryptography (the computational soundness of formal encryption). Journal of Cryptology, 15(2), 2002.","DOI":"10.1007\/s00145-001-0014-7"},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"J. Agat. Transforming out timing leaks. In Proc. of Symposium on Principles of Programming Languages, pages 40\u201353, January 2000.","DOI":"10.1145\/325694.325702"},{"key":"27_CR7","unstructured":"J. Agat and D. Sands. On confidentiality and algorithms. In Proc. of IEEE Symposium on Security and Privacy, May 2001."},{"key":"27_CR8","unstructured":"G. R. Andrews. Foundations of Multithreaded, Parallel, and Distributed Programming. Addison Wesley, 2000."},{"key":"27_CR9","unstructured":"J. Armstrong, R. Virding, C. Wikstr\u00f6m, and M. Williams. Concurrent Programming in Erlang. Prentice-Hall, 2nd edition, 1996."},{"key":"27_CR10","unstructured":"J.-P. Ban\u00e2tre and C. Bryce. Information flow control in a parallel language framework. In Proc. of IEEE Computer Security Foundations Workshop, June 1993."},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"A. Banerjee and D. A. Naumann. Secure information flow and pointer confinement in a Java-like language. In Proc. of IEEE Computer Security Foundations Workshop, June 2002.","DOI":"10.1109\/CSFW.2002.1021820"},{"key":"27_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1007\/3-540-48224-5_32","volume-title":"ICALP\u201901","author":"G. Boudol","year":"2001","unstructured":"G. Boudol and I. Castellani. Noninterference for concurrent programs. In ICALP\u201901, LNCS 2076, pages 382\u2013395, July 2001."},{"issue":"5","key":"27_CR13","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1145\/1067625.806556","volume":"11","author":"E. S. Cohen","year":"1977","unstructured":"E. S. Cohen. Information transmission in computational systems. ACM SIGOPS Operating Systems Review, 11(5):133\u2013139, 1977.","journal-title":"ACM SIGOPS Operating Systems Review"},{"key":"27_CR14","unstructured":"E. S. Cohen. Information transmission in sequential programs. In R. A. DeMillo, D. P. Dobkin, A. K. Jones, and R. J. Lipton, editors, Foundations of Secure Computation, pages 297\u2013335. Academic Press, 1978."},{"key":"27_CR15","doi-asserted-by":"crossref","unstructured":"D. E. Denning. A lattice model of secure information flow. Communications of the ACM, 19(5):236\u2013243, May 1976.","DOI":"10.1145\/360051.360056"},{"key":"27_CR16","unstructured":"D. E. Denning. Cryptography and Data Security. Addison-Wesley, 1982."},{"issue":"7","key":"27_CR17","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1145\/359636.359712","volume":"20","author":"D. E. Denning","year":"1977","unstructured":"D. E. Denning and P. J. Denning. Certification of programs for secure information flow. Communications of the ACM, 20(7):504\u2013513, July 1977.","journal-title":"Communications of the ACM"},{"issue":"1","key":"27_CR18","doi-asserted-by":"crossref","first-page":"5","DOI":"10.3233\/JCS-1994\/1995-3103","volume":"3","author":"R. Focardi","year":"1995","unstructured":"R. Focardi and R. Gorrieri. A classification of security properties for process algebras. Journal of Computer Security, 3(1):5\u201333, 1995.","journal-title":"Journal of Computer Security"},{"key":"27_CR19","doi-asserted-by":"crossref","unstructured":"R. Focardi, R. Gorrieri, and F. Martinelli. Information flow analysis in a discrete-time process algebra. In Proc. of IEEE Computer Security Foundations Workshop, pages 170\u2013184, July 3\u20135 2000.","DOI":"10.1109\/CSFW.2000.856935"},{"key":"27_CR20","doi-asserted-by":"crossref","unstructured":"J. A. Goguen and J. Meseguer. Security policies and security models. In Proc. of IEEE Symposium on Security and Privacy. April 1982.","DOI":"10.1109\/SP.1982.10014"},{"key":"27_CR21","unstructured":"J. Gosling, B. Joy, and G. Steele. The Java Language Specification. Addison-Wesley, 1996."},{"key":"27_CR22","doi-asserted-by":"crossref","unstructured":"N. Heintze and J. G. Riecke. The SLam calculus: programming with secrecy and integrity. In Proc. of Symposium on Principles of Programming Languages, 1998.","DOI":"10.1145\/268946.268976"},{"key":"27_CR23","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1007\/3-540-45022-X_35","volume-title":"ICALP\u201900","author":"M. Hennessy","year":"2000","unstructured":"M. Hennessy and J. Riely. Information flow vs resource access in the asynchronous pi-calculus (extended abstract). In ICALP\u201900, LNCS 1853, pages 415\u2013427, 2000."},{"key":"27_CR24","unstructured":"C. Hoare. Communicating Sequential Processes (CSP). Prentice Hall, 1985."},{"key":"27_CR25","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1007\/3-540-46425-5_12","volume-title":"Proc. of European Symposium on Programming","author":"K. Honda","year":"2000","unstructured":"K. Honda, V. Vasconcelos, and N. Yoshida. Secure information flow as typed process behaviour. In Proc. of European Symposium on Programming, LNCS 1782, pages 180\u2013199, 2000."},{"key":"27_CR26","doi-asserted-by":"crossref","unstructured":"K. Honda and N. Yoshida. A uniform type structure for secure information flow. In Proc. of Symposium on Principles of Programming Languages, January 2002.","DOI":"10.1145\/503272.503281"},{"issue":"10","key":"27_CR27","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1145\/362375.362389","volume":"16","author":"B. W. Lampson","year":"1973","unstructured":"B. W. Lampson. A note on the confinement problem. Commun. ACM, 16(10):613\u2013615, Oct. 1973.","journal-title":"Commun. ACM"},{"key":"27_CR28","series-title":"Lect Notes Comput Sci","volume-title":"Proc. of European Symposium on Programming","author":"P. Laud","year":"2001","unstructured":"P. Laud. Semantics and program analysis of computationally secure information flow. In Proc. of European Symposium on Programming, LNCS 2028, April 2001."},{"issue":"1\u20133","key":"27_CR29","first-page":"113","volume":"37","author":"K. R. M. Leino","year":"2000","unstructured":"K. R. M. Leino and R. Joshi. A semantic approach to secure information flow. Science of Computer Programming, 37(1\u20133):113\u2013138, 2000.","journal-title":"Science of Computer Programming"},{"key":"27_CR30","doi-asserted-by":"crossref","unstructured":"H. Mantel. Possibilistic definitions of security-an assembly kit-. In Proc. of IEEE Computer Security Foundations Workshop, pages 185\u2013199, July 2000.","DOI":"10.1109\/CSFW.2000.856936"},{"key":"27_CR31","doi-asserted-by":"crossref","unstructured":"H. Mantel. On the composition of secure systems. In Proc. of IEEE Symposium on Security and Privacy, May 2002.","DOI":"10.1109\/SECPRI.2002.1004364"},{"key":"27_CR32","doi-asserted-by":"crossref","unstructured":"H. Mantel and A. Sabelfeld. A generic approach to the security of multi-threaded programs. In Proc. of IEEE Computer Security Foundations Workshop, June 2001.","DOI":"10.1109\/CSFW.2001.930142"},{"key":"27_CR33","unstructured":"H. Mantel and A. Sabelfeld. A unifying approach to the security of distributed and multi-threaded programs. Journal of Computer Security, 2002. To appear."},{"key":"27_CR34","doi-asserted-by":"crossref","unstructured":"D. McCullough. Specifications for multi-level security and hook-up property. In Proc. of IEEE Symposium on Security and Privacy, pages 161\u2013166. May 1987.","DOI":"10.1109\/SP.1987.10009"},{"key":"27_CR35","doi-asserted-by":"crossref","unstructured":"J. McLean. The specification and modeling of computer security. Computer, 23(1), January 1990.","DOI":"10.1109\/2.48795"},{"key":"27_CR36","doi-asserted-by":"crossref","unstructured":"J. McLean. A general theory of composition for trace sets closed under selective interleaving functions. In Proc. of IEEE Symposium on Security and Privacy, 1994.","DOI":"10.1109\/RISP.1994.296590"},{"key":"27_CR37","unstructured":"R. Milner. Communication and Concurrency. Prentice Hall, 1989."},{"key":"27_CR38","unstructured":"M. Mizuno and A. Oldehoeft. Information flow control in a distributed object-oriented system with statically-bound object variables. In Proc. of National Computer Security Conference, pages 56\u201367, 1987."},{"key":"27_CR39","doi-asserted-by":"crossref","unstructured":"B. Pfitzmann and M. Waidner. A model for asynchronous reactive systems and its application to secure message transmission. In Proc. of IEEE Symposium on Security and Privacy, pages 184\u2013200, 2001.","DOI":"10.1109\/SECPRI.2001.924298"},{"key":"27_CR40","doi-asserted-by":"crossref","unstructured":"A. D. Pierro, C. Hankin, and H. Wiklicky. Approximate non-interference. In Proc. of IEEE Computer Security Foundations Workshop, June 2002.","DOI":"10.1109\/CSFW.2002.1021803"},{"key":"27_CR41","unstructured":"R. P. Reitman. Information flow in parallel programs: an axiomatic approach. PhD thesis, Cornell University, 1978."},{"key":"27_CR42","unstructured":"P. Ryan, S. Schneider, M. Goldsmith, G. Lowe, and B. Roscoe. The Modelling and Analysis of Security Protocols: the CSP Approach. Addison-Wesley, 2001."},{"key":"27_CR43","series-title":"Lect Notes Comput Sci","first-page":"227","volume-title":"Proc. of International Conference on Perspectives of System Informatics","author":"A. Sabelfeld","year":"2001","unstructured":"A. Sabelfeld. The impact of synchronisation on secure information flow in concurrent programs. In Proc. of International Conference on Perspectives of System Informatics, LNCS 2244, pages 227\u2013241, July 2001."},{"key":"27_CR44","doi-asserted-by":"crossref","unstructured":"A. Sabelfeld and D. Sands. Probabilistic noninterference for multi-threaded programs. In Proc. of IEEE Computer Security Foundations Workshop, July 2000.","DOI":"10.1109\/CSFW.2000.856937"},{"issue":"1","key":"27_CR45","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1023\/A:1011553200337","volume":"14","author":"A. Sabelfeld","year":"2001","unstructured":"A. Sabelfeld and D. Sands. A per model of secure information flow in sequential programs. Higher-Order and Symbolic Computation, 14(1):59\u201391, 2001.","journal-title":"Higher-Order and Symbolic Computation"},{"key":"27_CR46","doi-asserted-by":"crossref","unstructured":"G. Smith. A new type system for secure information flow. In Proc. of IEEE Computer Security Foundations Workshop, pages 115\u2013125, June 2001.","DOI":"10.1109\/CSFW.2001.930141"},{"key":"27_CR47","doi-asserted-by":"crossref","unstructured":"G. Smith and D. Volpano. Secure information flow in a multi-threaded imperative language. In Proc. of Symposium on Principles of Programming Languages, 1998.","DOI":"10.1145\/268946.268975"},{"key":"27_CR48","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/3-540-48294-6_20","volume-title":"Proc. of Symposium on Static Analysis","author":"D. Volpano","year":"1999","unstructured":"D. Volpano. Safety versus secrecy. In Proc. of Symposium on Static Analysis, LNCS 1694, pages 303\u2013311, September 1999."},{"issue":"2,3","key":"27_CR49","doi-asserted-by":"crossref","first-page":"231","DOI":"10.3233\/JCS-1999-72-305","volume":"7","author":"D. Volpano","year":"1999","unstructured":"D. Volpano and G. Smith. Probabilistic noninterference in a concurrent language. Journal of Computer Security, 7(2,3):231\u2013253, November 1999.","journal-title":"Journal of Computer Security"},{"issue":"3","key":"27_CR50","doi-asserted-by":"crossref","first-page":"167","DOI":"10.3233\/JCS-1996-42-304","volume":"4","author":"D. Volpano","year":"1996","unstructured":"D. Volpano, G. Smith, and C. Irvine. A sound type system for secure flow analysis. Journal of Computer Security, 4(3):167\u2013187, 1996.","journal-title":"Journal of Computer Security"},{"key":"27_CR51","doi-asserted-by":"crossref","unstructured":"S. Zdancewic and A. C. Myers. Secure information flow via linear continuations. Higher Order and Symbolic Computation, 2002. To appear.","DOI":"10.1023\/A:1020843229247"},{"key":"27_CR52","doi-asserted-by":"crossref","unstructured":"S. Zdancewic, L. Zheng, N. Nystrom, and A. C. Myers. Untrusted hosts and confidentiality: Secure program partitioning. In Proc. of ACM Symposium on Operating System Principles, October 2001.","DOI":"10.1145\/502034.502036"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45789-5_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T23:24:12Z","timestamp":1556753052000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45789-5_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540442356","9783540457893"],"references-count":52,"URL":"https:\/\/doi.org\/10.1007\/3-540-45789-5_27","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}