{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:40:13Z","timestamp":1775054413185,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642381966","type":"print"},{"value":"9783642381973","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38197-3_8","type":"book-chapter","created":{"date-parts":[[2013,4,17]],"date-time":"2013-04-17T07:53:41Z","timestamp":1366185221000},"page":"106-121","source":"Crossref","is-referenced-by-count":8,"title":["Types vs. PDGs in Information Flow Analysis"],"prefix":"10.1007","author":[{"given":"Heiko","family":"Mantel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Henning","family":"Sudbrock","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/978-3-540-27864-1_10","volume-title":"Static Analysis","author":"T. Amtoft","year":"2004","unstructured":"Amtoft, T., Banerjee, A.: Information Flow Analysis in Logical Form. In: Giacobazzi, R. (ed.) SAS 2004. LNCS, vol.\u00a03148, pp. 100\u2013115. Springer, Heidelberg (2004)"},{"issue":"1-2","key":"8_CR2","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. Theoretical Computer Science\u00a0281(1-2), 109\u2013130 (2002)","journal-title":"Theoretical Computer Science"},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/BFb0019411","volume-title":"Automated and Algorithmic Debugging","author":"J. Cheng","year":"1993","unstructured":"Cheng, J.: Slicing Concurrent Programs - A Graph-Theoretical Approach. In: Fritszon, P.A. (ed.) AADEBUG 1993. LNCS, vol.\u00a0749, pp. 223\u2013240. Springer, Heidelberg (1993)"},{"issue":"3","key":"8_CR4","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1145\/24039.24041","volume":"9","author":"J. Ferrante","year":"1987","unstructured":"Ferrante, J., Ottenstein, K.J., Warren, J.D.: The Program Dependence Graph and its Use in Optimization. ACM Transactions on Programming Languages and Systems\u00a09(3), 319\u2013349 (1987)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"8_CR5","unstructured":"Giffhorn, D., Snelting, G.: Probabilistic Noninterference Based on Program Dependence Graphs. Tech. Rep.\u00a06, Karlsruher Institut f\u00fcr Technologie (KIT) (2012)"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Goguen, J.A., 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":"8_CR7","unstructured":"Hammer, C.: Information Flow Control for Java. Ph.D. thesis, Universit\u00e4t Karlsruhe (TH) (2009)"},{"issue":"6","key":"8_CR8","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. International Journal of Information Security\u00a08(6), 399\u2013422 (2009)","journal-title":"International Journal of Information Security"},{"issue":"1","key":"8_CR9","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1145\/77606.77608","volume":"12","author":"S. Horwitz","year":"1990","unstructured":"Horwitz, S., Reps, T.W., Binkley, D.: Interprocedural Slicing Using Dependence Graphs. ACM Transactions on Programming Languages and Systems\u00a012(1), 26\u201360 (1990)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"3","key":"8_CR10","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/0164-1212(92)90111-V","volume":"17","author":"C.S. Hsieh","year":"1992","unstructured":"Hsieh, C.S., Unger, E.A., Mata-Toledo, R.A.: Using Program Dependence Graphs for Information Flow Control. Journal of Systems and Software\u00a017(3), 227\u2013232 (1992)","journal-title":"Journal of Systems and Software"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Hunt, S., Sands, D.: On Flow-Sensitive Security Types. In: ACM Symposium on Principles of Programming Languages, pp. 79\u201390 (2006)","DOI":"10.1145\/1111320.1111045"},{"key":"8_CR12","unstructured":"Krinke, J.: Advanced Slicing of Sequential and Concurrent Programs. Ph.D. thesis, Universit\u00e4t Passau (2003)"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Mantel, H.: Information Flow and Noninterference. In: Encyclopedia of Cryptography and Security, 2nd edn., pp. 605\u2013607. Springer (2011)","DOI":"10.1007\/978-1-4419-5906-5_874"},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-540-30477-7_9","volume-title":"Programming Languages and Systems","author":"H. Mantel","year":"2004","unstructured":"Mantel, H., Sands, D.: Controlled Declassification based on Intransitive Noninterference. In: Chin, W.-N. (ed.) APLAS 2004. LNCS, vol.\u00a03302, pp. 129\u2013145. Springer, Heidelberg (2004)"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Mantel, H., Sands, D., Sudbrock, H.: Assumptions and Guarantees for Compositional Noninterference. In: IEEE Computer Security Foundations Symposium, pp. 218\u2013232 (2011)","DOI":"10.1109\/CSF.2011.22"},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Myers, A.C.: JFlow: Practical Mostly-Static Information Flow Control. In: ACM Symposium on Principles of Programming Languages, pp. 228\u2013241 (1999)","DOI":"10.1145\/292540.292561"},{"issue":"5","key":"8_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1387673.1387678","volume":"30","author":"M. Naik","year":"2008","unstructured":"Naik, M., Palsberg, J.: A Type System Equivalent to a Model Checker. ACM Transactions on Programming Languages and Systems\u00a030(5), 1\u201324 (2008)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Palsberg, J., O\u2019Keefe, P.: A Type System Equivalent to Flow Analysis. In: ACM Symposium on Principles of Programming Languages, pp. 367\u2013378 (1995)","DOI":"10.1145\/199448.199533"},{"key":"8_CR19","doi-asserted-by":"crossref","unstructured":"Rehof, J., F\u00e4hndrich, M.: Type-Based Flow Analysis: From Polymorphic Subtyping to CFL-Reachability. In: ACM Symposium on Principles of Programming Languages, pp. 54\u201366 (2001)","DOI":"10.1145\/373243.360208"},{"key":"8_CR20","series-title":"Lecture Notes in Computer Science","first-page":"33","volume-title":"Computer Security - ESORICS 94","author":"A.W. Roscoe","year":"1994","unstructured":"Roscoe, A.W., Woodcock, J.C.P., Wulf, L.: Non-interference through Determinism. In: Gollmann, D. (ed.) ESORICS 1994. LNCS, vol.\u00a0875, pp. 33\u201353. Springer, Heidelberg (1994)"},{"issue":"1","key":"8_CR21","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 Journal on Selected Areas in Communication\u00a021(1), 5\u201319 (2003)","journal-title":"IEEE Journal on Selected Areas in Communication"},{"key":"8_CR22","doi-asserted-by":"crossref","unstructured":"Sabelfeld, A., Sands, D.: Probabilistic Noninterference for Multi-threaded Programs. In: IEEE Computer Security Foundations Workshop, pp. 200\u2013215 (2000)","DOI":"10.1109\/CSFW.2000.856937"},{"key":"8_CR23","doi-asserted-by":"crossref","unstructured":"Smith, G., Volpano, D.: Secure Information Flow in a Multi-threaded Imperative Language. In: ACM Symposium on Principles of Programming Languages, pp. 355\u2013364 (1998)","DOI":"10.1145\/268946.268975"},{"issue":"3","key":"8_CR24","first-page":"1","volume":"4","author":"D. Volpano","year":"1996","unstructured":"Volpano, D., Smith, G., Irvine, C.: A Sound Type System for Secure Flow Analysis. Journal of Computer Security\u00a04(3), 1\u201321 (1996)","journal-title":"Journal of Computer Security"},{"key":"8_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1007\/BFb0030629","volume-title":"TAPSOFT\u201997: Theory and Practice of Software Development","author":"D. Volpano","year":"1997","unstructured":"Volpano, D., Smith, G.: A Type-Based Approach to Program Security. In: Bidoit, M., Dauchet, M. (eds.) TAPSOFT 1997. LNCS, vol.\u00a01214, pp. 607\u2013621. Springer, Heidelberg (1997)"},{"key":"8_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-540-71067-7_24","volume-title":"Theorem Proving in Higher Order Logics","author":"D. Wasserrab","year":"2008","unstructured":"Wasserrab, D., Lochbihler, A.: Formalizing a Framework for Dynamic Slicing of Program Dependence Graphs in Isabelle\/HOL. In: Mohamed, O.A., Mu\u00f1oz, C., Tahar, S. (eds.) TPHOLs 2008. LNCS, vol.\u00a05170, pp. 294\u2013309. Springer, Heidelberg (2008)"},{"key":"8_CR27","doi-asserted-by":"crossref","unstructured":"Wasserrab, D., Lohner, D., Snelting, G.: On PDG-based Noninterference and its Modular Proof. In: ACM Workshop on Programming Languages and Analysis for Security, pp. 31\u201344 (2009)","DOI":"10.1145\/1667209.1667214"},{"key":"8_CR28","doi-asserted-by":"crossref","unstructured":"Zdancewic, S., Myers, A.C.: Observational Determinism for Concurrent Program Security. In: IEEE Computer Security Foundations Workshop, pp. 29\u201343 (2003)","DOI":"10.1109\/CSFW.2003.1212703"}],"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-642-38197-3_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T05:21:25Z","timestamp":1745990485000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38197-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642381966","9783642381973"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38197-3_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}