{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T04:12:56Z","timestamp":1748751176645,"version":"3.41.0"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319274355"},{"type":"electronic","value":"9783319274362"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-27436-2_12","type":"book-chapter","created":{"date-parts":[[2015,12,16]],"date-time":"2015-12-16T07:06:46Z","timestamp":1450249606000},"page":"201-217","source":"Crossref","is-referenced-by-count":6,"title":["Using Dynamic Pushdown Networks to Automate a Modular Information-Flow Analysis"],"prefix":"10.1007","author":[{"given":"Heiko","family":"Mantel","sequence":"first","affiliation":[]},{"given":"Markus","family":"M\u00fcller-Olm","sequence":"additional","affiliation":[]},{"given":"Matthias","family":"Perner","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Wenner","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,12,17]]},"reference":[{"issue":"1","key":"12_CR1","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1145\/357084.357088","volume":"2","author":"G Andrews","year":"1980","unstructured":"Andrews, G., Reitman, R.: An axiomatic approach to information flow in programs. ACM Trans. Program. Lang. Syst. 2(1), 56\u201376 (1980)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"12_CR2","unstructured":"Arden, O., Chong, S., Liu, J., Myers, A.C., Nystrom, N., Vikram, K., Zdancewic, S., Zhang, D., Zheng, L.: Jif. Software release: http:\/\/www.cs.cornell.edu\/jif\/ (2014)"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Askarov, A., Chong, S., Mantel, H.: Hybrid monitors for concurrent noninterference. In: 28th IEEE Computer Security Foundations Symposium, pp. 137\u2013151 (2015)","DOI":"10.1109\/CSF.2015.17"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Askarov, A., Hunt, S., Sabelfeld, A., Sands, D.: Termination-insensitive noninterference leaks more than just a bit. In: 13th European Symposium on Research in Computer Security, pp. 333\u2013348 (2008)","DOI":"10.1007\/978-3-540-88313-5_22"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/978-3-319-03542-0_16","volume-title":"Programming Languages and Systems","author":"N Broberg","year":"2013","unstructured":"Broberg, N., van Delft, B., Sands, D.: Paragon for practical programming with information-flow control. In: Shan, C. (ed.) APLAS 2013. LNCS, vol. 8301, pp. 217\u2013232. Springer, Heidelberg (2013)"},{"key":"12_CR6","unstructured":"Giffhorn, D., Snelting, G.: A new algorithm for low-deterministic security. International Journal of Information Security pp. 1\u201325 (2014)"},{"issue":"6","key":"12_CR7","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/s10207-009-0086-1","volume":"8","author":"C Hammer","year":"2009","unstructured":"Hammer, C., Snelting, G.: Flow-sensitive, context-sensitive, and object-sensitive information flow control based on program dependence graphs. Int. J. Inf. Secur. 8(6), 399\u2013422 (2009)","journal-title":"Int. J. Inf. Secur."},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/978-3-642-27375-9_9","volume-title":"Theory of Security and Applications","author":"M Huisman","year":"2012","unstructured":"Huisman, M., Blondeel, H.-C.: Model-checking secure information flow for multi-threaded programs. In: M\u00f6dersheim, S., Palamidessi, C. (eds.) TOSCA 2011. LNCS, vol. 6993, pp. 148\u2013165. Springer, Heidelberg (2012)"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/978-3-642-02658-4_39","volume-title":"Computer Aided Verification","author":"P Lammich","year":"2009","unstructured":"Lammich, P., M\u00fcller-Olm, M., Wenner, A.: Predecessor sets of dynamic pushdown networks with tree-regular constraints. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 525\u2013539. Springer, Heidelberg (2009)"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Mantel, H., Sands, D., Sudbrock, H.: Assumptions and guarantees for compositional noninterference. In: 24th IEEE Computer Security Foundations Symposium, pp. 218\u2013232 (2011)","DOI":"10.1109\/CSF.2011.22"},{"key":"12_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-540-71410-1_8","volume-title":"Logic-Based Program Synthesis and Transformation","author":"H Mantel","year":"2007","unstructured":"Mantel, H., Sudbrock, H., Krau\u00dfer, T.: Combining different proof techniques for verifying information flow security. In: Puebla, G. (ed.) LOPSTR 2006. LNCS, vol. 4407, pp. 94\u2013110. Springer, Heidelberg (2007)"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Myers, A.C.: JFlow: practical mostly-static information flow control. In: 26th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 228\u2013241 (1999)","DOI":"10.1145\/292540.292561"},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-642-36563-8_8","volume-title":"Engineering Secure Software and Systems","author":"TM Ngo","year":"2013","unstructured":"Ngo, T.M., Stoelinga, M., Huisman, M.: Confidentiality for probabilistic multi-threaded programs and its verification. In: J\u00fcrjens, J., Livshits, B., Scandariato, R. (eds.) ESSoS 2013. LNCS, vol. 7781, pp. 107\u2013122. Springer, Heidelberg (2013)"},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/3-540-45575-2_22","volume-title":"Perspectives of System Informatics","author":"A Sabelfeld","year":"2001","unstructured":"Sabelfeld, A.: The impact of synchronisation on secure information flow in concurrent programs. In: Bj\u00f8rner, D., Broy, M., Zamulin, A.V. (eds.) PSI 2001. LNCS, vol. 2244, pp. 225\u2013239. Springer, Heidelberg (2001)"},{"issue":"1","key":"12_CR15","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1109\/JSAC.2002.806121","volume":"21","author":"A Sabelfeld","year":"2003","unstructured":"Sabelfeld, A., Myers, A.C.: Language-based information-flow security. IEEE J. Sel. Areas Commun. 21(1), 5\u201319 (2003)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Sabelfeld, A., Sands, D.: Probabilistic noninterference for multi-threaded programs. In: 13th IEEE Computer Security Foundations Workshop, pp. 200\u2013214 (2000)","DOI":"10.1109\/CSFW.2000.856937"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Smith, G., Volpano, D.: Secure information flow in a multi-threaded imperative language. In: 25th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 355\u2013364 (1998)","DOI":"10.1145\/268946.268975"},{"key":"12_CR18","unstructured":"Sudbrock, H.: Compositional and Scheduler-Independent Information Flow Security. Ph.D. thesis, Technische Universit\u00e4t Darmstadt, Germany (2013)"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Terauchi, T.: A type system for observational determinism. In: 21st IEEE Computer Security Foundations Symposium, pp. 287\u2013300 (2008)","DOI":"10.1109\/CSF.2008.9"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Vaughan, J., Millstein, T.: Secure information flow for concurrent programs under total store order. In: 25th IEEE Computer Security Foundations Symposium, pp. 19\u201329 (2012)","DOI":"10.1109\/CSF.2012.20"}],"container-title":["Lecture Notes in Computer Science","Logic-Based Program Synthesis and Transformation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-27436-2_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T20:15:32Z","timestamp":1748722532000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-27436-2_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319274355","9783319274362"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-27436-2_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}