{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T04:02:27Z","timestamp":1746417747321,"version":"3.40.4"},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,8,15]],"date-time":"2014-08-15T00:00:00Z","timestamp":1408060800000},"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":["Int. J. Inf. Secur."],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1007\/s10207-014-0257-6","type":"journal-article","created":{"date-parts":[[2014,8,14]],"date-time":"2014-08-14T13:18:46Z","timestamp":1408022326000},"page":"263-287","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["A new algorithm for low-deterministic security"],"prefix":"10.1007","volume":"14","author":[{"given":"Dennis","family":"Giffhorn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gregor","family":"Snelting","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,8,15]]},"reference":[{"key":"257_CR1","doi-asserted-by":"crossref","unstructured":"Abadi, M., Banerjee, A., Heintze, N., Riecke, J.G.: A core calculus of dependency. In: POPL \u201999: Proceedings of the 26th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 147\u2013160. ACM, New York (1999)","DOI":"10.1145\/292540.292555"},{"key":"257_CR2","doi-asserted-by":"crossref","unstructured":"Askarov, A., Hunt, S., Sabelfeld, A., Sands, D.: Termination-insensitive noninterference leaks more than just a bit. In Proceedings of ESORICS, volume 5283 of LNCS, pp. 333\u2013348 (2008)","DOI":"10.1007\/978-3-540-88313-5_22"},{"key":"257_CR3","doi-asserted-by":"crossref","unstructured":"Binkley, D., Harman, M.: A survey of empirical results on program slicing. Adv. Comput. 62, 105\u2013178 (2004)","DOI":"10.1016\/S0065-2458(03)62003-6"},{"key":"257_CR4","doi-asserted-by":"crossref","unstructured":"Binkley, D., Harman, M., Krinke, J.: Empirical study of optimization techniques for massive slicing. ACM Trans. Program. Lang. Syst. 30(1), 3 (2007)","DOI":"10.1145\/1290520.1290523"},{"key":"257_CR5","doi-asserted-by":"crossref","unstructured":"Bouajjani, A., M\u00fcller-Olm, M., Touili, T.: Regular symbolic analysis of dynamic networks of pushdown systems. In: Concurrency. Theory (CONCUR 2005), pp. 473\u2013487. Springer, LNCS 3653 (2005)","DOI":"10.1007\/11539452_36"},{"key":"257_CR6","doi-asserted-by":"crossref","unstructured":"Gawlitza, T.M., Lammich, P., M\u00fcller-Olm, M., Seidl, H., Wenner, A.: Join-lock-sensitive forward reachability analysis for concurrent programs with dynamic process creation. In: VMCAI, pp. 199\u2013213 (2011)","DOI":"10.1007\/978-3-642-18275-4_15"},{"issue":"2","key":"257_CR7","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/s11219-010-9114-7","volume":"19","author":"D Giffhorn","year":"2011","unstructured":"Giffhorn, D.: Advanced chopping of sequential and concurrent programs. Softw. Qual. J. 19(2), 239\u2013294 (2011)","journal-title":"Softw. Qual. J."},{"key":"257_CR8","unstructured":"Giffhorn, D.: Slicing of concurrent programs and its application to information flow control. PhD thesis, Karlsruher Institut f\u00fcr Technologie, Fakult\u00e4t f\u00fcr Informatik, May 2012. http:\/\/pp.info.uni-karlsruhe.de\/uploads\/publikationen\/giffhorn12thesis.pdf"},{"issue":"2","key":"257_CR9","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/s10515-009-0048-x","volume":"16","author":"D Giffhorn","year":"2009","unstructured":"Giffhorn, D., Hammer, C.: Precise slicing of concurrent programs\u2014an evaluation of precise slicing algorithms for concurrent programs. J. Autom. Softw. Eng. 16(2), 197\u2013234 (2009)","journal-title":"J. Autom. Softw. Eng."},{"key":"257_CR10","unstructured":"Giffhorn, D., Snelting, G.: Probabilistic noninterference based on program dependence graphs. Karlsruhe Reports in Informatics, 6, April 2012. http:\/\/pp.info.uni-karlsruhe.de\/uploads\/publikationen\/giffhorn12kri.pdf"},{"key":"257_CR11","doi-asserted-by":"crossref","unstructured":"Graf, J.: Speeding up context-, object- and field-sensitive sdg generation. In Proceedings of 9th SCAM, pp. 105\u2013114, September (2010)","DOI":"10.1109\/SCAM.2010.9"},{"key":"257_CR12","unstructured":"Graf, J., Hecker, M., Mohr, M.: Using joana for information flow control in java programs\u2014a practical guide. In Proceedings of 6th Working Conference on Programming Languages (ATPS\u201913), Lecture Notes in Informatics (LNI) 215. Springer, Berlin (2013)"},{"key":"257_CR13","unstructured":"Graf, J., Hecker, M., Mohr, M., Nordhoff, B.: Lock-sensitive interference analysis for java: Combining program dependence graphs with dynamic pushdown networks. In Proceedings of 1st International Workshop on Interference and Dependence, January (2013)"},{"key":"257_CR14","unstructured":"Hammer, C.: Information Flow Control for Java. PhD thesis, Universit\u00e4t Karlsruhe (TH) (2009)"},{"key":"257_CR15","doi-asserted-by":"crossref","unstructured":"Hammer, C.: Experiences with PDG-based IFC. In: Massacci, F., Wallach, D., Zannone, N. (eds.) Proceedings of ESSoS\u201910, volume 5965 of LNCS, pp 44\u201360. Springer, Berlin (2010)","DOI":"10.1007\/978-3-642-11747-3_4"},{"key":"257_CR16","doi-asserted-by":"crossref","unstructured":"Hammer, C., Snelting, G.: Flow-sensitive, context-sensitive, and object-sensitive information flow control based on program dependence graphs. Int. J. Inform. Secur. 8(6), December (2009)","DOI":"10.1007\/s10207-009-0086-1"},{"key":"257_CR17","doi-asserted-by":"crossref","unstructured":"Horwitz, S., Prins, J., Reps, T.: On the adequacy of program dependence graphs for representing programs. In: Proceedings of POPL \u201988, pp. 146\u2013157, ACM, New York (1988)","DOI":"10.1145\/73560.73573"},{"key":"257_CR18","doi-asserted-by":"crossref","unstructured":"Horwitz, S., Reps, T., Binkley, D.: Interprocedural slicing using dependence graphs. ACM Trans. Program. Lang. Syst. 12(1), 26\u201360 (1990)","DOI":"10.1145\/77606.77608"},{"key":"257_CR19","doi-asserted-by":"crossref","unstructured":"Huisman, M., Ngo, T.M.: Scheduler-specific confidentiality for multi-threaded programs and its logic-based verification. In: Proceedings of Formal Verification of Object-Oriented Systems (2011)","DOI":"10.1007\/978-3-642-31762-0_12"},{"key":"257_CR20","doi-asserted-by":"crossref","unstructured":"Huisman, M., Worah, P., Sunesen, K.: A temporal logic characterisation of observational determinism. In: Proceedings of 19th CSFW, p. 3. IEEE (2006)","DOI":"10.1109\/CSFW.2006.6"},{"key":"257_CR21","doi-asserted-by":"crossref","unstructured":"Hunt, S., Sands, D.: On flow-sensitive security types. In: POPL \u201906, pp. 79\u201390. ACM (2006)","DOI":"10.1145\/1111320.1111045"},{"key":"257_CR22","doi-asserted-by":"crossref","unstructured":"Krinke, J.: Context-sensitive slicing of concurrent programs. In: Proceedings ESEC\/FSE-11, pp. 178\u2013187, ACM, New York (2003)","DOI":"10.1145\/940071.940096"},{"key":"257_CR23","doi-asserted-by":"crossref","unstructured":"Krinke, J.: Program slicing. In: Handbook of Software Engineering and Knowledge Engineering, vol. 3: Recent Advances. World Scientific Publishing (2005)","DOI":"10.1142\/9789812775245_0011"},{"key":"257_CR24","doi-asserted-by":"crossref","unstructured":"K\u00fcsters, R., Truderung, T., Graf, J.: A framework for the cryptographic verification of java-like programs. In Computer Security Foundations Symposium (CSF), 2012 IEEE 25th. IEEE Computer Society, June (2012)","DOI":"10.1109\/CSF.2012.9"},{"key":"257_CR25","doi-asserted-by":"crossref","unstructured":"Li, L., Verbrugge, C.: A practical MHP information analysis for concurrent Java programs. In: Proceedings LCPC\u201904, volume 3602 of LNCS, pp. 194\u2013208. Springer, Berlin (2004)","DOI":"10.1007\/11532378_15"},{"key":"257_CR26","doi-asserted-by":"crossref","unstructured":"Lochbihler, A.: Java and the Java memory model\u2014a unified, machine-checked formalisation. In: Helmut, S., (ed.) Proceedings of ESOP \u201912, volume 7211 of LNCS, pp. 497\u2013517, March (2012)","DOI":"10.1007\/978-3-642-28869-2_25"},{"key":"257_CR27","doi-asserted-by":"crossref","unstructured":"Manson, J., Pugh, W., Adve, S.V..: The Java memory model. In: POPL, pp. 378\u2013391 (2005)","DOI":"10.1145\/1040305.1040336"},{"key":"257_CR28","doi-asserted-by":"crossref","unstructured":"Mantel, H., Sands, D., Sudbrock, H.: Assumptions and guarantees for compositional noninterference. In: CSF, pp. 218\u2013232 (2011)","DOI":"10.1109\/CSF.2011.22"},{"key":"257_CR29","doi-asserted-by":"crossref","unstructured":"Mantel, H., Sudbrock, H.: Flexible scheduler-independent security. In: Proceedings ESORICS, volume 6345 of LNCS, pp. 116\u2013133 (2010)","DOI":"10.1007\/978-3-642-15497-3_8"},{"key":"257_CR30","doi-asserted-by":"crossref","unstructured":"Mantel, H., Sudbrock, H.: Types vs. pdgs in information flow analysis. In: LOPSTR, pp. 106\u2013121 (2012)","DOI":"10.1007\/978-3-642-38197-3_8"},{"key":"257_CR31","doi-asserted-by":"crossref","unstructured":"Mantel, H., Sudbrock, H., Krau\u00dfer, T.: Combining different proof techniques for verifying information flow security. In: Proceedings of LOPSTR, volume 4407 of LNCS, pp. 94\u2013110 (2006)","DOI":"10.1007\/978-3-540-71410-1_8"},{"key":"257_CR32","doi-asserted-by":"crossref","unstructured":"Muller, S., Chong, S.: Towards a practical secure concurrent language. In: OOPSLA, pp. 57\u201374 (2012)","DOI":"10.1145\/2384616.2384621"},{"issue":"6","key":"257_CR33","doi-asserted-by":"crossref","first-page":"1088","DOI":"10.1145\/1186632.1186636","volume":"28","author":"MG Nanda","year":"2006","unstructured":"Nanda, M.G., Ramesh, S.: Interprocedural slicing of multithreaded programs with applications to Java. ACM Trans. Program. Lang. Syst. 28(6), 1088\u20131144 (2006)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"257_CR34","doi-asserted-by":"crossref","unstructured":"Naumovich, G., Avrunin, G.S., Clarke, L.A.: An efficient algorithm for computing MHP information for concurrent Java programs. In: Proceedings ESEC\/FSE-7, volume 1687 of LNCS, pp. 338\u2013354, London, UK (1999)","DOI":"10.1007\/3-540-48166-4_21"},{"key":"257_CR35","doi-asserted-by":"crossref","unstructured":"Ngo, T.M., Stoelinga, M., Huisman, M.: Confidentiality for probabilistic multi-threaded programs and its verification. In: ESSoS, pp. 107\u2013122 (2013)","DOI":"10.1007\/978-3-642-36563-8_8"},{"issue":"5","key":"257_CR36","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1145\/1275497.1275502","volume":"29","author":"VP Ranganath","year":"2007","unstructured":"Ranganath, V.P., Amtoft, T., Banerjee, A., Hatcliff, J., Dwyer, M.B.: A new foundation for control dependence and slicing for modern program structures. ACM Trans. Program. Lang. Syst. 29(5), 27 (2007)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"257_CR37","doi-asserted-by":"crossref","unstructured":"Reps, T., Horwitz, S., Sagiv, M., Rosay, G.: Speeding up slicing. In: Proceedings of FSE \u201994, pp. 11\u201320, ACM, New York (1994)","DOI":"10.1145\/193173.195287"},{"key":"257_CR38","unstructured":"Reps, T., Yang, W.: The semantics of program slicing. Technical Report 777, Computer Sciences Department, University of Wisconsin-Madison (1988)"},{"key":"257_CR39","doi-asserted-by":"crossref","unstructured":"Roscoe, A.W., Woodcock, J., Wulf, L.: Non-interference through determinism. In: ESORICS, volume 875 of LNCS, pp. 33\u201353 (1994)","DOI":"10.1007\/3-540-58618-0_55"},{"key":"257_CR40","doi-asserted-by":"crossref","unstructured":"Sabelfeld, A., Myers, A.: Language-based information-flow security. IEEE J. Select. Areas Commun. 21(1), 5\u201319 (January 2003)","DOI":"10.1109\/JSAC.2002.806121"},{"key":"257_CR41","unstructured":"Sabelfeld, A.: Confidentiality for multithreaded programs via bisimulation. In: Proceeding 5th International Andrei Ershov Memorial Conference, volume 2890 of LNCS, Akademgorodok, Novosibirsk, Russia, July (2003)"},{"key":"257_CR42","doi-asserted-by":"crossref","unstructured":"Sabelfeld, A., Sands, D.: Probabilistic noninterference for multi-threaded programs. In Proceedings of CSFW \u201900, p. 200, Washington, DC, USA. IEEE Computer Society (2000)","DOI":"10.1109\/CSFW.2000.856937"},{"issue":"6","key":"257_CR43","doi-asserted-by":"crossref","first-page":"591","DOI":"10.3233\/JCS-2006-14605","volume":"14","author":"G Smith","year":"2006","unstructured":"Smith, G.: Improved typings for probabilistic noninterference in a multi-threaded language. J. Comput. Secur. 14(6), 591\u2013623 (2006)","journal-title":"J. Comput. Secur."},{"key":"257_CR44","doi-asserted-by":"crossref","unstructured":"Smith, G., Volpano, D.: Secure information flow in a multi-threaded imperative language. In: Proceedings of POPL \u201998, pp. 355\u2013364. ACM, January (1998)","DOI":"10.1145\/268946.268975"},{"key":"257_CR45","doi-asserted-by":"crossref","unstructured":"Snelting, G.: Combining slicing and constraint solving for validation of measurement software. In SAS \u201996: Proceedings of the Third International Symposium on Static Analysis, pp. 332\u2013348. Springer, London (1996)","DOI":"10.1007\/3-540-61739-6_51"},{"key":"257_CR46","doi-asserted-by":"crossref","unstructured":"Snelting, G., Robschink, T., Krinke, J.: Efficient path conditions in dependence graphs for software safety analysis. ACM Trans. Softw. Eng. Methodol. 15(4), 410\u2013457 (2006)","DOI":"10.1145\/1178625.1178628"},{"key":"257_CR47","doi-asserted-by":"crossref","unstructured":"Terauchi, T.: A type system for observational determinism. In: CSF, pp. 287\u2013300 (2008)","DOI":"10.1109\/CSF.2008.9"},{"key":"257_CR48","doi-asserted-by":"crossref","unstructured":"Volpano, D.M., Smith, G.: Probabilistic noninterference in a concurrent language. J. Comput. Secur. 7(1) (1999)","DOI":"10.3233\/JCS-1999-72-305"},{"key":"257_CR49","unstructured":"Wasserrab, D.: From Formal Semantics to Verified Slicing\u2014A Modular Framework with Applications in Language Based Security. PhD thesis, Karlsruher Institut f\u00fcr Technologie, Fakult\u00e4t f\u00fcr Informatik, October (2010)"},{"key":"257_CR50","unstructured":"Wasserrab, D.: Information flow noninterference via slicing. Archive of Formal Proofs (2010)"},{"key":"257_CR51","doi-asserted-by":"crossref","unstructured":"Wasserrab, D., Lohner, D., Snelting, G.: On PDG-based noninterference and its modular proof. In: Proceedings PLAS \u201909. ACM, June (2009)","DOI":"10.1145\/1554339.1554345"},{"key":"257_CR52","doi-asserted-by":"crossref","unstructured":"Xin, B., Zhang, X.: Efficient online detection of dynamic control dependence. In: Proceedings of ISSTA, pp. 185\u2013195. ACM (2007)","DOI":"10.1145\/1273463.1273489"},{"key":"257_CR53","doi-asserted-by":"crossref","unstructured":"Zdancewic, S., Myers, A.C.: Observational determinism for concurrent program security. In: Proceedings of CSFW, pp. 29\u201343. IEEE (2003)","DOI":"10.1109\/CSFW.2003.1212703"}],"container-title":["International Journal of Information Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-014-0257-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10207-014-0257-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-014-0257-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T05:40:34Z","timestamp":1746337234000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10207-014-0257-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8,15]]},"references-count":53,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,6]]}},"alternative-id":["257"],"URL":"https:\/\/doi.org\/10.1007\/s10207-014-0257-6","relation":{},"ISSN":["1615-5262","1615-5270"],"issn-type":[{"type":"print","value":"1615-5262"},{"type":"electronic","value":"1615-5270"}],"subject":[],"published":{"date-parts":[[2014,8,15]]}}}