{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:05:49Z","timestamp":1725552349933},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642131929"},{"type":"electronic","value":"9783642131936"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13193-6_38","type":"book-chapter","created":{"date-parts":[[2010,4,27]],"date-time":"2010-04-27T11:54:59Z","timestamp":1272369299000},"page":"449-461","source":"Crossref","is-referenced-by-count":0,"title":["Gateway Decompositions for Constrained Reachability Problems"],"prefix":"10.1007","author":[{"given":"Bastian","family":"Katz","sequence":"first","affiliation":[]},{"given":"Marcus","family":"Krug","sequence":"additional","affiliation":[]},{"given":"Andreas","family":"Lochbihler","sequence":"additional","affiliation":[]},{"given":"Ignaz","family":"Rutter","sequence":"additional","affiliation":[]},{"given":"Gregor","family":"Snelting","sequence":"additional","affiliation":[]},{"given":"Dorothea","family":"Wagner","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"38_CR1","unstructured":"Attali, P.I.I., Jensen, T., Cards, J.O.S., Bieber, P., Cazin, J., El-marouani, A., Girard, P., louis Lanet, J., Wiels, V., Zanon, G.: The PACAP Prototype: a Tool for Detecting Java Card Illegal Flow (2001)"},{"issue":"6","key":"38_CR2","doi-asserted-by":"publisher","first-page":"1265","DOI":"10.1145\/295656.295663","volume":"20","author":"A.L. Buchsbaum","year":"1998","unstructured":"Buchsbaum, A.L., Kaplan, H., Rogers, A., Westbrook, J.R.: Linear-Time Pointer-Machine Algorithms for Least Common Ancestors, MST Verification, and Dominators. ACM TOPLAS\u00a020(6), 1265\u20131296 (1998)","journal-title":"ACM TOPLAS"},{"key":"38_CR3","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. The MIT Press, Cambridge (2001)"},{"key":"38_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/978-3-540-72788-0_26","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2007","author":"N. Een","year":"2007","unstructured":"Een, N., Mishchenko, A., S\u00f6rensson, N.: Applying Logic Synthesis for Speeding Up SAT. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, vol.\u00a04501, pp. 272\u2013286. Springer, Heidelberg (2007)"},{"key":"38_CR5","series-title":"Lecture Notes in Computer Science","first-page":"333","volume-title":"Theory and Applications of Satisfiability Testing","author":"N. Een","year":"2004","unstructured":"Een, N., S\u00f6rensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol.\u00a02919, pp. 333\u2013336. Springer, Heidelberg (2004)"},{"issue":"2","key":"38_CR6","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0304-3975(80)90009-2","volume":"10","author":"S. Fortune","year":"1980","unstructured":"Fortune, S., Hopcroft, J., Wyllie, J.: The Directed Subgraph Homeomorphism Problem. Theoretical Computer Science\u00a010(2), 111\u2013121 (1980)","journal-title":"Theoretical Computer Science"},{"key":"38_CR7","doi-asserted-by":"crossref","unstructured":"Giffhorn, D., Hammer, C.: Precise Analysis of Java Programs using JOANA (Tool Demonstration). In: 8th IEEE Int\u2019l. Working Conference on Source Code Analysis and Manipulation, pp. 267\u2013268 (2008)","DOI":"10.1109\/SCAM.2008.17"},{"key":"38_CR8","unstructured":"Hammer, C.: Information Flow Control for Java - A Comprehensive Approach based on Path Conditions in Dependence Graphs. PhD thesis, Universit\u00e4t Karlsruhe (TH), Fak. f. Informatik (July 2009) ISBN 978-3-86644-398-3"},{"issue":"4","key":"38_CR9","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1145\/262004.262005","volume":"19","author":"P. Havlak","year":"1997","unstructured":"Havlak, P.: Nesting of Reducible and Irreducible Loops. ACM Trans. Program. Lang. Syst.\u00a019(4), 557\u2013567 (1997)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"38_CR10","unstructured":"Hermann, M.: Constrained Reachability is NP-complete (March 1998) (manuscript)"},{"key":"38_CR11","first-page":"495","volume-title":"ICSE 1996: Proc. of the 18th Int\u2019l. Conf. on Software Engineering","author":"L. Larsen","year":"1996","unstructured":"Larsen, L., Harrold, M.J.: Slicing Object-Oriented Software. In: ICSE 1996: Proc. of the 18th Int\u2019l. Conf. on Software Engineering, pp. 495\u2013505. IEEE, Los Alamitos (1996)"},{"issue":"1","key":"38_CR12","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1145\/357062.357071","volume":"1","author":"T. Lengauer","year":"1979","unstructured":"Lengauer, T., Tarjan, R.E.: A Fast Algorithm for Finding Dominators in a Flowgraph. ACM TOPLAS\u00a01(1), 121\u2013141 (1979)","journal-title":"ACM TOPLAS"},{"key":"38_CR13","doi-asserted-by":"crossref","unstructured":"Ramalingam, G.: On Loops, Dominators, and Dominance Frontier. In: PLDI 2000: Proc. of the ACM SIGPLAN 2000 Conf. on Programming Language Design and Implementation (2000)","DOI":"10.1145\/349299.349330"},{"key":"38_CR14","unstructured":"Robschink, T.: Pfadbedingungen in Abh\u00e4ngigkeitgraphen und ihre Anwendung in der Softwaresicherheitstechnik. PhD thesis, Universit\u00e4t Passau (2004)"},{"issue":"1","key":"38_CR15","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1093\/comjnl\/28.1.5","volume":"28","author":"N. Santoro","year":"1985","unstructured":"Santoro, N., Khatib, R.: Labelling and Implicit Routing in Networks. The Computer Journal\u00a028(1), 5\u20138 (1985)","journal-title":"The Computer Journal"},{"issue":"4","key":"38_CR16","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1145\/1178625.1178628","volume":"14","author":"G. Snelting","year":"2006","unstructured":"Snelting, G., Robschink, T., Krinke, J.: Efficient Path Conditions in Dependence Graphs for Software Safety Analysis. ACM TOSEM\u00a014(4), 410\u2013457 (2006)","journal-title":"ACM TOSEM"},{"issue":"6","key":"38_CR17","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1145\/236114.236115","volume":"18","author":"V.C. Sreedhar","year":"1996","unstructured":"Sreedhar, V.C., Gao, G.R., Lee, Y.-F.: Identifying Loops Using DJ Graphs. ACM Transactions on Programming Languages and Systems\u00a018(6), 649\u2013658 (1996)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"38_CR18","unstructured":"Steensgaard, B.: Sequentializing Program Dependence Graphs for Irreducible Programs. Technical report, Microsoft Research, Redmond (1993)"},{"key":"38_CR19","first-page":"355","volume":"9","author":"R.E. Tarjan","year":"1974","unstructured":"Tarjan, R.E.: Testing flow graph reducibility. J. Comput. Sci.\u00a09, 355\u2013365 (1974)","journal-title":"J. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13193-6_38.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:02:39Z","timestamp":1606186959000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13193-6_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642131929","9783642131936"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13193-6_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}