{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:42:06Z","timestamp":1743136926548,"version":"3.40.3"},"publisher-location":"Cham","reference-count":71,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030171377"},{"type":"electronic","value":"9783030171384"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-17138-4_1","type":"book-chapter","created":{"date-parts":[[2019,4,2]],"date-time":"2019-04-02T14:04:43Z","timestamp":1554213883000},"page":"1-28","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Foundations for Parallel Information Flow Control Runtime Systems"],"prefix":"10.1007","author":[{"given":"Marco","family":"Vassena","sequence":"first","affiliation":[]},{"given":"Gary","family":"Soeller","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Amidon","sequence":"additional","affiliation":[]},{"given":"Matthew","family":"Chan","sequence":"additional","affiliation":[]},{"given":"John","family":"Renner","sequence":"additional","affiliation":[]},{"given":"Deian","family":"Stefan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,4,3]]},"reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/978-3-540-88313-5_22","volume-title":"Computer Security - ESORICS 2008","author":"A Askarov","year":"2008","unstructured":"Askarov, A., Hunt, S., Sabelfeld, A., Sands, D.: Termination-insensitive noninterference leaks more than just a bit. In: Jajodia, S., Lopez, J. (eds.) ESORICS 2008. LNCS, vol. 5283, pp. 333\u2013348. Springer, Heidelberg (2008). \n                    https:\/\/doi.org\/10.1007\/978-3-540-88313-5_22"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Askarov, A., Zhang, D., Myers, A.C.: Predictive black-box mitigation of timing channels. In: Proceedings of the 17th ACM Conference on Computer and Communications Security, pp. 297\u2013307. ACM (2010)","DOI":"10.1145\/1866307.1866341"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Auerbach, J., et al.: Tax-and-spend: democratic scheduling for real-time garbage collection. In: Proceedings of the 8th ACM International Conference on Embedded Software, pp. 245\u2013254. ACM (2008)","DOI":"10.1145\/1450058.1450092"},{"issue":"5","key":"1_CR4","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1145\/2160718.2160742","volume":"55","author":"A Aviram","year":"2012","unstructured":"Aviram, A., Weng, S.-C., Hu, S., Ford, B.: Efficient system-enforced deterministic parallelism. Commun. ACM 55(5), 111\u2013119 (2012)","journal-title":"Commun. ACM"},{"issue":"4","key":"1_CR5","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1145\/359460.359470","volume":"21","author":"HG Baker Jr","year":"1978","unstructured":"Baker Jr., H.G.: List processing in real time on a serial computer. Commun. ACM 21(4), 280\u2013294 (1978)","journal-title":"Commun. ACM"},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1145\/301631.301648","volume":"34","author":"GE Blelloch","year":"1999","unstructured":"Blelloch, G.E., Cheng, P.: On bounding time and space for multiprocessor garbage collection. ACM SIGPLAN Not. 34, 104\u2013117 (1999)","journal-title":"ACM SIGPLAN Not."},{"key":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/978-3-642-41488-6_8","volume-title":"Secure IT Systems","author":"P Buiras","year":"2013","unstructured":"Buiras, P., Russo, A.: Lazy programs leak secrets. In: Riis Nielson, H., Gollmann, D. (eds.) NordSec 2013. LNCS, vol. 8208, pp. 116\u2013122. Springer, Heidelberg (2013). \n                    https:\/\/doi.org\/10.1007\/978-3-642-41488-6_8"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Buiras, P., Vytiniotis, D., Russo, A.: HLIO: mixing static and dynamic typing for information-flow control in Haskell. In: ACM SIGPLAN International Conference on Functional Programming. ACM (2015)","DOI":"10.1145\/2784731.2784758"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/978-3-662-54577-5_11","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A Das","year":"2017","unstructured":"Das, A., Hoffmann, J.: ML for ML: learning cost semantics by experiment. In: Legay, A., Margaria, T. (eds.) TACAS 2017. LNCS, vol. 10205, pp. 190\u2013207. Springer, Heidelberg (2017). \n                    https:\/\/doi.org\/10.1007\/978-3-662-54577-5_11"},{"key":"1_CR10","unstructured":"Fernandes, E., Paupore, J., Rahmati, A., Simionato, D., Conti, M., Prakash, A.: FlowFence: practical data protection for emerging IoT application frameworks. In: USENIX Security Symposium, pp. 531\u2013548 (2016)"},{"key":"1_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s13389-016-0141-6","volume":"8","author":"Q Ge","year":"2016","unstructured":"Ge, Q., Yarom, Y., Cock, D., Heiser, G.: A survey of microarchitectural timing attacks and countermeasures on contemporary hardware. J. Cryptographic Eng. 8, 1\u201327 (2016)","journal-title":"J. Cryptographic Eng."},{"issue":"4\u20135","key":"1_CR12","doi-asserted-by":"publisher","first-page":"427","DOI":"10.3233\/JCS-15801","volume":"25","author":"DB Giffin","year":"2017","unstructured":"Giffin, D.B., et al.: Hails: protecting data privacy in untrusted web applications. J. Comput. Secur. 25(4\u20135), 427\u2013461 (2017)","journal-title":"J. Comput. Secur."},{"key":"1_CR13","unstructured":"Giffin, D.B., et al.: Hails: protecting data privacy in untrusted web applications. In: Proceedings of the Symposium on Operating Systems Design and Implementation. USENIX (2012)"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Goguen, J.A., Meseguer, J.: Unwinding and inference control, pp. 75\u201386, April 1984","DOI":"10.1109\/SP.1984.10019"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Hedin, D., Birgisson, A., Bello, L., Sabelfeld, A.: JSFlow: tracking information flow in JavaScript and its APIs. In: Proceedings of the 29th Annual ACM Symposium on Applied Computing, pp. 1663\u20131671. ACM (2014)","DOI":"10.1145\/2554850.2554909"},{"key":"1_CR16","unstructured":"Henriksson, R.: Scheduling garbage collection in embedded systems. Ph.D. thesis, Department of Computer Science (1998)"},{"key":"1_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-662-46666-7_2","volume-title":"Principles of Security and Trust","author":"S Heule","year":"2015","unstructured":"Heule, S., Stefan, D., Yang, E.Z., Mitchell, J.C., Russo, A.: IFC inside: retrofitting languages with dynamic information flow control. In: Focardi, R., Myers, A. (eds.) POST 2015. LNCS, vol. 9036, pp. 11\u201331. Springer, Heidelberg (2015). \n                    https:\/\/doi.org\/10.1007\/978-3-662-46666-7_2"},{"key":"1_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/3-540-46425-5_12","volume-title":"Programming Languages and Systems","author":"K Honda","year":"2000","unstructured":"Honda, K., Vasconcelos, V., Yoshida, N.: Secure information flow as typed process behaviour. In: Smolka, G. (ed.) ESOP 2000. LNCS, vol. 1782, pp. 180\u2013199. Springer, Heidelberg (2000). \n                    https:\/\/doi.org\/10.1007\/3-540-46425-5_12"},{"issue":"6","key":"1_CR19","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/1286821.1286822","volume":"29","author":"K Honda","year":"2007","unstructured":"Honda, K., Yoshida, N.: A uniform type structure for secure information flow. ACM Trans. Program. Lang. Syst. (TOPLAS) 29(6), 31 (2007)","journal-title":"ACM Trans. Program. Lang. Syst. (TOPLAS)"},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"Hritcu, C., Greenberg, M., Karel, B., Pierce, B.C., Morrisett, G.: All your IFCException are belong to us. In: 2013 IEEE Symposium on Security and Privacy (SP), pp. 3\u201317. IEEE (2013)","DOI":"10.1109\/SP.2013.10"},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"Hsu, J., et al.: Differential privacy: an economic method for choosing epsilon. In: Proceedings of the 2014 IEEE 27th Computer Security Foundations Symposium, CSF 2014, pp. 398\u2013410. IEEE Computer Society, Washington, DC (2014)","DOI":"10.1109\/CSF.2014.35"},{"issue":"3\u20134","key":"1_CR22","doi-asserted-by":"publisher","first-page":"233","DOI":"10.3233\/JCS-1992-13-404","volume":"1","author":"W-M Hu","year":"1992","unstructured":"Hu, W.-M.: Reducing timing channels with fuzzy time. J. Comput. Secur. 1(3\u20134), 233\u2013254 (1992)","journal-title":"J. Comput. Secur."},{"key":"1_CR23","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1017\/S0956796800000319","volume":"2","author":"SLP Jones","year":"1992","unstructured":"Jones, S.L.P.: Implementing lazy functional languages on stock hardware: the spineless tagless G-machine. J. Funct. Program. 2, 127\u2013202 (1992)","journal-title":"J. Funct. Program."},{"issue":"3","key":"1_CR24","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1145\/357369.357374","volume":"1","author":"RA Kemmerer","year":"1983","unstructured":"Kemmerer, R.A.: Shared resource matrix methodology: an approach to identifying storage and timing channels. ACM Trans. Comput. Syst. (TOCS) 1(3), 256\u2013277 (1983)","journal-title":"ACM Trans. Comput. Syst. (TOCS)"},{"issue":"4\u20135","key":"1_CR25","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/s00236-005-0179-x","volume":"42","author":"N Kobayashi","year":"2005","unstructured":"Kobayashi, N.: Type-based information flow analysis for the \n                    \n                      \n                    \n                    $$\\pi $$\n                  -calculus. Acta Informatica 42(4\u20135), 291\u2013347 (2005)","journal-title":"Acta Informatica"},{"key":"1_CR26","unstructured":"Kohlbrenner, D., Shacham, H.: Trusted browsers for uncertain times. In: USENIX Security Symposium, pp. 463\u2013480 (2016)"},{"key":"1_CR27","doi-asserted-by":"crossref","unstructured":"Kuper, L., Newton, R.R.: LVars: lattice-based data structures for deterministic parallelism. In: Proceedings of the 2nd ACM SIGPLAN Workshop on Functional High-Performance Computing, pp. 71\u201384. ACM (2013)","DOI":"10.1145\/2502323.2502326"},{"issue":"6","key":"1_CR28","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/2666356.2594312","volume":"49","author":"L Kuper","year":"2014","unstructured":"Kuper, L., Todd, A., Tobin-Hochstadt, S., Newton, R.R.: Taming the parallel effect zoo: extensible deterministic parallelism with LVish. ACM SIGPLAN Not. 49(6), 2\u201314 (2014)","journal-title":"ACM SIGPLAN Not."},{"key":"1_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-642-24861-0_22","volume-title":"Information Security","author":"J Lee","year":"2011","unstructured":"Lee, J., Clifton, C.: How much is enough? Choosing \n                    \n                      \n                    \n                    $$\\epsilon $$\n                   for differential privacy. In: Lai, X., Zhou, J., Li, H. (eds.) ISC 2011. LNCS, vol. 7001, pp. 325\u2013340. Springer, Heidelberg (2011). \n                    https:\/\/doi.org\/10.1007\/978-3-642-24861-0_22"},{"issue":"19","key":"1_CR30","doi-asserted-by":"publisher","first-page":"1974","DOI":"10.1016\/j.tcs.2010.01.025","volume":"411","author":"P Li","year":"2010","unstructured":"Li, P., Zdancewic, S.: Arrows for secure information flow. Theoret. Comput. Sci. 411(19), 1974\u20131994 (2010)","journal-title":"Theoret. Comput. Sci."},{"key":"1_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-319-71237-6_3","volume-title":"Programming Languages and Systems","author":"X Li","year":"2017","unstructured":"Li, X., Mantel, H., Tasch, M.: Taming message-passing communication in compositional reasoning about confidentiality. In: Chang, B.-Y.E. (ed.) APLAS 2017. LNCS, vol. 10695, pp. 45\u201366. Springer, Cham (2017). \n                    https:\/\/doi.org\/10.1007\/978-3-319-71237-6_3"},{"issue":"6","key":"1_CR32","first-page":"26","volume":"10","author":"S Lipner","year":"2012","unstructured":"Lipner, S., Jaeger, T., Zurko, M.E.: Lessons from VAX\/SVS for high-assurance VM systems. IEEE Secur. Priv. 10(6), 26\u201335 (2012)","journal-title":"IEEE Secur. Priv."},{"issue":"4\u20135","key":"1_CR33","doi-asserted-by":"publisher","first-page":"367","DOI":"10.3233\/JCS-15805","volume":"25","author":"J Liu","year":"2017","unstructured":"Liu, J., Arden, O., George, M.D., Myers, A.C.: Fabric: building open distributed systems securely by construction. J. Comput. Secur. 25(4\u20135), 367\u2013426 (2017)","journal-title":"J. Comput. Secur."},{"key":"1_CR34","doi-asserted-by":"crossref","unstructured":"Liu, J., George, M.D., Vikram, K., Qi, X., Waye, L., Myers, A.C.: Fabric: a platform for secure distributed computation and storage. In: Proceedings of the ACM SIGOPS 22nd Symposium on Operating Systems Principles. ACM (2009)","DOI":"10.1145\/1629575.1629606"},{"key":"1_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-642-54792-8_11","volume-title":"Principles of Security and Trust","author":"J Liu","year":"2014","unstructured":"Liu, J., Myers, A.C.: Defining and enforcing referential security. In: Abadi, M., Kremer, S. (eds.) POST 2014. LNCS, vol. 8414, pp. 199\u2013219. Springer, Heidelberg (2014). \n                    https:\/\/doi.org\/10.1007\/978-3-642-54792-8_11"},{"issue":"4","key":"1_CR36","doi-asserted-by":"publisher","first-page":"615","DOI":"10.3233\/JCS-2003-11406","volume":"11","author":"H Mantel","year":"2003","unstructured":"Mantel, H., Sabelfeld, A.: A unifying approach to the security of distributed and multi-threaded programs. J. Comput. Secur. 11(4), 615\u2013676 (2003)","journal-title":"J. Comput. Secur."},{"key":"1_CR37","doi-asserted-by":"crossref","unstructured":"Mantel, H., Sands, D., Sudbrock, H.: Assumptions and guarantees for compositional noninterference. In: 2011 IEEE 24th Computer Security Foundations Symposium, pp. 218\u2013232, June 2011","DOI":"10.1109\/CSF.2011.22"},{"issue":"12","key":"1_CR38","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1145\/2096148.2034685","volume":"46","author":"S Marlow","year":"2012","unstructured":"Marlow, S., Newton, R., Peyton Jones, S.: A monad for deterministic parallelism. ACM SIGPLAN Not. 46(12), 71\u201382 (2012)","journal-title":"ACM SIGPLAN Not."},{"issue":"4\u20135","key":"1_CR39","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1017\/S0956796806005995","volume":"16","author":"S Marlow","year":"2006","unstructured":"Marlow, S., Peyton Jones, S.: Making a fast curry: push\/enter vs. eval\/apply for higher-order languages. J. Funct. Program. 16(4\u20135), 415\u2013449 (2006)","journal-title":"J. Funct. Program."},{"key":"1_CR40","doi-asserted-by":"crossref","unstructured":"McCullough, D.: Specifications for multi-level security and a hook-up. In: 1987 IEEE Symposium on Security and Privacy (SP), p. 161, April 1987","DOI":"10.1109\/SP.1987.10009"},{"key":"1_CR41","doi-asserted-by":"crossref","unstructured":"Muller, S., Chong, S.: Towards a practical secure concurrent language. In: Proceedings of the 25th Annual ACM SIGPLAN Conference on Object-Oriented Programming Languages, Systems, Languages, and Applications, pp. 57\u201374. ACM Press, New York, October 2012","DOI":"10.1145\/2384616.2384621"},{"key":"1_CR42","unstructured":"Myers, A.C., Zheng, L., Zdancewic, S., Chong, S., Nystrom, N.: Jif 3.0: Java information flow, July 2006"},{"key":"1_CR43","unstructured":"Nadkarni, A., Andow, B., Enck, W., Jha, S.: Practical DIFC enforcement on android. In: USENIX Security Symposium, pp. 1119\u20131136 (2016)"},{"key":"1_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/3-540-18317-5_8","volume-title":"Functional Programming Languages and Computer Architecture","author":"SC North","year":"1987","unstructured":"North, S.C., Reppy, J.H.: Concurrent garbage collection on stock hardware. In: Kahn, G. (ed.) FPCA 1987. LNCS, vol. 274, pp. 113\u2013133. Springer, Heidelberg (1987). \n                    https:\/\/doi.org\/10.1007\/3-540-18317-5_8"},{"key":"1_CR45","unstructured":"Parker, J.L.: LMonad: information flow control for Haskell web applications. Ph.D. thesis, University of Maryland, College Park (2014)"},{"key":"1_CR46","doi-asserted-by":"crossref","unstructured":"Pedersen, M.V., Askarov, A.: From trash to treasure: timing-sensitive garbage collection. In: Proceedings of the 38th IEEE Symposium on Security and Privacy. IEEE (2017)","DOI":"10.1109\/SP.2017.64"},{"key":"1_CR47","unstructured":"Percival, C.: Cache missing for fun and profit (2005)"},{"key":"1_CR48","doi-asserted-by":"crossref","unstructured":"Pizlo, F., Hosking, A.L., Vitek, J.: Hierarchical real-time garbage collection. In: Proceedings of the 2007 ACM SIGPLAN\/SIGBED Conference on Languages, Compilers, and Tools for Embedded Systems, LCTES 2007, pp. 123\u2013133. ACM, New York (2007)","DOI":"10.1145\/1254766.1254784"},{"key":"1_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-662-54455-6_1","volume-title":"Principles of Security and Trust","author":"W Rafnsson","year":"2017","unstructured":"Rafnsson, W., Jia, L., Bauer, L.: Timing-sensitive noninterference through composition. In: Maffei, M., Ryan, M. (eds.) POST 2017. LNCS, vol. 10204, pp. 3\u201325. Springer, Heidelberg (2017). \n                    https:\/\/doi.org\/10.1007\/978-3-662-54455-6_1"},{"key":"1_CR50","doi-asserted-by":"crossref","unstructured":"Roy, I., Porter, D.E., Bond, M.D., McKinley, K.S., Witchel, E.: Laminar: practical fine-grained decentralized information flow control, vol. 44. ACM (2009)","DOI":"10.1145\/1543135.1542484"},{"key":"1_CR51","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1145\/2858949.2784756","volume":"50","author":"A Russo","year":"2015","unstructured":"Russo, A.: Functional pearl: two can keep a secret, if one of them uses Haskell. ACM SIGPLAN Not. 50, 280\u2013288 (2015)","journal-title":"ACM SIGPLAN Not."},{"key":"1_CR52","unstructured":"Sabelfeld, A., Sands, D.: Probabilistic noninterference for multi-threaded programs. In: Proceedings of the 13th IEEE Workshop on Computer Security Foundations, CSFW 2000, p. 200. IEEE Computer Society, Washington, DC (2000)"},{"issue":"3","key":"1_CR53","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1017\/S0956796897002712","volume":"7","author":"P Sestoft","year":"1997","unstructured":"Sestoft, P.: Deriving a lazy abstract machine. J. Funct. Program. 7(3), 231\u2013264 (1997)","journal-title":"J. Funct. Program."},{"key":"1_CR54","doi-asserted-by":"crossref","unstructured":"Stefan, D., Russo, A., Buiras, P., Levy, A., Mitchell, J.C., Mazi\u00e8res, D.: Addressing covert termination and timing channels in concurrent information flow systems. In: International Conference on Functional Programming (ICFP). ACM SIGPLAN, September 2012","DOI":"10.1145\/2364527.2364557"},{"key":"1_CR55","doi-asserted-by":"crossref","unstructured":"Stefan, D., Russo, A., Mazi\u00e8res, D., Mitchell, J.C.: Flexible dynamic information flow control in the presence of exceptions. J. Funct. Program. 27 (2017)","DOI":"10.1017\/S0956796816000241"},{"key":"1_CR56","doi-asserted-by":"crossref","unstructured":"Stefan, D., Russo, A., Mitchell, J.C., Mazi\u00e8res, D.: Flexible dynamic information flow control in Haskell. In: Haskell Symposium. ACM SIGPLAN, September 2011","DOI":"10.1145\/2034675.2034688"},{"key":"1_CR57","unstructured":"Stefan, D., et al.: Protecting users by confining JavaScript with COWL. In: USENIX Symposium on Operating Systems Design and Implementation. USENIX Association (2014)"},{"key":"1_CR58","doi-asserted-by":"crossref","unstructured":"Tsai, T.-C., Russo, A., Hughes, J.: A library for secure multi-threaded information flow in Haskell. In: 20th IEEE Computer Security Foundations Symposium, CSF 2007, pp. 187\u2013202. IEEE (2007)","DOI":"10.1109\/CSF.2007.6"},{"key":"1_CR59","doi-asserted-by":"crossref","unstructured":"Vassena, M., Breitner, J., Russo, A.: Securing concurrent lazy programs against information leakage. In: 30th IEEE Computer Security Foundations Symposium, CSF 2017, Santa Barbara, CA, USA, 21\u201325 August 2017, pp. 37\u201352 (2017)","DOI":"10.1109\/CSF.2017.39"},{"key":"1_CR60","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1007\/978-3-319-45744-4_27","volume-title":"Computer Security \u2013 ESORICS 2016","author":"M Vassena","year":"2016","unstructured":"Vassena, M., Buiras, P., Waye, L., Russo, A.: Flexible manipulation of labeled values for\u00a0information-flow control libraries. In: Askoxylakis, I., Ioannidis, S., Katsikas, S., Meadows, C. (eds.) ESORICS 2016. LNCS, vol. 9878, pp. 538\u2013557. Springer, Cham (2016). \n                    https:\/\/doi.org\/10.1007\/978-3-319-45744-4_27"},{"key":"1_CR61","doi-asserted-by":"crossref","unstructured":"Vassena, M., Russo, A.: On formalizing information-flow control libraries. In: Proceedings of the 2016 ACM Workshop on Programming Languages and Analysis for Security, PLAS 2016, pp. 15\u201328. ACM, New York (2016)","DOI":"10.1145\/2993600.2993608"},{"key":"1_CR62","doi-asserted-by":"crossref","unstructured":"Vassena, M., Russo, A., Buiras, P., Waye, L.: MAC a verified static information-flow control library. J. Log. Algebraic Methods Program. (2017)","DOI":"10.1016\/j.jlamp.2017.12.003"},{"key":"1_CR63","unstructured":"Vila, P., K\u00f6pf, B.: Loophole: timing attacks on shared event loops in chrome. In: USENIX Security Symposium (2017)"},{"key":"1_CR64","unstructured":"Volpano, D., Smith, G.: Eliminating covert flows with minimum typings. In: Proceedings of the 10th IEEE Workshop on Computer Security Foundations, CSFW 1997, p. 156. IEEE Computer Society, Washington, DC (1997)"},{"key":"1_CR65","unstructured":"Wu, W., Zhai, E., Wolinsky, D.I., Ford, B., Gu, L., Jackowitz, D.: Warding off timing attacks in Deterland. In: Conference on Timely Results in Operating Systems, Monterey, CS, US (2015)"},{"key":"1_CR66","doi-asserted-by":"crossref","unstructured":"Yang, E.Z., Mazi\u00e8res, D.: Dynamic space limits for Haskell. In: Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2014, pp. 588\u2013598. ACM, New York (2014)","DOI":"10.1145\/2666356.2594341"},{"key":"1_CR67","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1145\/2980983.2908098","volume":"51","author":"J Yang","year":"2016","unstructured":"Yang, J., Hance, T., Austin, T.H., Solar-Lezama, A., Flanagan, C., Chong, S.: Precise, dynamic information flow for database-backed applications. ACM SIGPLAN Not. 51, 631\u2013647 (2016)","journal-title":"ACM SIGPLAN Not."},{"key":"1_CR68","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1145\/2103621.2103669","volume":"47","author":"J Yang","year":"2012","unstructured":"Yang, J., Yessenov, K., Solar-Lezama, A.: A language for automatically enforcing privacy policies. ACM SIGPLAN Not. 47, 85\u201396 (2012)","journal-title":"ACM SIGPLAN Not."},{"key":"1_CR69","unstructured":"Zeldovich, N., Boyd-Wickizer, S., Kohler, E., Mazi\u00e8res, D.: Making information flow explicit in HiStar. In: Proceedings of the 7th Symposium on Operating Systems Design and Implementation, pp. 263\u2013278. USENIX Association (2006)"},{"key":"1_CR70","first-page":"293","volume":"8","author":"N Zeldovich","year":"2008","unstructured":"Zeldovich, N., Boyd-Wickizer, S., Mazieres, D.: Securing distributed systems with information flow control. NSDI 8, 293\u2013308 (2008)","journal-title":"NSDI"},{"key":"1_CR71","doi-asserted-by":"crossref","unstructured":"Zhang, D., Askarov, A., Myers, A.C.: Predictive mitigation of timing channels in interactive systems. In: Proceedings of the 18th ACM Conference on Computer and Communications Security, pp. 563\u2013574. ACM (2011)","DOI":"10.1145\/2046707.2046772"}],"container-title":["Lecture Notes in Computer Science","Principles of Security and Trust"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-17138-4_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T09:17:15Z","timestamp":1558343835000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-17138-4_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030171377","9783030171384"],"references-count":71,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-17138-4_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"3 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"POST","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Principles of Security and Trust","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Prague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"post2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.etaps.org\/2019\/post","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}