{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T04:08:06Z","timestamp":1746331686936,"version":"3.40.4"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319095806"},{"type":"electronic","value":"9783319095813"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-09581-3_11","type":"book-chapter","created":{"date-parts":[[2014,8,2]],"date-time":"2014-08-02T11:20:14Z","timestamp":1406978414000},"page":"153-168","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Hardness of Firewall Analysis"],"prefix":"10.1007","author":[{"given":"Ehab S.","family":"Elmallah","sequence":"first","affiliation":[]},{"given":"Mohamed G.","family":"Gouda","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,8,3]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Acharya, H.B., Gouda, M.G.: Firewall verification and redundancy checking are equivalent. In: Proceedings of the 30th IEEE International Conference on Computer Communication (INFOCOM), pp. 2123\u20132128 (2011)","DOI":"10.1109\/INFCOM.2011.5935023"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Acharya, H.B., et al.: Projection and division: linear space verification of firewalls. In: Proceedings of the 30th International Conference on Distributed Computing Systems (ICDCS), pp. 736\u2013743 (2010)","DOI":"10.1109\/ICDCS.2010.68"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Acharya, H.B., et al.: Linear-time verification of firewalls. In: Proceedings of the 17th IEEE International Conference on Network Protocols (ICNP), pp. 133\u2013140 (2009)","DOI":"10.1109\/ICNP.2009.5339691"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Al-Shaer, E., Marrero, W., El-Atawy, A., Elbadawi, K.: Network configuration in a box: towards end-to-end verification of network reachability and security. In: 17th IEEE International Conference on Network Protocols (ICNP), pp. 123\u2013132 (2009)","DOI":"10.1109\/ICNP.2009.5339690"},{"issue":"13","key":"11_CR5","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/j.tcs.2004.08.002","volume":"329","author":"T Brueggemann","year":"2004","unstructured":"Brueggemann, T., Kern, W.: An improved deterministic local search algorithm for 3-SAT. Theoret. Comput. Sci. 329(13), 303\u2013313 (2004)","journal-title":"Theoret. Comput. Sci."},{"key":"11_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"Theory and Applications of Satisfiability Testing","author":"N E\u00e9n","year":"2004","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502\u2013518. Springer, Heidelberg (2004)"},{"key":"11_CR7","unstructured":"Elmallah, E.S., Gouda, M.G.: Hardness of firewall analysis. Technical Report TR13-08, University of Alberta, Edmonton, Alberta, Canada T6G 2E8. http:\/\/hdl.handle.net\/10402\/era.36864 (2013). Accessed April 2014"},{"key":"11_CR8","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, San Francisco (1979)"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Hoffman, D., Yoo, K.: Blowtorch: a framework for firewall test automation. In: Proceedings of the 20th IEEE\/ACM international Conference on Automated Software Engineering, ASE \u201905, pp. 96\u2013103 (2005)","DOI":"10.1145\/1101908.1101925"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-642-17517-6_9","volume-title":"Algorithms and Computation","author":"K Iwama","year":"2010","unstructured":"Iwama, K., Seto, K., Takai, T., Tamaki, S.: Improved randomized algorithms for 3-SAT. In: Cheong, O., Chwa, K.-Y., Park, K. (eds.) ISAAC 2010, Part I. LNCS, vol. 6506, pp. 73\u201384. Springer, Heidelberg (2010)"},{"issue":"3","key":"11_CR11","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1016\/S0167-4048(03)00310-9","volume":"22","author":"S Kamara","year":"2003","unstructured":"Kamara, S., Fahmy, S., Schultz, E., Kerschbaum, F., Frantzen, M.: Analysis of vulnerabilities in internet firewalls. Comput. Secur. 22(3), 214\u2013232 (2003)","journal-title":"Comput. Secur."},{"key":"11_CR12","doi-asserted-by":"publisher","first-page":"1237","DOI":"10.1109\/TPDS.2007.70802","volume":"19","author":"AX Liu","year":"2008","unstructured":"Liu, A.X., Gouda, M.G.: Diverse firewall design. IEEE Trans. Parallel Distrib. Syst. 19, 1237\u20131251 (2008)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"11_CR13","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1109\/TPDS.2008.216","volume":"21","author":"AX Liu","year":"2010","unstructured":"Liu, A.X., et al.: Complete redundancy removal for packet classifiers in TCAMs. IEEE Trans. Parallel Distrib. Syst. 21, 424\u2013437 (2010)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Mayer, A., Wool, A., Ziskind, E.: Fang: a firewall analysis engine. In: IEEE Symposium on Security and Privacy, pp. 177\u2013187 (2000)","DOI":"10.1109\/SECPRI.2000.848455"},{"issue":"3","key":"11_CR15","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1109\/TNET.2007.893156","volume":"15","author":"D Taylor","year":"2007","unstructured":"Taylor, D., Turner, J.: Classbench: a packet classification benchmark. IEEE\/ACM Trans. Networking 15(3), 499\u2013511 (2007)","journal-title":"IEEE\/ACM Trans. Networking"},{"issue":"6","key":"11_CR16","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1109\/MC.2004.2","volume":"37","author":"A Wool","year":"2004","unstructured":"Wool, A.: A quantitative study of firewall configuration errors. Computer 37(6), 62\u201367 (2004)","journal-title":"Computer"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Zhang, S., Mahmoud, A., Malik, S., Narain, S.: Verification and synthesis of firewalls using SAT and QBF. In: 20th IEEE International Conference on Network Protocols (ICNP), pp. 1\u20136 (2012)","DOI":"10.1109\/ICNP.2012.6459944"}],"container-title":["Lecture Notes in Computer Science","Networked Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-09581-3_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T01:49:37Z","timestamp":1746323377000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-09581-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319095806","9783319095813"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-09581-3_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"3 August 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}